Dan Frumin 6971697c09 Add the difference operation		2017-06-14 18:06:16 +02:00
..
_CoqProject	first step toward cons-union iso: construction of min function for FSet A, where A is Totally Ordered. To construct min, various lemmas about empty set are needed. This min function is constructed in a very inefficient way w.r.t. proofs of assoc, comm, etc.	2017-06-03 00:08:12 +02:00
definition.v	first step toward cons-union iso: construction of min function for FSet A, where A is Totally Ordered. To construct min, various lemmas about empty set are needed. This min function is constructed in a very inefficient way w.r.t. proofs of assoc, comm, etc.	2017-06-03 00:08:12 +02:00
empty_set.v	first step toward cons-union iso: construction of min function for FSet A, where A is Totally Ordered. To construct min, various lemmas about empty set are needed. This min function is constructed in a very inefficient way w.r.t. proofs of assoc, comm, etc.	2017-06-03 00:08:12 +02:00
operations.v	Add the difference operation	2017-06-14 18:06:16 +02:00
ordered.v	Comment out the long min fn	2017-06-14 13:08:41 +02:00
properties.v	Use equiv_iff_hprop_curried from HoTT	2017-06-14 13:00:20 +02:00