lean2/library/data/set
2016-01-01 16:13:44 -08:00
..
basic.lean refactor(library/data): "union." ==> "union_", "inter." ==> "inter_" 2016-01-01 16:13:44 -08:00
card.lean refactor(library): use anonymous instance implicit arguments 2015-12-13 11:46:48 -08:00
classical_inverse.lean feat(library/data/set/*,library/algebra/group_bigops): better finiteness lemmas, reindexing for big operations 2015-12-31 15:16:57 -08:00
comm_semiring.lean refactor(library/data): "union." ==> "union_", "inter." ==> "inter_" 2016-01-01 16:13:44 -08:00
default.lean feat(library/data/set/filter): add filters, show they form a complete lattice 2015-08-09 22:14:25 -04:00
equinumerosity.lean feat(library/data/set/*,library/algebra/group_bigops): better finiteness lemmas, reindexing for big operations 2015-12-31 15:16:57 -08:00
filter.lean refactor(library/data): "union." ==> "union_", "inter." ==> "inter_" 2016-01-01 16:13:44 -08:00
finite.lean feat(library/data/set/*,library/algebra/group_bigops): better finiteness lemmas, reindexing for big operations 2015-12-31 15:16:57 -08:00
function.lean feat(library/data/set/*,library/algebra/group_bigops): better finiteness lemmas, reindexing for big operations 2015-12-31 15:16:57 -08:00
map.lean feat(library/data/set/*,library/algebra/group_bigops): better finiteness lemmas, reindexing for big operations 2015-12-31 15:16:57 -08:00
set.md feat(library/data/set/equinumerosity): add Cantor's theorem, Schroeder-Bernstein theorem 2015-09-25 09:32:28 -07:00