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
..
basic.lean	fix(frontends/lean): consistent behavior for protected declarations	2015-05-18 22:35:18 -07:00
bigops.lean	feat(library/data/finset/bigops.lean): add Union for finsets	2015-05-17 17:50:32 +10:00
bquant.lean	feat(nat/bquant): give instances for quantification bounded with le	2015-06-04 20:14:13 -04:00
choose.lean	feat(nat): redefine le and lt in the standard library	2015-06-04 20:14:13 -04:00
default.lean	refactor(library/data/nat/gcd.lean): move gcd to a new file	2015-05-30 22:10:21 +10:00
div.lean	feat(nat): redefine le and lt in the standard library	2015-06-04 20:14:13 -04:00
gcd.lean	feat/refactor(library/*): various additions and improvements	2015-06-01 12:35:44 +10:00
nat.md	refactor(library/data/nat/gcd.lean): move gcd to a new file	2015-05-30 22:10:21 +10:00
order.lean	feat(nat/bquant): give instances for quantification bounded with le	2015-06-04 20:14:13 -04:00
pairing.lean	refactor(library/data/nat): use new tactics	2015-05-25 18:14:52 -07:00
power.lean	refactor(library/data/nat/*): cleanup, additions, renaming	2015-05-25 16:50:42 -07:00
sqrt.lean	feat(nat): redefine le and lt in the standard library	2015-06-04 20:14:13 -04:00
sub.lean	feat(library/data/{nat,int}/div.lean,*): improve and extend div in nat and int	2015-05-30 22:10:21 +10:00