Leonardo de Moura
|
73f665dce3
|
refactor(library/data/list/perm): use anonymous 'suppose' and 'have' expressions
|
2015-07-19 12:35:12 -07:00 |
|
Leonardo de Moura
|
812ddf1ef5
|
feat(frontends/lean): add 'suppose'-expression
It is a variant of 'assume' that allow anonymous declarations.
|
2015-07-19 12:15:12 -07:00 |
|
Leonardo de Moura
|
92f8eb173b
|
feat(frontends/lean): use 'this' as the name for anonymous 'have'-expression
|
2015-07-18 13:36:05 -05:00 |
|
Leonardo de Moura
|
ade60278d0
|
refactor(library): rename iff.mp' to iff.mpr
|
2015-07-18 08:52:58 -05:00 |
|
Floris van Doorn
|
124c9d3d8a
|
feat(hott): various cleanup and fixes, rename \~ to ~, expand types.pointed
|
2015-06-25 22:31:40 -04:00 |
|
Leonardo de Moura
|
8967f57818
|
refactor(library/data/list): reduce reliance on definitional equality
|
2015-06-24 15:58:19 -07:00 |
|
Leonardo de Moura
|
1c5c79fbc1
|
refactor(library/data/list/perm): use improved 'obtain' to cleanup proof
|
2015-06-08 11:58:21 -07:00 |
|
Jeremy Avigad
|
f475408f4c
|
feat(library/data/list/*): add theorems from Haitao Zhang and clean up
|
2015-06-05 09:32:00 -07:00 |
|
Leonardo de Moura
|
5da4922397
|
feat(library/data/list/perm): cleanup proofs
refl and symm were refering to the setoid.refl and setoid.symm.
Moreover, they were producing harder elaboration problems
|
2015-05-27 12:30:56 -07:00 |
|
Leonardo de Moura
|
6db08c5519
|
test(library): test new tactics in the standard library
|
2015-05-25 16:48:33 -07:00 |
|
Jeremy Avigad
|
42f2fc973a
|
refactor(library/data/{finset,list,fintype}: rename cross_product to product
|
2015-05-08 19:51:37 +10:00 |
|
Jeremy Avigad
|
9e26dddaf3
|
feat(library/data/list/perm): add perm_filter
|
2015-05-08 19:51:37 +10:00 |
|
Leonardo de Moura
|
84deddcca9
|
feat(library/tactic/rewrite_tactic): apply 'reflexivity' tactic after 'rewrite' instead of hard coded solution
|
2015-05-05 20:23:49 -07:00 |
|
Leonardo de Moura
|
11f74363e2
|
refactor(library): rename 'intersection' to 'inter' in list and finset, add finset abbreviation at top level
|
2015-05-05 08:53:31 -07:00 |
|
Leonardo de Moura
|
cd17618f4a
|
refactor(library): replace 'calc_trans', 'calc_symm', 'calc_refl' and 'calc_subst' commands with attributes '[symm]', '[refl]', '[trans]' and '[subst]'
These attributes are used by the calc command.
They will also be used by tactics such as 'reflexivity', 'symmetry' and
'transitivity'.
See issue #500
|
2015-05-02 15:15:35 -07:00 |
|
Leonardo de Moura
|
de369a0a0a
|
feat(library/tactic/injection_tactic): improve 'injection' tactic
see issue #500
|
2015-05-01 15:49:56 -07:00 |
|
Leonardo de Moura
|
9ba8b284a1
|
fix(library/tactic/apply_tactic): add eapply, and fix issue #361
|
2015-05-01 15:08:00 -07:00 |
|
Leonardo de Moura
|
e948dd239c
|
feat(library/data/list/perm): use new 'injection' tactic
|
2015-05-01 13:08:36 -07:00 |
|
Leonardo de Moura
|
59b11c815c
|
refactor(library/data/list/perm): remove unnessary lambda abstractions
The contradiction tactic takes care of it.
|
2015-04-30 14:02:19 -07:00 |
|
Leonardo de Moura
|
9760968b45
|
refactor(library,hott): use/test new 'contradiction' tactic in the standard and hott libraries
|
2015-04-30 13:56:12 -07:00 |
|
Leonardo de Moura
|
3912bc24c8
|
feat(frontends/lean): nicer syntax for 'intros' 'reverts' and 'clears'
|
2015-04-30 11:00:39 -07:00 |
|
Leonardo de Moura
|
018f768555
|
chore(library): remove some unnecessary parentheses
|
2015-04-29 14:39:59 -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
|
fefddcd0f9
|
fix(library/data/list/perm): broken theorem
|
2015-04-11 09:42:24 -07:00 |
|
Leonardo de Moura
|
49d6d43926
|
feat(library/data/list): define intersection for lists
|
2015-04-10 16:31:44 -07:00 |
|
Leonardo de Moura
|
4be8741a39
|
feat(library/data/list): break list/basic.lean into smaller files
|
2015-04-10 05:19:52 -07:00 |
|
Leonardo de Moura
|
b209f442f7
|
refactor(library/data/list) fix theorem name, and do not rely on implementation of mem
|
2015-04-09 16:27:48 -07:00 |
|
Leonardo de Moura
|
571ff76080
|
feat(library/data/list/perm): add perm_ext theorem
|
2015-04-09 15:27:32 -07:00 |
|
Leonardo de Moura
|
d5176ebae5
|
refactor(library/algebra/binary): define right_commutative and left_commutative
|
2015-04-09 10:54:28 -07:00 |
|
Leonardo de Moura
|
8522fbec4b
|
feat(library/data/list): more general theorems for perm foldl and foldr, and other minor improvements
|
2015-04-09 09:29:58 -07:00 |
|
Leonardo de Moura
|
07ff0900aa
|
feat(library/data/list): add permutation theorems for union and insert
|
2015-04-08 19:02:35 -07:00 |
|
Leonardo de Moura
|
c95bd8ba61
|
feat(library/data/list): add erase_dup and theorems
|
2015-04-08 12:28:48 -07:00 |
|
Leonardo de Moura
|
05bd6b5fe7
|
feat(library/data/list): add foldr/foldl equality theorems for permutations
|
2015-04-08 10:36:05 -07:00 |
|
Leonardo de Moura
|
afc75f141c
|
refactor(library/data/list/perm): prove auxiliary theorems using 'match-with'
|
2015-04-08 09:43:17 -07:00 |
|
Leonardo de Moura
|
56d20852aa
|
refactor(library/data/list/perm): remove dead code
|
2015-04-08 09:32:28 -07:00 |
|
Leonardo de Moura
|
ef1b057b63
|
refactor(library/data/list/perm): cleanup theorem
|
2015-04-08 09:29:40 -07:00 |
|
Leonardo de Moura
|
e0e65705db
|
feat(library/data/list/perm): add perm inversion theorems
|
2015-04-07 18:54:02 -07:00 |
|
Leonardo de Moura
|
c6a35e718d
|
refactor(library/data/list/perm): use by_cases instead of dependent-if
|
2015-04-07 09:26:24 -07:00 |
|
Leonardo de Moura
|
9306830d8c
|
feat(library/data/list): perm is decidable
|
2015-04-07 09:12:10 -07:00 |
|
Leonardo de Moura
|
3b959c9e6c
|
refactor(library/data): move perm to list folder
|
2015-04-05 12:01:32 -07:00 |
|