Leon Gondelman
|
0d210cae04
|
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 |
Dan Frumin
|
826b6ba233
|
Port the FiniteSets library to HitTactics
|
2017-05-24 13:54:00 +02:00 |
Niels
|
0bdbcdfc6c
|
Recursion rule is now defined via induction.
|
2017-05-23 21:50:26 +02:00 |
Leon Gondelman
|
13737556c6
|
Setup for finite sets library.
|
2017-05-23 16:30:31 +02:00 |