HITs-Examples/FiniteSets
Niels cb0af9a36a Added min function with proof of its specification 2017-08-09 15:11:14 +02:00
..
fsets Completely fixed notation 2017-08-08 17:00:30 +02:00
implementations Make everything work with the new notation 2017-08-08 17:44:27 +02:00
representations Completely fixed notation 2017-08-08 17:00:30 +02:00
variations Make everything work with the new notation 2017-08-08 17:44:27 +02:00
FSets.v Split the development into different directories 2017-08-01 15:41:53 +02:00
Sub.v Added proof that the finite sets in HoTTlibrary have no intersection and union 2017-08-09 12:07:43 +02:00
_CoqProject Added min function with proof of its specification 2017-08-09 15:11:14 +02:00
disjunction.v Improved notatio 2017-08-08 15:29:50 +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
lattice.v Improved notatio 2017-08-08 15:29:50 +02:00
notation.v Completely fixed notation 2017-08-08 17:00:30 +02:00
ordered.v Added min function with proof of its specification 2017-08-09 15:11:14 +02:00