Leonardo de Moura
|
e7448ca77e
|
feat(library/init/quot): add exists_rep theorem for quotients
|
2015-06-02 10:52:07 -07:00 |
|
Leonardo de Moura
|
1ea56038e3
|
feat(library/init/quot): add has_decidable_eq definition for quotients
|
2015-06-02 10:47:20 -07:00 |
|
Rob Lewis
|
b1404c5943
|
feat(library/data/real): fill in sorrys in proof that R is l.o. field
|
2015-06-01 23:00:53 +10:00 |
|
Rob Lewis
|
9843e61583
|
feat(library/data/real): define inverses of reals, prove (classically) that R is a discrete linear ordered field
|
2015-06-01 23:00:53 +10:00 |
|
Jeremy Avigad
|
82142b60f0
|
refactor(library/data/finset/basic.lean): remove finset / finset.finset duplicate
|
2015-06-01 12:35:44 +10:00 |
|
Jeremy Avigad
|
dcae29a253
|
feat(library/data/int/gcd.lean): add gcd for the integers
|
2015-06-01 12:35:44 +10:00 |
|
Jeremy Avigad
|
ffa648a090
|
feat/refactor(library/*): various additions and improvements
|
2015-06-01 12:35:44 +10:00 |
|
Jeremy Avigad
|
cdecc309b3
|
fix(library/data/finset/to_set.lean): to_set does not require decidable equality
|
2015-06-01 12:35:44 +10:00 |
|
Leonardo de Moura
|
1238f43575
|
feat(library/logic/examples): add "double-negation translation" example
|
2015-05-31 18:18:10 -07:00 |
|
Leonardo de Moura
|
ca110012d8
|
feat(library/tactic): automate "generalize-intro-induction/cases" idiom
closes #645
|
2015-05-30 21:57:28 -07:00 |
|
Jeremy Avigad
|
b76445df39
|
feat(library/data/{nat,int}/div.lean,*): improve and extend div in nat and int
|
2015-05-30 22:10:21 +10:00 |
|
Jeremy Avigad
|
c986ee305b
|
refactor(library/data/nat/gcd.lean): move gcd to a new file
|
2015-05-30 22:10:21 +10:00 |
|
Jeremy Avigad
|
cc0a620db1
|
feat(library/data/{nat,int}/div.lean): add to and improve div library
|
2015-05-30 22:10:21 +10:00 |
|
Rob Lewis
|
82f85a574d
|
feat(library/data/real): prove reals form an ordered ring
|
2015-05-29 14:11:51 +10:00 |
|
Rob Lewis
|
2273dc669e
|
feat(library/data): fill in sorrys in int and rat orderings
|
2015-05-29 14:11:51 +10:00 |
|
Rob Lewis
|
6dfcc4610b
|
feat(data): update orderings on int and nat to conform to new algebraic hierarchy
|
2015-05-29 14:11:51 +10:00 |
|
Rob Lewis
|
4b67cd1f97
|
feat(library/algebra): update algebraic hierarchy to be more constructive
|
2015-05-29 14:11:50 +10:00 |
|
Leonardo de Moura
|
00232e70d6
|
feat(hott,library): auxiliary theorems for simplifier
|
2015-05-27 16:35:56 -07:00 |
|
Leonardo de Moura
|
85409a59d3
|
feat(library/tactic/rewrite_tactic): add xrewrite and krewrite tactic variants
closes #511
|
2015-05-27 16:32:43 -07:00 |
|
Leonardo de Moura
|
dc6411b903
|
feat(library/inductive_unifier_plugin): restrict rule that was generating non-terminating behavior
see issue #632
|
2015-05-27 14:41:12 -07:00 |
|
Leonardo de Moura
|
5da4922397
|
feat(library/data/list/perm): cleanup proofs
refl and symm were refering to the setoid.refl and setoid.symm.
Moreover, they were producing harder elaboration problems
|
2015-05-27 12:30:56 -07:00 |
|
Leonardo de Moura
|
47e5633498
|
feat(frontends/lean/calc_proof_elaborator): avoid unnecessary unfolding in the calc tactic
|
2015-05-27 12:07:39 -07:00 |
|
Floris van Doorn
|
8056f326d7
|
feat(reserved_notation): make is_typeof parsing-only, add ^ to HoTT
|
2015-05-26 21:37:01 -07:00 |
|
Floris van Doorn
|
0c7e16e017
|
feat(library.data.int.basic): move theorems about successor and predecessor from HoTT to standard library
|
2015-05-26 21:37:01 -07:00 |
|
Leonardo de Moura
|
7f0951b8e7
|
feat(library/tactic): improve assumption tactic performance
|
2015-05-25 20:22:37 -07:00 |
|
Rob Lewis
|
393cefcf97
|
feat(library/data/real): define real numbers, prove they form a commutative ring
|
2015-05-26 12:05:53 +10:00 |
|
Rob Lewis
|
681f431d4b
|
feat(library/data/rat): make rat subtraction reducible, fix migration of min/max
|
2015-05-26 11:52:34 +10:00 |
|
Rob Lewis
|
eb537daa1c
|
feat(library/algebra): add min/max to ordered algebraic structures
|
2015-05-26 11:45:09 +10:00 |
|
Leonardo de Moura
|
4152ebfa23
|
refactor(library/data/nat): use new tactics
|
2015-05-25 18:14:52 -07:00 |
|
Jeremy Avigad
|
39129f112b
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
Jeremy Avigad
|
a64c0ea845
|
feat/refactor(library/data/{int,rat}/*): improve casting from nat to int to rat
|
2015-05-25 16:50:42 -07:00 |
|
Jeremy Avigad
|
4ed9e46532
|
refactor(library/data/int/*): use better direction for of_nat theorems
|
2015-05-25 16:50:42 -07:00 |
|
Jeremy Avigad
|
fdc89cd285
|
refactor(library/algebra/order.lean,library/{data,algebra}/*): use better names for order theorems
|
2015-05-25 16:50:42 -07:00 |
|
Jeremy Avigad
|
81c0ef8c89
|
refactor(library/data/nat/*): cleanup, additions, renaming
|
2015-05-25 16:50:42 -07:00 |
|
Jeremy Avigad
|
7c92161e49
|
refactor(library/data/finset/basic.lean): change order of arguments to induction tactic
|
2015-05-25 16:50:42 -07:00 |
|
Jeremy Avigad
|
716da2488b
|
fix(hott/*.md,library/*.md): use the word 'file' instead of 'module'
|
2015-05-25 16:50:42 -07:00 |
|
Leonardo de Moura
|
6db08c5519
|
test(library): test new tactics in the standard library
|
2015-05-25 16:48:33 -07:00 |
|
Leonardo de Moura
|
d0987eb3ac
|
feat(library/tactic): add 'subtvars' tactic
|
2015-05-25 16:36:44 -07:00 |
|
Leonardo de Moura
|
7e875c8d85
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
Leonardo de Moura
|
88975927e6
|
fix(library/tactic/relation_tactics): beta-reduce goal before trying to extract head symbol
|
2015-05-24 18:56:35 -07:00 |
|
Leonardo de Moura
|
c453bb52a9
|
feat(library/data/stream): add notation and commonly used definitions
|
2015-05-24 16:53:58 -07:00 |
|
Leonardo de Moura
|
880027ea0e
|
feat(library/data/stream): define stream mem predicate and prove basic theorems
|
2015-05-24 15:47:33 -07:00 |
|
Leonardo de Moura
|
607a5fbb86
|
feat(library/data/stream): define cycle, inits, tails for streams and prove basic theorems
|
2015-05-24 13:42:51 -07:00 |
|
Leonardo de Moura
|
3181471024
|
feat(library/data/list/basic): add nth_eq_some aux theorem
|
2015-05-24 10:10:23 -07:00 |
|
Leonardo de Moura
|
32a2425e02
|
feat(library/data/stream): prove take lemma for infinite streams
|
2015-05-23 23:01:54 -07:00 |
|
Leonardo de Moura
|
75901157a1
|
feat(library/data/stream): add more declarations and examples demonstrating how to use eq_of_bisim
|
2015-05-23 22:03:17 -07:00 |
|
Leonardo de Moura
|
d987d6cc84
|
feat(library/data/stream): simplify corecursion proofs, define interleave operation by corecursion, add one example of proof by bisimulation
|
2015-05-23 16:00:08 -07:00 |
|
Leonardo de Moura
|
8685e8ad7e
|
feat(library/data/stream): define corec for infinite streams
|
2015-05-23 14:32:52 -07:00 |
|
Leonardo de Moura
|
dd4dd154ec
|
feat(library/data/stream): add bisimulation for streams
|
2015-05-23 12:07:27 -07:00 |
|
Jeremy Avigad
|
8bebd104ff
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|