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 |
|