Leonardo de Moura
|
d7042c4618
|
fix(library/logic/heq): heq.to_eq must be transparent because it is needed in the 'inversion' tactic used by definitional package
|
2014-11-28 23:49:17 -08:00 |
|
Leonardo de Moura
|
cab99e2e22
|
refactor(library/data/vector): simplify 'vector' using new 'inversion' tactic
|
2014-11-28 23:19:53 -08:00 |
|
Leonardo de Moura
|
ae0daf9639
|
fix(library/data/prod/decl): give preference to unicode version when pretty printing
|
2014-11-28 23:02:19 -08:00 |
|
Jeremy Avigad
|
a9001166fd
|
fix(library/algebra/category/morphism): remove sorry that was introduced by accident
|
2014-11-28 22:54:15 -08:00 |
|
Jeremy Avigad
|
bb8d436e75
|
refactor(library/algebra/relation, library/logic/instances): revise equivalence relations and congruences to use structure command
|
2014-11-28 22:54:15 -08:00 |
|
Jeremy Avigad
|
7571f50870
|
feat(library/binary, library/relation): introduce general properties for binary operations and relations
|
2014-11-28 22:54:15 -08:00 |
|
Jeremy Avigad
|
89380f088e
|
feat(library): reorganize and declare some notation
|
2014-11-28 22:54:15 -08:00 |
|
Jeremy Avigad
|
58e325f0af
|
feat(library/algebra): add to developments of group, ordered_group, and ring
|
2014-11-28 22:54:15 -08:00 |
|
Jeremy Avigad
|
f923d6a24c
|
feat(library/data/sum): use + notation for sum
|
2014-11-28 22:54:15 -08:00 |
|
Jakob von Raumer
|
7c81044a99
|
chore(library/hott) change is_pointed to structure
|
2014-11-28 22:50:43 -08:00 |
|
Jakob von Raumer
|
0417c21bbb
|
chore(library/hott) change naming in equiv_precomp
|
2014-11-28 22:50:43 -08:00 |
|
Jakob von Raumer
|
4587e46c67
|
chore(library/hott) change naming to leo's naming proposal
|
2014-11-28 22:50:43 -08:00 |
|
Jakob von Raumer
|
7374149758
|
chore(library/hott) change equiv.lean to use structures and more typeclass inference
|
2014-11-28 22:50:43 -08:00 |
|
Leonardo de Moura
|
011e955fed
|
refactor(library/data/fin): simplify 'fin' module using new inversion tactic
|
2014-11-28 22:46:06 -08:00 |
|
Leonardo de Moura
|
e0debca771
|
feat(library/tactic/inversion_tactic): add 'case ... with ...' variant that allows user to specify names for new hypotheses
|
2014-11-28 22:25:37 -08:00 |
|
Leonardo de Moura
|
c2602baf2b
|
feat(library/tools/tactic): add 'cases' alias for 'inversion' tactic
|
2014-11-28 19:33:11 -08:00 |
|
Leonardo de Moura
|
ebd320a6b3
|
feat(library/tactic): add first step of 'inversion' tactic
|
2014-11-26 21:28:00 -08:00 |
|
Leonardo de Moura
|
f7deabfd19
|
feat(library/rename): add notation for rename
|
2014-11-26 19:02:11 -08:00 |
|
Leonardo de Moura
|
e55397d422
|
feat(library/tactic): add 'clears' and 'reverts' variants
|
2014-11-26 14:49:48 -08:00 |
|
Leonardo de Moura
|
2bd8f969d5
|
feat(library/tactic): add 'revert' tactic, closes #346
|
2014-11-26 14:23:42 -08:00 |
|
Leonardo de Moura
|
df51ba8b7c
|
feat(library/definitional/projection): use strict implicit inference, closes #344
|
2014-11-25 18:04:06 -08:00 |
|
Jakob von Raumer
|
53d66c91fc
|
chore(library/hott) made ua_implies_funext a class instance
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
757cdcb130
|
feat(library/hott) funext from ua now with arbitrary universe levels for funext!
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
228205634d
|
chore(library/hott) make funext more general
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
12429c93c8
|
fix(library/hott) fix equiv_precomp, doesn't look nice now
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
1f6b6ff8e6
|
chore(library/hott) adjust funext_from_ua.lea to typeclass axioms
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
2d9621892b
|
fix(library/hott) fill both gaps (I don't know why it works that way), change name from funext.apply to funext.ap, since apply seems to be a tactic name?
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
fd47a162de
|
chore(library/hott) adapted theories to typeclass axioms
|
2014-11-23 17:43:55 -08:00 |
|
Jakob von Raumer
|
d8d2ea998d
|
feat(library/hott) change axioms to Leo's axioms-as-typeclass proposal
|
2014-11-23 17:43:55 -08:00 |
|
Leonardo de Moura
|
64686c1278
|
feat(frontends/lean): allow user to associate precedence to binders, closes #323
|
2014-11-23 17:30:46 -08:00 |
|
Leonardo de Moura
|
7231a36ec7
|
refactor(library/data/nat/div): remove unnecessary annotations
|
2014-11-23 17:30:46 -08:00 |
|
Leonardo de Moura
|
13fba433b0
|
feat(library/tactic/generalize): add 'generalizes' syntax sugar, closes #327
|
2014-11-23 17:30:22 -08:00 |
|
Floris van Doorn
|
3523a70b4c
|
fix(hott/path): make recursion-like definitions reducible
|
2014-11-22 17:44:13 -08:00 |
|
Floris van Doorn
|
e97b0b4e8e
|
feat(hott/types): port more of the sigma library from Coq
prove theorems about interaction of sigma types and n-types, including the fact that sigmas preserve n-types
|
2014-11-22 17:44:12 -08:00 |
|
Floris van Doorn
|
25f5c56bb2
|
refactor(data/sigma): move notation from sigma.thms to sigma.decl
|
2014-11-22 17:44:12 -08:00 |
|
Floris van Doorn
|
7bfbe039d9
|
refactor(data.prod): move theorems about products from data.quotient.util to data.prod.thms
|
2014-11-22 17:44:12 -08:00 |
|
Floris van Doorn
|
24e35a9f2c
|
fix(hott/trunc): comment out sorry
|
2014-11-22 17:44:12 -08:00 |
|
Floris van Doorn
|
bc807212ac
|
feat(hott/path): add notation for higher and dependent transports
|
2014-11-22 17:44:12 -08:00 |
|
Floris van Doorn
|
e8b076e460
|
feat(hott/types/sigma): port large part of the sigma library from the hott library
most importantly, prove the characterization of paths in sigma types
|
2014-11-22 17:44:12 -08:00 |
|
Leonardo de Moura
|
616f2d9b82
|
fix(library/data/nat/div): notation should be local
|
2014-11-22 17:33:42 -08:00 |
|
Leonardo de Moura
|
ab9c51bd4b
|
refactor(library/data/nat/div): simplify 'gcd' definition
|
2014-11-22 17:19:24 -08:00 |
|
Leonardo de Moura
|
2af5ce364d
|
feat(library/data/nat/decl): add 'measure'
|
2014-11-22 17:19:03 -08:00 |
|
Leonardo de Moura
|
d07481f60f
|
feat(library/data/nat/div): remove some 'sorry's
|
2014-11-22 14:59:35 -08:00 |
|
Leonardo de Moura
|
9368b879bf
|
refactor(library/data/nat/div): use well-founded library for defining div, mod and gcd
|
2014-11-22 13:26:55 -08:00 |
|
Leonardo de Moura
|
21b16fd97c
|
feat(library/data/nat): add more basic theorems for definitional package
|
2014-11-22 13:25:46 -08:00 |
|
Leonardo de Moura
|
faf736a9d2
|
feat(library/logic/default): add wf_k
|
2014-11-22 13:25:46 -08:00 |
|
Leonardo de Moura
|
a3daff702a
|
fix(library/logic/wf): typo
|
2014-11-22 13:25:46 -08:00 |
|
Leonardo de Moura
|
47b6cfb28d
|
feat(library/logic/if): add dependent if-then-else: dite
|
2014-11-22 09:56:32 -08:00 |
|
Leonardo de Moura
|
9c9f5bba1a
|
refactor(library/data/nat): prove auxiliary theorems about < and sub asap for the definitional package
|
2014-11-22 09:36:33 -08:00 |
|
Leonardo de Moura
|
29a0d3109b
|
refactor(library/logic/connectives): mark theorems used to prove 'decidable' theorems as transparent
if we don't this, then 'if-then-else' expressions depending on theorems
such as 'and_decidable', 'or_decidable' will not compute inside the kernel
|
2014-11-22 09:32:43 -08:00 |
|