Niels
|
bae04a6d2b
|
Lowercase enumerated
|
2017-08-01 15:20:17 +02:00 |
Niels
|
1eec9628ce
|
Lowercase files
|
2017-08-01 15:18:07 +02:00 |
Niels
|
fed9546d11
|
Some cleanup
|
2017-08-01 15:18:07 +02:00 |
Dan Frumin
|
37e3017cfc
|
Basic properties of enumerated sets
|
2017-07-31 17:39:01 +02:00 |
Niels
|
b06c59339b
|
Small fix
|
2017-07-31 14:54:20 +02:00 |
Niels
|
8ff9089d3d
|
Added disjunction.
|
2017-07-31 14:52:41 +02:00 |
Dan Frumin
|
f4d89f810c
|
Proof that the trunctation is really needed
If there is no 0-truncation then the resulting type is not an h-set.
|
2017-06-21 14:10:59 +02:00 |
Dan Frumin
|
ab48ab4a75
|
Decidable equality on FSets
|
2017-06-21 11:22:56 +02:00 |
Dan Frumin
|
1a3bb2cb5a
|
Use the [Functorish] instance from the HoTT library
|
2017-06-21 11:07:22 +02:00 |
Niels
|
3274bed4e0
|
Lists and finite sets
|
2017-06-20 17:33:35 +02:00 |
Niels
|
c8a84349b1
|
Further work on lists (simple implementation)
|
2017-06-20 15:08:52 +02:00 |
Niels
|
8c31e4d382
|
Lists implement finite sets
|
2017-06-20 13:54:42 +02:00 |
Dan Frumin
|
a95ddea6ca
|
FSet is a strong powerset monad
|
2017-06-20 11:34:09 +02:00 |
Dan Frumin
|
47a38b3568
|
Separate the lattice properties proofs, get rid of the admits and general cleanup
|
2017-06-19 21:32:55 +02:00 |
Dan Frumin
|
8e6ab4c340
|
Separate the extensionality proof
and fix some tactics
|
2017-06-19 21:06:17 +02:00 |
Niels
|
229df7b270
|
Shortened proofs
|
2017-06-19 17:54:44 +02:00 |
Niels
|
5f4c834cbe
|
Proofs of the lattice properties (via extensionality)
|
2017-06-19 17:08:56 +02:00 |
Leon Gondelman
|
57d8ee9d55
|
cons representation of finite sets
|
2017-06-19 16:06:04 +02:00 |
Dan Frumin
|
490980db0f
|
Some cleanup for the extensionality proof
|
2017-06-19 12:24:57 +02:00 |
Dan Frumin
|
dce70f517f
|
Minor cleanup of some proofs
|
2017-06-16 13:24:54 +02:00 |
Dan Frumin
|
6971697c09
|
Add the difference operation
|
2017-06-14 18:06:16 +02:00 |
Dan Frumin
|
036d1599b2
|
Merge branch 'bloop'
|
2017-06-14 13:09:52 +02:00 |
Dan Frumin
|
abec9ecd00
|
Comment out the long min fn
|
2017-06-14 13:08:41 +02:00 |
Dan Frumin
|
a1a6912cb2
|
Use equiv_iff_hprop_curried from HoTT
|
2017-06-14 13:00:20 +02:00 |
Niels
|
2273ecaae0
|
Merge remote-tracking branch 'origin/leon' into properties
|
2017-06-06 11:15:13 +02:00 |
Niels
|
a98c56d154
|
changes
|
2017-06-06 11:15:01 +02:00 |
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 |
Leon Gondelman
|
f8ed41e5fe
|
trailing white spaces
|
2017-05-26 12:28:07 +02:00 |
Niels
|
2a561d4983
|
Finished proof of extensionality
|
2017-05-25 22:21:19 +02:00 |
Niels
|
01e4cb982f
|
Finished proof of extensionality
|
2017-05-25 22:20:46 +02:00 |
Niels
|
954c273ddf
|
Merge remote-tracking branch 'origin/bloop' into properties
|
2017-05-25 21:51:27 +02:00 |
Dan Frumin
|
06dc8a0acd
|
A proof of subset_isIn
|
2017-05-25 18:59:18 +02:00 |
Dan Frumin
|
294f818b07
|
Add [eq_subset] equivalence
X = Y <~> X ⊂ Y /\ Y ⊂ X
|
2017-05-25 16:28:09 +02:00 |
Dan Frumin
|
9202c6489d
|
Speed up the compilation of properties.v a little bit
|
2017-05-25 15:11:41 +02:00 |
Leon Gondelman
|
140b02e9f4
|
subset
|
2017-05-24 18:28:24 +02:00 |
Niels
|
74cd449f7b
|
Elements of union
|
2017-05-24 14:52:52 +02:00 |
Dan Frumin
|
826b6ba233
|
Port the FiniteSets library to HitTactics
|
2017-05-24 13:54:00 +02:00 |
Dan Frumin
|
25d1e1c969
|
Merge hrecursion into master
|
2017-05-24 13:00:56 +02:00 |
Niels
|
6ffbbb440f
|
More absorbtion
|
2017-05-24 12:10:39 +02:00 |
Niels
|
565fecec30
|
Changed names, further work on distributive laws
|
2017-05-24 11:47:30 +02:00 |
Niels
|
e63f1b8bf5
|
One absorption law
|
2017-05-23 23:24:22 +02:00 |
Niels
|
2f7840c494
|
Associativity of intersection.
|
2017-05-23 22:58:35 +02:00 |
Niels
|
0bdbcdfc6c
|
Recursion rule is now defined via induction.
|
2017-05-23 21:50:26 +02:00 |
Niels
|
6bb5e8b690
|
Added idempotency of the intersection
|
2017-05-23 21:31:45 +02:00 |
Leon Gondelman
|
13737556c6
|
Setup for finite sets library.
|
2017-05-23 16:30:31 +02:00 |
Dan Frumin
|
5abf0acf06
|
Switch to the DecidablePaths typeclass
|
2017-05-23 12:12:22 +02:00 |
Dan Frumin
|
ebdaab4de0
|
Merge Leon's changes into hrecursion
|
2017-05-23 12:02:06 +02:00 |
Dan Frumin
|
9d9b7a4713
|
Prettify FinSets
|
2017-05-23 11:58:09 +02:00 |
Leon Gondelman
|
afdc4a3e6b
|
intersection_comm
|
2017-05-23 11:50:52 +02:00 |
Dan Frumin
|
2f68e833af
|
Finish the comprehension_idem proof with functional extensionality
|
2017-05-23 00:17:33 +02:00 |