| .. |
|
examples
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
finset
|
refactor(library/data/finset/card): remove unnecessary xrewrite
|
2015-06-10 18:46:16 -07:00 |
|
fintype
|
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 |
|
int
|
feat(library/data/{nat,int}/div.lean): add properties of add and mod
|
2015-06-15 22:53:11 +10:00 |
|
list
|
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 |
|
nat
|
feat(library/data/{nat,int}/div.lean): add properties of add and mod
|
2015-06-15 22:53:11 +10:00 |
|
quotient
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
rat
|
feat(library/data/rat): define pos natural upper bounds of rationals
|
2015-06-16 11:30:12 -07:00 |
|
real
|
chore(library/data/{pnat, real}): rename pnat theorems
|
2015-06-16 11:30:12 -07:00 |
|
set
|
feat(library/data/{set,finset}): add more cardinality facts, rename, and add a lemma from Haitao
|
2015-06-10 16:39:17 -07:00 |
|
bool.lean
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
countable.lean
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
data.md
|
feat(library/algebra/ordered_ring): add theorems used for rational upper bounds
|
2015-06-16 11:30:12 -07:00 |
|
default.lean
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
empty.lean
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
encodable.lean
|
feat(nat): redefine le and lt in the standard library
|
2015-06-04 20:14:13 -04:00 |
|
fin.lean
|
feat(library/data/fin): add more theorems on finite ordinals
|
2015-06-14 20:49:47 -07:00 |
|
num.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
option.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
pnat.lean
|
chore(library/data/{pnat, real}): rename pnat theorems
|
2015-06-16 11:30:12 -07:00 |
|
prod.lean
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
sigma.lean
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
squash.lean
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
stream.lean
|
feat(library/tactic): improve assumption tactic performance
|
2015-05-25 20:22:37 -07:00 |
|
string.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
subtype.lean
|
feat(library/data/subtype): cleanup proof
|
2015-06-02 19:51:28 -07:00 |
|
sum.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
unit.lean
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
uprod.lean
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
vec.lean
|
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 |
|
vector.lean
|
refactor(library/data): replace 'fin' with Haitao's 'less_than'
|
2015-06-05 10:33:19 -07:00 |
