Jeremy Avigad
|
41342f53df
|
refactor(library/data/set/filter): get filters working with complete lattice notation
|
2016-02-22 11:25:23 -08:00 |
|
Jeremy Avigad
|
7fe71c972f
|
feat(library/data/set/basic): add theorems for bounded unions and intersections
|
2016-02-22 11:25:23 -08:00 |
|
Jeremy Avigad
|
518a77587a
|
refactor(library/data/{set,finset},library/*): use compl for set and finset complement
|
2016-02-22 11:25:23 -08:00 |
|
Jeremy Avigad
|
769ae6830d
|
feat(library/data/set/function): add facts about preimages
|
2016-02-22 11:25:23 -08:00 |
|
Jeremy Avigad
|
a72f6666e8
|
feat(library/data/set/basic): add two theorems
|
2016-02-22 11:25:23 -08:00 |
|
Jeremy Avigad
|
b8d3f34d14
|
feat(library/data/set/basic): add a couple of theorems
|
2016-02-22 11:25:23 -08:00 |
|
Rob Lewis
|
68bc41b5fe
|
feat(data/set): add missing set theorems
|
2016-02-12 11:50:11 -08:00 |
|
Rob Lewis
|
eb05741ce6
|
feat(data/set): add missing set membership theorems
|
2016-02-12 11:50:10 -08:00 |
|
Jeremy Avigad
|
53b2d90c90
|
feat(library/data/{set,finset}): add some useful facts
|
2016-01-24 16:26:57 -08:00 |
|
Johannes Hölzl
|
6d6a00f48b
|
refactor(library/algebra): fix theorem names
|
2016-01-06 10:57:55 -08:00 |
|
Johannes Hölzl
|
9c28552afb
|
feat(library/algebra): add lattice instances for Prop, fun, and set
Adds weak_order, lattice and complete_lattice instances for Prop, fun, and set. Adds supporting
theorems to various other places.
|
2016-01-06 10:57:32 -08:00 |
|
Jeremy Avigad
|
4289daddcb
|
refactor(library/data/{set,finset}/basic,library/*): change notation for image to tick mark
|
2016-01-03 18:52:25 -08:00 |
|
Jeremy Avigad
|
17f6ab3a71
|
fix(library/data/set/basic): fix spacing in notation
|
2016-01-03 18:52:25 -08:00 |
|
Jeremy Avigad
|
173368801b
|
fix(library/algebra/interval): rename namespace, and move a theorem
|
2016-01-03 18:52:25 -08:00 |
|
Jeremy Avigad
|
721f6c87bf
|
feat(library/data/set/basic): add some theorems
|
2016-01-03 18:52:25 -08:00 |
|
Leonardo de Moura
|
4f1415174e
|
refactor(library/data): "union." ==> "union_", "inter." ==> "inter_"
|
2016-01-01 16:13:44 -08:00 |
|
Jeremy Avigad
|
86b64cf43b
|
feat(library/data/set/*,library/algebra/group_bigops): better finiteness lemmas, reindexing for big operations
|
2015-12-31 15:16:57 -08:00 |
|
Jeremy Avigad
|
549feb5d7f
|
feat(library/data/set/basic): add notation and theorems for large unions and intersections
|
2015-12-26 08:02:04 -08:00 |
|
Jeremy Avigad
|
baf11d0018
|
feat(library/algebra/ring_bigops): make start on file with more properties of sums and products
|
2015-12-22 16:39:13 -05:00 |
|
Leonardo de Moura
|
ef546c5c5b
|
refactor(library): use anonymous instance implicit arguments
|
2015-12-13 11:46:48 -08:00 |
|
Jacob Gross
|
ab91f8dd5f
|
feat(library/data/set/basic): add sInter_insert
add sInter supporting lemma
|
2015-12-07 21:39:30 -08:00 |
|
Leonardo de Moura
|
b94e31a72c
|
refactor(library): remove algebra namespace
|
2015-12-05 23:50:01 -08:00 |
|
Jacob Gross
|
dd6bed371a
|
feat(library/data/set/basic): Added a supporting lemma for sUnion, which will be essential for proofs by induction on finite sets
|
2015-12-02 23:05:59 -08:00 |
|
Jeremy Avigad
|
2beb0030d6
|
refactor(library/*): protect sub in nat, div in nat and int
|
2015-11-08 14:04:59 -08:00 |
|
Leonardo de Moura
|
f14d0523ec
|
refactor(library/data/set/filter): add missing [instance] attribute
|
2015-11-08 14:04:56 -08:00 |
|
Leonardo de Moura
|
08c061e1fa
|
refactor(library/data/set): remove [reducible] annotation from set operations
|
2015-11-08 14:04:56 -08:00 |
|
Leonardo de Moura
|
fbe80d48dc
|
chore(library): remove "set_option pp.*" commands
|
2015-11-08 14:04:55 -08:00 |
|
Leonardo de Moura
|
26eb6fa849
|
feat(*): new numeral encoding
|
2015-11-08 14:04:55 -08:00 |
|
Leonardo de Moura
|
ede23a3267
|
feat(hott,library): add additional spacing hints
|
2015-09-30 17:41:44 -07:00 |
|
Sebastian Ullrich
|
d1b5031dbd
|
feat(library): add some spacing hints
|
2015-09-30 17:36:32 -07:00 |
|
Jeremy Avigad
|
719e9043cd
|
feat(library/data/set/equinumerosity): add Cantor's theorem, Schroeder-Bernstein theorem
|
2015-09-25 09:32:28 -07:00 |
|
Jeremy Avigad
|
2c7526e1fc
|
feat(library/*): add various theorems
|
2015-09-25 09:32:28 -07:00 |
|
Jeremy Avigad
|
9561e379c7
|
fix(library/data/set/basic): make set_of reducible
|
2015-09-20 19:54:46 -04:00 |
|
Jeremy Avigad
|
2ab7928257
|
refactor(library/data/set/basic): standardize intro and elim theorem names
|
2015-09-03 15:38:27 -07:00 |
|
Jeremy Avigad
|
072971f3bb
|
feat(library/data/finset/comb,library/data/set/basic): define set complement
|
2015-09-01 14:47:19 -07:00 |
|
Leonardo de Moura
|
63b93cf762
|
refactor(library/data/set/finite): make proof more robust
|
2015-08-31 17:26:24 -10:00 |
|
Leonardo de Moura
|
a06b288deb
|
fix(library/data/set/finite): the powerset notation has already been fixed
|
2015-08-16 18:47:20 -07:00 |
|
Leonardo de Moura
|
f4a81fdd73
|
fix(library/data): powerset notation
|
2015-08-13 09:04:00 -07:00 |
|
Leonardo de Moura
|
d2eb99bf11
|
refactor(library/logic): move logic/choice.lean to init/classical.lean
choice axiom is now in the classical namespace.
|
2015-08-12 18:37:33 -07:00 |
|
Leonardo de Moura
|
cb9830beaf
|
refactor(library/logic/choice): move prop_decidable instance into namespace 'classical'
|
2015-08-12 17:06:15 -07:00 |
|
Leonardo de Moura
|
f9b2b93f7a
|
refactor(library/algebra/complete_lattice): add alternative definitions of complete_lattice and convertions between them
|
2015-08-09 20:40:07 -07:00 |
|
Jeremy Avigad
|
d17f72eb7c
|
fix(library/data/set/filter): adapt to change in complete_lattice structure
|
2015-08-09 22:36:04 -04:00 |
|
Jeremy Avigad
|
b130a144c8
|
feat(library/data/set/filter): add filters, show they form a complete lattice
|
2015-08-09 22:14:25 -04:00 |
|
Jeremy Avigad
|
244052b413
|
refactor(library/data/set/*): rename setext to ext
|
2015-08-09 22:14:25 -04:00 |
|
Jeremy Avigad
|
209d7b07aa
|
feat(library/data/set/basic): add a few theorems
|
2015-08-09 22:13:18 -04:00 |
|
Leonardo de Moura
|
b2415f7b4b
|
feat(library/data/set/basic): add basic 'set' theorems
|
2015-08-08 23:18:20 -07:00 |
|
Jeremy Avigad
|
8f815cabc0
|
refactor(library/data/finset/comb,library/data/set/basic,library/*): rename 'filter' to 'sep' to free up 'set.filter'
|
2015-08-08 18:10:44 -04:00 |
|
Jeremy Avigad
|
f97298394b
|
feat(library/data/nat/bigops,library/data/set/card,library/*): add set versions of bigops for nat
This required splitting data/set/card.lean from data/set/finite.lean, to avoid dependencies
|
2015-08-08 17:20:23 -04:00 |
|
Jeremy Avigad
|
eaf886cb5a
|
refactor(library/algebra/group_bigops,library/*): put group_bigops in 'finset' namespace, in preparation for set versions
|
2015-08-08 04:23:52 -07:00 |
|
Jeremy Avigad
|
31eed7faea
|
feat(library/data/set,finset): finish porting properties of card to sets
|
2015-08-08 04:23:52 -07:00 |
|