| .. |
|
examples
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
finset
|
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 |
|
fintype
|
fix(library/data/fintype/function): make inj_of_nodup and nodup_of_inj more general
|
2015-06-16 19:17:53 -07: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/real): replace theorems with versions from algebra
|
2015-06-16 11:30:12 -07:00 |
|
set
|
feat(library/data/set): show that (set A) is a comm_semiring
|
2015-06-17 09:53:50 -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) : establish add_comm_group on fin using madd
|
2015-06-16 16:38: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/real): replace theorems with more general versions from algebra
|
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
|
fix(library/init/logic): make sure library can be compiled using '--to_axiom' option
|
2015-06-16 13:10:08 -07:00 |
