Leonardo de Moura
|
a124bc246a
|
feat(library/data/fin): add equivalences between fin types
|
2015-07-26 15:42:39 -07:00 |
|
Leonardo de Moura
|
a883b72a25
|
fix(library/data): 'choose' -> 'find' renaming problems
|
2015-07-25 11:25:04 -07:00 |
|
Jeremy Avigad
|
d3cd0bb8ff
|
refactor(library/data/nat/find): rename 'choose' to 'find' to avoid conflict with combinatorics 'choose'
|
2015-07-25 14:02:44 -04:00 |
|
Leonardo de Moura
|
43f5f70414
|
feat(library/data/bag): add basic properties for bag intersection and union
|
2015-07-25 08:37:30 -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
|
fbaa8b21f6
|
refactor(library/data/nat): cleanup for the tutorial
|
2015-07-22 13:41:50 -07:00 |
|
Leonardo de Moura
|
e969c7a8d6
|
refactor(library): remove 'simp' hack
|
2015-07-22 10:13:19 -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
|
0de715ae54
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
Leonardo de Moura
|
48f8b8f18d
|
refactor(library): use new 'suppose'-expression
|
2015-07-19 21:15:20 -07:00 |
|
Leonardo de Moura
|
c2fc612ec1
|
fix(library/data/nat/order): add missing theorems back
|
2015-07-19 20:21:25 -07:00 |
|
Leonardo de Moura
|
d2f64d7744
|
feat(library/data/nat/order): add 'max/min' auxiliary theorems
|
2015-07-19 20:15:11 -07:00 |
|
Leonardo de Moura
|
d91627ebec
|
refactor(library): move 'max/min' to 'data/nat'
|
2015-07-19 19:47:14 -07:00 |
|
Leonardo de Moura
|
92f8eb173b
|
feat(frontends/lean): use 'this' as the name for anonymous 'have'-expression
|
2015-07-18 13:36:05 -05:00 |
|
Leonardo de Moura
|
ade60278d0
|
refactor(library): rename iff.mp' to iff.mpr
|
2015-07-18 08:52:58 -05:00 |
|
Leonardo de Moura
|
9d83361fdc
|
refactor(library): use subtype instead of sigma
|
2015-07-16 22:48:33 -04:00 |
|
Leonardo de Moura
|
89f69630b6
|
feat(library): use sigma instead of exists (experimental)
|
2015-07-15 15:49:47 -04:00 |
|
Leonardo de Moura
|
3ab0e07ba9
|
feat(frontends/lean): add simp tactic frontend stub
This commit also removes the fake_simplifier. It doesn't work anymore
because simp is now a reserved word.
|
2015-07-14 09:54:53 -04:00 |
|
Haitao Zhang
|
5034de9c4e
|
feat(library/data/nat/power): add nat power divide theorems
|
2015-07-13 22:02:17 -04:00 |
|
Leonardo de Moura
|
ebe6ec0017
|
feat(library): add '[rewrite]' annotation some some theorems
|
2015-07-13 16:39:53 -04:00 |
|
Jeremy Avigad
|
70407473c2
|
feat(library/theories/combinatorics/choose): begin theory of binomial coefficients
|
2015-07-11 19:01:43 -04:00 |
|
Leonardo de Moura
|
8e8e08cfe7
|
feat(library/tactic): use occurrence object in unfold tactic family
|
2015-07-11 18:53:45 -04:00 |
|
Leonardo de Moura
|
d939509135
|
doc(library/data/nat/examples): add tail recursive fib example
|
2015-07-10 20:38:07 -04:00 |
|
Leonardo de Moura
|
fc82b46171
|
chore(library/data/nat/examples/fib): cleanup example
|
2015-07-10 08:18:30 -04:00 |
|
Leonardo de Moura
|
32cc2e917b
|
doc(library/data/nat/examples): add examples
|
2015-07-09 21:56:48 -04:00 |
|
Jeremy Avigad
|
2e3b1b04cd
|
feat(library/algebra/ring_power): add properties of power in ring structures
|
2015-07-07 21:05:48 -07:00 |
|
Jeremy Avigad
|
31aeff95d5
|
refactor(library/algebra/ordered_ring): remove 0 ~= 1 from ordered_semiring, add 0 < 1 to linear_ordered_semiring
|
2015-07-07 21:05:48 -07:00 |
|
Jeremy Avigad
|
e35f05ad47
|
feat(library/data/nat/order): add greatest i < n st P i
|
2015-07-07 21:05:48 -07:00 |
|
Leonardo de Moura
|
01ba0b4747
|
feat(library/logic/equiv): add equivalence between types
This is a good test for the simplifier
|
2015-07-06 11:17:03 -07:00 |
|
Leonardo de Moura
|
9ccd8ff700
|
feat(library/data/nat/parity): cleanup proofs
|
2015-07-05 09:35:15 -07:00 |
|
Leonardo de Moura
|
f4f77e7f0b
|
feat(library): move data/nat/primes to theories/number_theory
|
2015-07-04 09:49:14 -07:00 |
|
Leonardo de Moura
|
aee8bd8b0c
|
feat(library/data/nat): add coprime_primes theorem
|
2015-07-04 00:37:09 -07:00 |
|
Leonardo de Moura
|
e630511184
|
feat(library/data/nat/primes): add more simple theorems for primes
|
2015-07-03 23:31:04 -07:00 |
|
Leonardo de Moura
|
30ef971bc0
|
feat(library/data/nat): add basic facts about parity
|
2015-07-03 17:38:23 -07:00 |
|
Leonardo de Moura
|
aa2a5b6282
|
feat(library/data/nat/primes): add infinite primes theorem
|
2015-07-03 00:31:54 -07:00 |
|
Leonardo de Moura
|
372d17ab96
|
refactor(library/data/nat/primes): rename is_prime to prime
|
2015-07-02 23:21:10 -07:00 |
|
Leonardo de Moura
|
d76edf331b
|
feat(library/data/nat/bquant): add not bex and not ball lemmas
|
2015-07-02 23:18:02 -07:00 |
|
Leonardo de Moura
|
e811bb1a66
|
chore(library/data/nat/default): add new files to nat/default
|
2015-07-02 22:28:51 -07:00 |
|
Leonardo de Moura
|
5917a26554
|
feat(library/data/nat/primes): add is_prime
|
2015-07-02 22:27:51 -07:00 |
|
Leonardo de Moura
|
072fa7ec49
|
feat(library/data/nat): add aux lemmas
|
2015-07-02 22:27:21 -07:00 |
|
Leonardo de Moura
|
e33946ff02
|
feat(library/data/nat/fact): define factorial
|
2015-07-02 20:25:34 -07:00 |
|
Jeremy Avigad
|
b19331f28f
|
feat(library/data/nat/order): add theorems for max and min
|
2015-06-29 15:23:11 +10:00 |
|
Jeremy Avigad
|
70e551c6d6
|
feat(library/algebra/order,library/data/nat/order,library/*): instantiate nat to lattice, add theorems
|
2015-06-29 15:23:11 +10:00 |
|
Jeremy Avigad
|
f8d8a2aed6
|
feat(library/data/nat/div): add characterization of mod
|
2015-06-27 18:51:44 +10:00 |
|
Jeremy Avigad
|
7c118f40fe
|
feat(library/data/nat/sub): add calculation facts for sub
|
2015-06-27 18:41:57 +10:00 |
|
Jeremy Avigad
|
9249ebdaab
|
feat(library/data/{nat,int}/div.lean): add properties of add and mod
|
2015-06-15 22:53:11 +10:00 |
|
Jeremy Avigad
|
a4a8253f50
|
refactor(library,hott,tests): rename succ_inj to succ.inj, add abbreviation eq_of_succ_eq_succ
|
2015-06-15 22:52:38 +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
|
7f5caab694
|
feat(nat): redefine le and lt in the standard library
|
2015-06-04 20:14:13 -04:00 |
|
Leonardo de Moura
|
7a39d5aaa3
|
feat(library/data): add auxiliary definitions
|
2015-06-02 22:08:25 -07:00 |
|