Leonardo de Moura
|
17c07cdb02
|
feat(library/data/rat/order): define abs and sign for rat before migrate
|
2015-04-27 12:59:02 -07:00 |
|
Jeremy Avigad
|
7a1064b7e8
|
refactor(library/algebra/order.lean): rename a field in an order structure
|
2015-04-27 12:03:41 -07:00 |
|
Jeremy Avigad
|
d8e40d90d6
|
feat(library/data/rat/order.lean): make rat a linear ordered field
|
2015-04-27 12:03:41 -07:00 |
|
Leonardo de Moura
|
76c773ad3d
|
feat(library/data/examples/depchoice): add dependent choice example
|
2015-04-26 12:56:23 -07:00 |
|
Leonardo de Moura
|
072bf0b3b4
|
refactor(library): make sure "choose" compute inside the kernel
|
2015-04-25 23:10:48 -07:00 |
|
Leonardo de Moura
|
d455bb4c5b
|
feat(library/data/fintype): add decidable_exists_finite
|
2015-04-25 21:38:03 -07:00 |
|
Leonardo de Moura
|
6bb6644c25
|
feat(library/data/squash): define squash type using quotients
|
2015-04-24 18:11:25 -07:00 |
|
Floris van Doorn
|
9d805437f0
|
fix(reserved_notation): lower binding power of 'iff'
|
2015-04-22 13:06:11 -07:00 |
|
Leonardo de Moura
|
670eac9d50
|
refactor(library): avoid 'context' command in the standard library
|
2015-04-21 19:13:19 -07:00 |
|
Leonardo de Moura
|
bf8a7eb9b4
|
fix(library/scoped_ext): bug in local metadata in sections
The problem is described in issue #554
|
2015-04-21 18:56:28 -07:00 |
|
Leonardo de Moura
|
306087b5d3
|
refactor(library/data): rename 'countable' to 'encodable', define countable in the usual way, and prove all 'encodable' type is 'countable'
|
2015-04-19 14:20:47 -07:00 |
|
Jeremy Avigad
|
f4398115b4
|
feat(library/data/rat/basic.lean): begin theory of rationals, show rat is a field
|
2015-04-18 11:39:52 -07:00 |
|
Jeremy Avigad
|
5eb7fef564
|
feat(library/algebra/order.lean, data/int/{basic,order}.lean): add theorem, correct gt_trans
|
2015-04-18 11:39:52 -07:00 |
|
Leonardo de Moura
|
cc63a40a01
|
feat(library): enforce name conventions on old nat declarations
|
2015-04-18 10:50:30 -07:00 |
|
Leonardo de Moura
|
3b84a63874
|
fix(library/algebra/function): terminology
|
2015-04-16 20:52:18 -07:00 |
|
Leonardo de Moura
|
2e675c1bdd
|
feat(library/data/examples/notcountable): add example showing that nat -> nat is not countable
|
2015-04-16 14:54:34 -07:00 |
|
Leonardo de Moura
|
7529ee0a5c
|
feat(library/data/countable): prove axiom of choice and skolem theorem for countable types and decidable relations
|
2015-04-16 12:36:27 -07:00 |
|
Leonardo de Moura
|
0dd7667836
|
feat(library/data/countable): choice function for countable types
|
2015-04-16 12:29:06 -07:00 |
|
Leonardo de Moura
|
7a4f43d6ab
|
feat(library/data/nat/choose): choice function for natural numbers
|
2015-04-16 11:33:26 -07:00 |
|
Leonardo de Moura
|
b14d3dbeba
|
chore(library/data/countable): add copyright notice
|
2015-04-16 09:24:53 -07:00 |
|
Leonardo de Moura
|
036900280d
|
feat(library/data/countable): show that a type is countable by providing an injection to a type already known to be countable
|
2015-04-15 10:30:24 -07:00 |
|
Leonardo de Moura
|
039f1de524
|
fix(library/data/countable): typos
|
2015-04-14 21:26:56 -07:00 |
|
Leonardo de Moura
|
9534cfe92f
|
feat(library/data/countable): prove that (list A) is countable if A is countable
|
2015-04-14 21:17:18 -07:00 |
|
Leonardo de Moura
|
a7db8a2bac
|
theorem(library/data/countable): prove that the product of two countable types is countable
|
2015-04-14 20:39:58 -07:00 |
|
Leonardo de Moura
|
38b880b939
|
feat(library/data/nat/pairing): add unpair_mkpair theorem
|
2015-04-14 20:28:20 -07:00 |
|
Leonardo de Moura
|
f7a43c7997
|
feat(library/data/nat/sqrt): generalize sqrt_eq theorem
|
2015-04-14 20:10:18 -07:00 |
|
Leonardo de Moura
|
faca0acd26
|
feat(library/data/nat/sqrt): add sqrt_eq theorem
|
2015-04-14 15:38:54 -07:00 |
|
Leonardo de Moura
|
11dbcda9d2
|
feat(library/data/nat/pairing): add "elegant" pairing/unpairing function
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
2eb7538c96
|
fix(library/data/nat/sqrt): adjust to reflect recent changes
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
4180b80df6
|
feat(library/data/nat/power): define power and add basic theorems
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
ff72a520ff
|
feat(library/data/nat/div): add mul_cancel theorems
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
c73c1dbb63
|
feat(library/data/nat/sub): add two extra theorems
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
11c9bb4626
|
feat(library/data/nat): naive square root function
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
2453a6ab45
|
feat(library/data/countable): define countable type class
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
82eada7d56
|
feat(library/data/list/basic): add find nth theorem
|
2015-04-14 09:01:15 -07:00 |
|
Leonardo de Moura
|
07e195e9f1
|
feat(library/data/fintype): add decidable_finite_pred instance
|
2015-04-12 20:07:04 -07:00 |
|
Leonardo de Moura
|
00d68cadc8
|
refactor(library/data/fintype): cleanup and mark location that exposes bug in the 'cases' tactic
|
2015-04-12 17:52:41 -07:00 |
|
Leonardo de Moura
|
f523d3a995
|
feat(library/data): add structure for converting a list of elements into a type, and then show the resultant type is a finite type
|
2015-04-12 17:33:58 -07:00 |
|
Leonardo de Moura
|
d9f8b0f3d7
|
feat(library/data/finset/comb): add cross_product to finset
|
2015-04-11 19:46:04 -07:00 |
|
Leonardo de Moura
|
4c827293a8
|
feat(library/data/list/perm): add perm_cross_product theorem
|
2015-04-11 19:13:34 -07:00 |
|
Leonardo de Moura
|
41ddc97e0d
|
feat(library/data/list): define filter function for lists
|
2015-04-11 18:22:22 -07:00 |
|
Leonardo de Moura
|
c437fbe0bc
|
feat(library/data/fintype): prove that A->B has decidable equality when A is a finite type and B has decidable equality
|
2015-04-11 16:45:27 -07:00 |
|
Leonardo de Moura
|
3edf0dffdf
|
feat(library/data/finset): define subset for finsets
|
2015-04-11 15:29:12 -07:00 |
|
Leonardo de Moura
|
dfef4c5daf
|
feat(library/data): define fintype type class
|
2015-04-11 14:55:41 -07:00 |
|
Leonardo de Moura
|
06d4ae971d
|
feat(library/data/list): add nodup_cross_product theorem
|
2015-04-11 14:31:01 -07:00 |
|
Leonardo de Moura
|
54a2d9750e
|
refactor(library/data): simplify definition of disjoint
|
2015-04-11 14:04:09 -07:00 |
|
Leonardo de Moura
|
ee895e00dd
|
feat(library/data/list): define cross_product for lists
|
2015-04-11 13:52:50 -07:00 |
|
Leonardo de Moura
|
fefddcd0f9
|
fix(library/data/list/perm): broken theorem
|
2015-04-11 09:42:24 -07:00 |
|
Leonardo de Moura
|
1b34f40f36
|
feat(library/data/list/set): add decidable_nodup
|
2015-04-11 09:39:26 -07:00 |
|
Leonardo de Moura
|
dff05557a3
|
feat(library/data/finset): add all combinator theorems
|
2015-04-11 09:28:27 -07:00 |
|