dan
|
38d0b07ef8
|
Add some properties from the Elephant
|
2017-09-26 14:06:57 +02:00 |
|
dan
|
0e9fcbc588
|
Show that Kf (A + B) -> Kf A
|
2017-09-25 13:45:01 +02:00 |
|
dan
|
73fbe8716a
|
Minor cleanup
|
2017-09-25 12:38:03 +02:00 |
|
dan
|
617451da28
|
Some closure properties for K-finite objects
|
2017-09-24 23:35:45 +02:00 |
|
dan
|
74eaddee2a
|
minor cleanup
|
2017-09-24 18:56:32 +02:00 |
|
dan
|
bd91e18ad6
|
Fix the globality of an instance and simplify bfin_union a bit
|
2017-09-24 18:34:35 +02:00 |
|
dan
|
206bf9edb6
|
Cleanup the Pauli group example
|
2017-09-24 17:55:19 +02:00 |
|
dan
|
0def5869cd
|
Quickfix
|
2017-09-19 18:22:43 +02:00 |
|
dan
|
2cd3beec43
|
commutative -> commutativity
In accordance with the rest of the interfaces
|
2017-09-17 19:45:32 +02:00 |
|
dan
|
c2babb9422
|
Simplify the bfin_union proof.
|
2017-09-17 19:37:43 +02:00 |
|
dan
|
e8560a0c07
|
tfw importin the middle of the file
|
2017-08-24 18:52:43 +02:00 |
|
dan
|
b17a726608
|
A simple proof that Bfin implies Kfin
|
2017-08-24 18:41:31 +02:00 |
|
dan
|
c7aa3d581f
|
Update the README
|
2017-08-24 16:53:58 +02:00 |
|
dan
|
c23ea61353
|
Move aux lemmas into the plumbing file
|
2017-08-24 16:50:11 +02:00 |
|
dan
|
5afb85b000
|
Merge branch 'ezsplit'
|
2017-08-24 16:45:37 +02:00 |
|
dan
|
5e4091409d
|
The underlying type need not be an hset for the splitting lemma
|
2017-08-24 16:36:59 +02:00 |
|
dan
|
8a1405a1d8
|
A cons-based induction principle for FSets
|
2017-08-19 18:56:33 +02:00 |
|
dan
|
da60017367
|
Interval is K-finite
|
2017-08-17 22:46:47 +02:00 |
|
dan
|
ae60ac0146
|
LEM <~> all K-finite hsets are projective
and LEMoo -> all K-finite objects (not just hsets) are projective
|
2017-08-16 17:37:12 +02:00 |
|
dan
|
56d6207d07
|
Circle is Kuratowski-finite
|
2017-08-16 17:13:08 +02:00 |
|
dan
|
809382ba13
|
Every Bishop-finite set is Kuratowski-finite
|
2017-08-16 17:01:25 +02:00 |
|
dan
|
99dfd73b5a
|
K-finite objects are closed under surjections
|
2017-08-16 16:07:51 +02:00 |
|
dan
|
57a4535f87
|
B-fin => K-fin if the underlying type has decidable paths
|
2017-08-16 16:00:21 +02:00 |
|
dan
|
33808928db
|
Clean up trailing whitespaces and an unused definition.
|
2017-08-09 18:05:58 +02:00 |
|
dan
|
31e08af1d1
|
Prove that the quotient of an implementation is isomorphic to FSet
Formally, `View A <~> FSet A`
|
2017-08-09 17:59:11 +02:00 |
|
dan
|
f08918b60c
|
Move the B-finiteness proofs and simplify them a bit
|
2017-08-09 16:01:54 +02:00 |
|
dan
|
dad6686c4c
|
Make everything work with the new notation
|
2017-08-08 17:44:27 +02:00 |
|
dan
|
80dabe3162
|
Get a quotient from an implementation
|
2017-08-08 17:31:23 +02:00 |
|
dan
|
4ade6e60cc
|
Clean up the interface.v proofs
|
2017-08-08 13:18:45 +02:00 |
|
dan
|
6f016d1b7f
|
Remove a useless vernacular command
|
2017-08-03 23:25:25 +02:00 |
|
dan
|
90d795b708
|
Correspondence between enumerated subobjects and k-finite subobjects
|
2017-08-03 23:22:36 +02:00 |
|
dan
|
6d3d0eda9f
|
Construct a mapping from [FSet] to enumerated subobjects
|
2017-08-03 18:06:39 +02:00 |
|
dan
|
69b4b6d7a5
|
Fix the implicit arguments for lattice operations
|
2017-08-03 17:09:10 +02:00 |
|
dan
|
72ce66f833
|
Make [enumerated A] an hProp & show that Kf => enumerated
|
2017-08-03 17:00:02 +02:00 |
|
dan
|
c7e12d6d25
|
Enumerated implies Kurarowski-finite
|
2017-08-03 15:16:47 +02:00 |
|
dan
|
31889d4e48
|
A short lemma [FSet A = FSetC A]
|
2017-08-03 15:10:45 +02:00 |
|
dan
|
efce779b06
|
Simplify some proofs and barely improve the compilation time
|
2017-08-03 12:49:15 +02:00 |
|
dan
|
8a65852d1b
|
Fix compilation
|
2017-08-02 15:45:12 +02:00 |
|
dan
|
4141f9d456
|
Finalize the definition of K-finite (sub)objects
|
2017-08-02 14:14:14 +02:00 |
|
dan
|
37e3017cfc
|
Basic properties of enumerated sets
|
2017-07-31 17:39:01 +02:00 |
|