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 |
|
Jeremy Avigad
|
1b0773b604
|
feat(library/data/set/basic,finite): add more finiteness facts
|
2015-08-08 04:23:52 -07:00 |
|
Jeremy Avigad
|
7df59d8b12
|
feat(library/data/set/finite): add more finiteness facts
|
2015-08-07 13:45:16 -07:00 |
|
Jeremy Avigad
|
eb181485eb
|
feat(library/data/set/finite): start the theory of finite sets
|
2015-08-07 13:45:16 -07:00 |
|
Jeremy Avigad
|
d6bde18b46
|
feat,refactor(library/data/{finset,set}/*,src/emacs/lean-input.el): add powerset and notation, and some tidying
|
2015-08-07 13:45:15 -07:00 |
|
Jeremy Avigad
|
7b4ebb9866
|
feat,refactor(library/data/finset/*): add priorities for finset notation, add some theorems
|
2015-08-07 13:45:15 -07:00 |
|
Leonardo de Moura
|
1f304ad4b9
|
fix(frontends/lean/pp): pretty printing 'binder'
This commit also replaces many occurrences of 'binders' with 'binder'.
|
2015-07-31 11:27:38 -07:00 |
|
Leonardo de Moura
|
bbd6946a15
|
refactor(library/logic/axioms): we have only one extra axiom
|
2015-07-29 13:36:23 -07:00 |
|
Leonardo de Moura
|
308af87b69
|
feat(library): add 'noncomputable' keyword for the standard library
|
2015-07-28 21:56:35 -07:00 |
|
Jeremy Avigad
|
471c9058eb
|
fix/feat(library/logic/connectives,library/data/{finset,set}): fix names or.left_distrib etc., fix implicit arguments, and make small additions
|
2015-07-27 07:46:59 -07:00 |
|
Jeremy Avigad
|
c9d6cc5255
|
feat(library/data/{finset,set}): various basic facts
|
2015-07-25 14:02:44 -04:00 |
|
Leonardo de Moura
|
ade60278d0
|
refactor(library): rename iff.mp' to iff.mpr
|
2015-07-18 08:52:58 -05:00 |
|
Jeremy Avigad
|
d443b25dee
|
fix(library/data/{finset,set}/basic: change notation from {[a, b, c]} to '{a, b, c}
|
2015-07-11 19:01:44 -04:00 |
|
Leonardo de Moura
|
77d5657813
|
refactor(library/algebra/function): move function.lean to init folder
Motivation: this file defines basic things such as function composition.
In the HoTT library, it is located in the init folder.
|
2015-07-06 07:29:56 -07:00 |
|
Leonardo de Moura
|
d12b5613c6
|
feat(library/data/set): show that (set A) is a comm_semiring
|
2015-06-17 09:53:50 -07:00 |
|
Jeremy Avigad
|
3c1f5f4e33
|
feat(library/data/{set,finset}): add more cardinality facts, rename, and add a lemma from Haitao
|
2015-06-10 16:39:17 -07:00 |
|
Jeremy Avigad
|
1c93c5bbb2
|
feat(library/logic/{connectives.lean,quantiers.lean}): add iff congruence rules
|
2015-06-08 16:58:08 +10:00 |
|
Jeremy Avigad
|
feb385748f
|
refactor(library/data/set/map.lean): put map into set namespace
This is needed to repair a conflict in the tutorial, but it is the right thing to do anyhow. The type "map A B" should not be a top-level identifier.
|
2015-06-06 18:58:33 -07:00 |
|