Leonardo de Moura
|
dfaf1c2ba3
|
refactor(library): move basic theorems to init, remove sorry's from algebra/simplifier.lean
|
2015-11-16 10:26:09 -08: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 |
|
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 |
|
Mario Carneiro
|
066b0fcdf9
|
feat(library): clean up "sorry"s in library
Breaking changes: pnat was redefined to use subtype instead of a custom inductive type, which affects the notation for pnat 2 and 3
|
2015-07-24 12:21:33 -04:00 |
|
Leonardo de Moura
|
18dd7c13f9
|
feat(frontends/lean): add '[congr]' attribute
|
2015-07-22 17:21:47 -07:00 |
|
Leonardo de Moura
|
092c8d05b9
|
feat(frontends/lean,library): rename '[rewrite]' to '[simp]'
|
2015-07-22 09:01:42 -07:00 |
|
Leonardo de Moura
|
ade60278d0
|
refactor(library): rename iff.mp' to iff.mpr
|
2015-07-18 08:52:58 -05:00 |
|
Leonardo de Moura
|
ebe6ec0017
|
feat(library): add '[rewrite]' annotation some some theorems
|
2015-07-13 16:39:53 -04:00 |
|
Jeremy Avigad
|
1c93c5bbb2
|
feat(library/logic/{connectives.lean,quantiers.lean}): add iff congruence rules
|
2015-06-08 16:58:08 +10:00 |
|
Floris van Doorn
|
ff41886a32
|
feat(nat/bquant): give instances for quantification bounded with le
also add theorems c_iff_c to logic/connectives, where c is a connective
|
2015-06-04 20:14:13 -04:00 |
|
Floris van Doorn
|
876aa20ad6
|
feat(hott): Port remainder of §6.3 and §7.2 from the HoTT book
Also prove a theorem similar to Lemma 7.3.1
There are still some sorry's in hit.suspension
|
2015-06-04 20:14:12 -04:00 |
|
Jeremy Avigad
|
df69bb4cfc
|
feat(library/*): add theorems from Haitao on sets and functions, clean up
|
2015-06-04 11:55:25 -07:00 |
|
Jeremy Avigad
|
03952ae12c
|
feat(library/logic/{connectives,identities},library/algebra/function): cleanup and some additions from Haitao Zhang
|
2015-06-04 11:55:25 -07:00 |
|
Leonardo de Moura
|
2f9005827c
|
feat(library/init/logic): 'if-then-else' and 'dependent-if-then-else' congruence theorems
We will use these theorems to test the new simplifier.
|
2015-06-02 13:27:50 -07:00 |
|
Jeremy Avigad
|
e4c75ae8ae
|
feat(library/logic/connective.lean): add distributivity laws
|
2015-05-08 19:51:37 +10:00 |
|
Leonardo de Moura
|
7aa0e466a5
|
test(library): test new 'obtain' expression in the standard library
|
2015-05-05 18:30:16 -07:00 |
|
Jeremy Avigad
|
e76e445ece
|
feat(library/logic/connectives.lean): add calculation rules for true and false, and move exists unique to quantifiers
|
2015-04-05 12:15:21 -04:00 |
|
Leonardo de Moura
|
c04c610b7b
|
feat(frontends/lean): add 'assert H : A, ...' as notation for 'have H [visible] : A, ...'
|
2015-02-25 14:30:42 -08:00 |
|
Leonardo de Moura
|
abe129aa4f
|
refactor(library): rename theorems "iff.flip_sign -> not_iff_not_of_iff" and "decidable_iff_equiv -> decidable_of_decidable_of_iff"
|
2014-12-15 19:17:51 -08:00 |
|
Leonardo de Moura
|
5cf8064269
|
refactor(library): rename exists_elim and exists_intro to exists.elim
and exists.intro
|
2014-12-15 19:07:38 -08:00 |
|
Jeremy Avigad
|
da719e6ee4
|
refactor(library/logic): rename theorems
|
2014-12-15 16:13:04 -05:00 |
|
Jeremy Avigad
|
3e9a484851
|
refactor(library/logic/connectives): rename theorems
|
2014-12-15 15:05:44 -05:00 |
|
Leonardo de Moura
|
477d79ae47
|
refactor(library/init): move more theorems to logic
|
2014-12-12 13:50:53 -08:00 |
|
Leonardo de Moura
|
d6c8e23b03
|
refactor(library/init/logic): move theorems to library/logic
|
2014-12-12 13:24:17 -08:00 |
|
Leonardo de Moura
|
697d4359e3
|
refactor(library): add 'init' folder
|
2014-11-30 20:34:12 -08:00 |
|
Leonardo de Moura
|
dad94eafbe
|
refactor(data/nat/decl): use new naming convention at data/nat/decl.lean
|
2014-11-30 15:07:09 -08:00 |
|
Leonardo de Moura
|
29a0d3109b
|
refactor(library/logic/connectives): mark theorems used to prove 'decidable' theorems as transparent
if we don't this, then 'if-then-else' expressions depending on theorems
such as 'and_decidable', 'or_decidable' will not compute inside the kernel
|
2014-11-22 09:32:43 -08:00 |
|
Leonardo de Moura
|
6c7e23ecaa
|
refactor(library): use 'reserve' notation in the standard library
|
2014-10-21 15:39:47 -07:00 |
|
Leonardo de Moura
|
d6d0593afb
|
refactor(library): remove some unnecessary sections
|
2014-10-10 16:33:58 -07:00 |
|
Leonardo de Moura
|
73aa024c31
|
refactor(library/logic): remove 'core' subdirectory
|
2014-10-05 10:50:13 -07:00 |
|