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.

2025-11-03 15:13:51 +01:00 · 2017-06-03 00:08:12 +02:00
parent f8ed41e5fe
commit 0d210cae04
5 changed files with 1054 additions and 91 deletions
--- a/FiniteSets/_CoqProject
+++ b/FiniteSets/_CoqProject
@@ -3,3 +3,5 @@
 definition.v
 operations.v
 properties.v
+empty_set.v
+ordered.v