lean2/library/data/nat
2015-08-09 23:36:07 -07:00
..
examples feat(library/tactic): use occurrence object in unfold tactic family 2015-07-11 18:53:45 -04:00
basic.lean feat(library): clean up "sorry"s in library 2015-07-24 12:21:33 -04:00
bigops.lean feat(library/data/nat/bigops,library/data/set/card,library/*): add set versions of bigops for nat 2015-08-08 17:20:23 -04:00
bquant.lean feat(frontends/lean): use 'this' as the name for anonymous 'have'-expression 2015-07-18 13:36:05 -05:00
default.lean fix(library/data): 'choose' -> 'find' renaming problems 2015-07-25 11:25:04 -07:00
div.lean feaf(library): make sure basic standard library can be compiled with option "--to_axiom" 2015-07-29 16:11:23 -07:00
fact.lean feat(library/theories/combinatorics/choose): begin theory of binomial coefficients 2015-07-11 19:01:43 -04:00
find.lean refactor(library/data/nat/find): rename 'choose' to 'find' to avoid conflict with combinatorics 'choose' 2015-07-25 14:02:44 -04:00
gcd.lean feat(library): clean up "sorry"s in library 2015-07-24 12:21:33 -04:00
nat.md fix(library/data/nat/nat.md): add 'find' to markdown file 2015-07-27 07:46:59 -07:00
order.lean fix(library/data/nat/order): fixes #786 2015-08-09 23:36:07 -07:00
pairing.lean refactor(library/data/nat): cleanup for the tutorial 2015-07-22 13:41:50 -07:00
parity.lean feaf(library): make sure basic standard library can be compiled with option "--to_axiom" 2015-07-29 16:11:23 -07:00
power.lean refactor(library/algebra/{lattice,order},library/data/nat): split lattice from order, make nat an instance of discrete linear order 2015-08-03 22:41:56 -04:00
sqrt.lean feat(nat): redefine le and lt in the standard library 2015-06-04 20:14:13 -04:00
sub.lean refactor(library/data/nat/sub,*): get rid of diff, tidy some max and min theorems 2015-08-03 22:41:56 -04:00