11 Commits

Author	SHA1	Message	Date
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
Leon Gondelman	140b02e9f4	subset	2017-05-24 18:28:24 +02:00
Dan Frumin	826b6ba233	Port the FiniteSets library to HitTactics	2017-05-24 13:54:00 +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