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
|
784184a137
|
chore(library/theories/number_theory/primes): remove unnecessary "have"
|
2015-07-18 12:48:07 -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 |
|
Jeremy Avigad
|
70407473c2
|
feat(library/theories/combinatorics/choose): begin theory of binomial coefficients
|
2015-07-11 19:01:43 -04:00 |
|
Jeremy Avigad
|
7f1993be41
|
feat(library/theories/number_theory/prime_factorization): begin theory, with multiplicity and prime_factors
|
2015-07-07 21:05:48 -07:00 |
|
Jeremy Avigad
|
ac7f7cee63
|
refactor(library/theories/number_theory/primes): add some minor theorems, and rename some theorems
|
2015-07-07 21:05:48 -07:00 |
|
Jeremy Avigad
|
d9098ff4e5
|
fix(library/theories/number_theory/bezout): make duplicate proof of prime -> irreducible an example
|
2015-07-07 21:05:48 -07:00 |
|
Leonardo de Moura
|
db1fae0461
|
feat(library/theories/number_theory/primes): cleanup proofs
|
2015-07-05 08:21:16 -07:00 |
|
Leonardo de Moura
|
d1b5a6be54
|
feat(library/theories/number_theory/primes): add Haitao's divisor_of_prime_pow lemma
|
2015-07-04 13:27:10 -07:00 |
|
Leonardo de Moura
|
f4f77e7f0b
|
feat(library): move data/nat/primes to theories/number_theory
|
2015-07-04 09:49:14 -07:00 |
|
Jeremy Avigad
|
a776e13c3b
|
feat(library/theories/number_theory/bezout): for nat, irreducible implies prime
|
2015-07-04 22:56:55 +10:00 |
|
Jeremy Avigad
|
54128eb45f
|
feat(library/theories/number_theory/bezout): add Bezout's theorem, adapted from William Peterson's project
|
2015-06-27 19:13:36 +10:00 |
|