Jeremy Avigad
|
1c93c5bbb2
|
feat(library/logic/{connectives.lean,quantiers.lean}): add iff congruence rules
|
2015-06-08 16:58:08 +10:00 |
|
Jeremy Avigad
|
feb385748f
|
refactor(library/data/set/map.lean): put map into set namespace
This is needed to repair a conflict in the tutorial, but it is the right thing to do anyhow. The type "map A B" should not be a top-level identifier.
|
2015-06-06 18:58:33 -07:00 |
|
Leonardo de Moura
|
7db84c7036
|
refactor(library/data): replace 'fin' with Haitao's 'less_than'
The commit also fixes vector to use the new definition.
|
2015-06-05 10:33:19 -07:00 |
|
Jeremy Avigad
|
453da48dd5
|
feat(library/data/less_than.lean): add finite ordinals from Haitao Zhang
|
2015-06-05 09:32:00 -07:00 |
|
Jeremy Avigad
|
370860e1b0
|
feat(library/data/fintype,finset): add cardinality for finite types from Haitao Zhang
|
2015-06-05 09:32:00 -07:00 |
|
Jeremy Avigad
|
f475408f4c
|
feat(library/data/list/*): add theorems from Haitao Zhang and clean up
|
2015-06-05 09:32:00 -07:00 |
|
Jeremy Avigad
|
c2aa8c6720
|
feat(library/data/finset/partition.lean): add theory of partitions into finsets by Haitao Zhang
|
2015-06-05 09:32:00 -07: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
|
63f61a35f4
|
feat(library/data/list/set): cleanup nodup_map proof
|
2015-06-04 15:21:40 -07:00 |
|
Leonardo de Moura
|
9a7cff0e89
|
feat(library/data/list/comb): add length_product theorem
|
2015-06-04 15:11:09 -07:00 |
|
Jeremy Avigad
|
df69bb4cfc
|
feat(library/*): add theorems from Haitao on sets and functions, clean up
|
2015-06-04 11:55:25 -07:00 |
|
Leonardo de Moura
|
c841e63649
|
refactor(library/data/fintype): create 'fintype' subdirectory
|
2015-06-03 16:43:55 -07:00 |
|
Leonardo de Moura
|
2a6ea2c6fb
|
feat(library/data/finset/to_set): add to_set.inj
|
2015-06-03 14:05:43 -07:00 |
|
Leonardo de Moura
|
a8c9121d2e
|
feat(library/data/vec): add vector as list subtype
|
2015-06-02 22:09:23 -07:00 |
|
Leonardo de Moura
|
7a39d5aaa3
|
feat(library/data): add auxiliary definitions
|
2015-06-02 22:08:25 -07:00 |
|
Leonardo de Moura
|
228a99af7e
|
feat(library/data/subtype): cleanup proof
|
2015-06-02 19:51:28 -07:00 |
|
Leonardo de Moura
|
50fe4ec6c0
|
feat(library/data/encodable): add quot.rep definition for choosing equivalence class representative for equivalence classes of encodable types
|
2015-06-02 11:03:24 -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 |
|
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 |
|
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
|
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 |
|
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 |
|
Leonardo de Moura
|
6db08c5519
|
test(library): test new tactics in the standard library
|
2015-05-25 16:48:33 -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 |
|