Leonardo de Moura
|
339a7334f8
|
feat(library/data/finset/card): add exists_two_of_card_gt_one
|
2015-07-03 14:01:15 -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 |
|
Leonardo de Moura
|
4ae9f3ea81
|
feat(library/coercion): new coercion manager
closes #668
|
2015-07-01 16:32:34 -07:00 |
|
Leonardo de Moura
|
0f64a6e545
|
feat(library/data/rat/order): use 'trans-instance' to improve performance of migrate command
|
2015-07-01 08:57:10 -07:00 |
|
Leonardo de Moura
|
cf574d0127
|
feat(library): assign priorities to notation declarations in the standard library
Now, even if the user opens the namespaces in the "wrong" order, the
notation + coercions will behave as expected.
|
2015-06-30 17:38:13 -07:00 |
|
Leonardo de Moura
|
b5444c1314
|
refactor(frontends/lean/builtin_cmds): allow "constant" edges in the instance transitive closure graph
|
2015-06-29 18:57:05 -07:00 |
|
Jeremy Avigad
|
e6ce5d9b72
|
refactor(library/data/fin): put fin.val coercion in fin namespace
|
2015-06-29 21:24:38 +10:00 |
|
Jeremy Avigad
|
a54fb42f87
|
refactor(library/data/int/basic): put int.of_nat coercion in int namespace
|
2015-06-29 21:00:42 +10:00 |
|
Jeremy Avigad
|
130eb3f6d9
|
fix(library/data/int/basic): change notation from -[n+1] to -[1+n] to avoid conflict e.g. with -[coercions]
|
2015-06-29 15:23:11 +10: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
|
1a164d8fc9
|
feat(library/algebra/ordered_group): 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
|
93e5124d71
|
feat(library/algebra/order): add lattices, min, max
|
2015-06-29 15:23:11 +10:00 |
|
Leonardo de Moura
|
3cd81051c6
|
refactor(library/data/real/division): remove unnecessary 'xrewrite'
|
2015-06-27 14:07:32 -07:00 |
|
Jeremy Avigad
|
f8d8a2aed6
|
feat(library/data/nat/div): add characterization of mod
|
2015-06-27 18:51:44 +10:00 |
|
Jeremy Avigad
|
829c3fb22c
|
refactor(library/data/int/div): reorient of_nat_div and of_nat_mod
|
2015-06-27 18:47:36 +10:00 |
|
Jeremy Avigad
|
7c118f40fe
|
feat(library/data/nat/sub): add calculation facts for sub
|
2015-06-27 18:41:57 +10:00 |
|
Leonardo de Moura
|
a2cbf3dbca
|
refactor(library/data/fin): adjust proofs to support new approach for projections
|
2015-06-26 17:18:29 -07:00 |
|
Floris van Doorn
|
124c9d3d8a
|
feat(hott): various cleanup and fixes, rename \~ to ~, expand types.pointed
|
2015-06-25 22:31:40 -04:00 |
|
Leonardo de Moura
|
d2e64d30e8
|
refactor(library/data/quotient): make proofs more robust
|
2015-06-25 17:48:58 -07:00 |
|
Jeremy Avigad
|
a0461262d0
|
feat(library/data/real/*.lean): migrate theorems from algebra
|
2015-06-25 17:30:12 -07:00 |
|
Rob Lewis
|
4161b9ccbf
|
feat(library/data/real): rearrange constant sequence theorems to introduce rat coercion earlier. begin migrating theorems from algebra
|
2015-06-25 17:30:12 -07:00 |
|
Rob Lewis
|
afcf785f03
|
chore(library/data): update data.md
|
2015-06-25 17:30:12 -07:00 |
|
Leonardo de Moura
|
8967f57818
|
refactor(library/data/list): reduce reliance on definitional equality
|
2015-06-24 15:58:19 -07:00 |
|
Jeremy Avigad
|
7d204fdd91
|
refactor(library/data/finset/card.lean): add useful facts, shorter proof of eq_card_of_eq_subset
|
2015-06-20 21:13:00 -07:00 |
|
Leonardo de Moura
|
ee0d919c6f
|
feat(library/data/finset/card): add eq_of_card_eq_of_subset theorem
|
2015-06-19 20:05:32 -07:00 |
|
Leonardo de Moura
|
2910c780d0
|
feat(library/data/finset/basic): add auxiliary card lemma
|
2015-06-19 20:05:32 -07:00 |
|
Leonardo de Moura
|
4246a64913
|
feat(library/data/finset/basic): add more theorems for finset erase
|
2015-06-19 20:05:32 -07:00 |
|
Leonardo de Moura
|
70fc05294b
|
refactor(library/local_context): avoid hack in local_context
|
2015-06-18 15:41:00 -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 |
|
Haitao Zhang
|
1aff1f7cde
|
fix(library/data/fintype/function): make inj_of_nodup and nodup_of_inj more general
|
2015-06-16 19:17:53 -07:00 |
|
Haitao Zhang
|
8817042318
|
feat(library/data/fin) : establish add_comm_group on fin using madd
|
2015-06-16 16:38:47 -07:00 |
|
Leonardo de Moura
|
d43e0891ae
|
fix(library/init/logic): make sure library can be compiled using '--to_axiom' option
|
2015-06-16 13:10:08 -07:00 |
|
Rob Lewis
|
a72ca936c0
|
chore(library/real): replace theorems with versions from algebra
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
b94d0a948d
|
chore(library/data/real): replace theorems with more general versions from algebra
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
8d0518444d
|
chore(library/data/{pnat, real}): rename pnat theorems
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
ff0ba6687e
|
feat(library/algebra/ordered_field): move identity about abs to ordered_field
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
090f00458d
|
chore(library/data/real): remove redundant theorems
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
34868d196e
|
feat(library/data/rat): define pos natural upper bounds of rationals
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
1f4765e30a
|
feat(library/algebra/ordered_ring): add theorems used for rational upper bounds
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
cf7c85e5fd
|
feat(library/data/real): fill in lots of sorrys about pnats
|
2015-06-16 11:30:12 -07:00 |
|
Rob Lewis
|
a79ec6b0d4
|
feat(library/data/pnat): move facts about positive nats to their own file
|
2015-06-16 11:30:12 -07: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 |
|