| .. |
|
examples
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
finset
|
feat(library/theories/number_theory/prime_factorization): prove that n is equal to its prime factorization
|
2015-07-27 15:16:16 -07:00 |
|
fintype
|
feat(frontends/lean): allow anonymous 'have'-expressions in tactic mode
|
2015-07-23 18:52:59 -07:00 |
|
int
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
list
|
fix(library/data/list/perm): fix typo in theorem names
|
2015-07-25 14:02:44 -04:00 |
|
nat
|
fix(library/data/nat/nat.md): add 'find' to markdown file
|
2015-07-27 07:46:59 -07:00 |
|
quotient
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
rat
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
real
|
refactor(library/data/real/basic): declare 'real' in the toplevel like 'nat', 'int' and 'rat'
|
2015-07-24 11:59:46 -07:00 |
|
set
|
fix/feat(library/logic/connectives,library/data/{finset,set}): fix names or.left_distrib etc., fix implicit arguments, and make small additions
|
2015-07-27 07:46:59 -07:00 |
|
bag.lean
|
feat(library/data/bag): show that subbag predicate is decidable when A has decidable equality
|
2015-07-25 17:44:03 -07:00 |
|
bool.lean
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
countable.lean
|
refactor(library/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
data.md
|
chore(library/data): update data.md
|
2015-06-25 17:30:12 -07:00 |
|
default.lean
|
refactor(library/*): do various renamings
|
2015-05-25 16:50:42 -07:00 |
|
empty.lean
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
encodable.lean
|
fix(library/data): 'choose' -> 'find' renaming problems
|
2015-07-25 11:25:04 -07:00 |
|
equiv.lean
|
feat(library/data/equiv): basic equivalences
|
2015-07-26 13:06:01 -07:00 |
|
fin.lean
|
feat(library/data/fin): add equivalences between fin types
|
2015-07-26 15:42:39 -07:00 |
|
hlist.lean
|
feat(frontends/lean): allow anonymous 'have'-expressions in tactic mode
|
2015-07-23 18:52:59 -07:00 |
|
num.lean
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
option.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
pnat.lean
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
prod.lean
|
refactor(library): use new 'suppose'-expression
|
2015-07-19 21:15:20 -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
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
string.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
subtype.lean
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04: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/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
vec.lean
|
refactor(library/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
vector.lean
|
feat(library/data/vector): add helper lemmas for proving v == w when v and w are vectors
|
2015-07-20 11:59:03 -07:00 |
