Leonardo de Moura
6f943d77a2
feat(library/init/meta/interactive): add match_target pat interactive tactic
2017-12-05 12:25:17 -08:00
Leonardo de Moura
b1e8270172
chore(library/init/meta/match_tactic): fix typo
2017-12-05 12:11:04 -08:00
Leonardo de Moura
b5358b1b3e
chore(library/init/meta/interactive): add comment to avoid confusion
2017-12-05 12:07:17 -08:00
Leonardo de Moura
54004d4972
fix(library/tactic/cases_tactic): try to clear input hypothesis when performing dependent elimination
...
The `induction h` tactic tries to clear hypothesis `h` after it is
applied. But, before this commit, `cases h` would only try to clear `h`
when performing non-dependent elimination. This was problematic when
writing tactic scripts for automating proofs.
2017-12-05 11:03:46 -08:00
Leonardo de Moura
6d96741010
feat(library): provide names for constructor arguments
...
Motivation: `cases` and `induction` tactics use these names when the
user does not provide them.
2017-12-04 16:25:16 -08:00
Leonardo de Moura
c943576e5a
feat(library/init): add funext tactic
2017-12-04 14:54:39 -08:00
Leonardo de Moura
db46f01315
chore(library/init): replace iterate applications with repeat when appropriate
2017-12-04 13:04:46 -08:00
Leonardo de Moura
53c9737c70
feat(library/init): new repeat tactic
2017-12-04 12:55:53 -08:00
Leonardo de Moura
75aa94b34c
refactor(library): rename repeat ==> iterate
...
Reason: we will implement a new `repeat` tactic.
2017-12-04 12:34:59 -08:00
Leonardo de Moura
7b97e82fb3
chore(library): remove unnecessary repeat applications
2017-12-04 12:16:11 -08:00
Leonardo de Moura
d4e0dde063
chore(library/init/meta/relation_tactics): simplify subst_vars
2017-12-04 12:00:54 -08:00
Leonardo de Moura
b7322e28c1
feat(library): do not using simp lemmas for sorting arguments of AC operators by default
2017-12-03 15:03:58 -08:00
Leonardo de Moura
d9322b16ca
feat(library): add has_equiv type class
2017-12-03 15:03:58 -08:00
Leonardo de Moura
b6c8551753
feat(library): add to_bool lemmas
2017-12-03 15:03:58 -08:00
Leonardo de Moura
8032d2eefd
feat(library/init/algebra/order): add instance
2017-12-03 15:03:58 -08:00
Sebastian Ullrich
f6b113849b
fix(init/category/monad): bind_pure: remove stray parameter
2017-11-28 17:00:22 +01:00
Leonardo de Moura
47994fe14e
chore(library): remove id_locked
2017-11-22 16:29:04 -08:00
Leonardo de Moura
64f575a2d5
perf(library/equations_compiler): performance problem for definitions that produce many equational lemmas
...
The new test and comment at src/library/equations_compiler/util.cpp
explains the issue.
2017-11-22 16:16:11 -08:00
Leonardo de Moura
c98c39e4b9
chore(library/init/data/rbtree/basic): remove unnecessary equation
2017-11-22 08:22:42 -08:00
Leonardo de Moura
0a1d2908aa
feat(library/data/rbtree/main): rbtrees are balanced
2017-11-22 08:02:13 -08:00
Leonardo de Moura
b95b260706
fix(library/data/rbtree): insert
2017-11-22 07:52:18 -08:00
Leonardo de Moura
96f8ecbdcb
feat(library/data/rbmap): add find_insert lemmas for rbmap
2017-11-21 14:29:04 -08:00
Leonardo de Moura
f8fb92e431
feat(library/data/rbtree/insert): finish find_insert_of_not_eqv lemmas
2017-11-21 13:16:19 -08:00
Leonardo de Moura
cdb724b092
feat(library/init/meta/interactive): add shorthand for any_goals { assumption }
2017-11-21 13:02:57 -08:00
Leonardo de Moura
5f99056c1a
feat(library/init/meta): basic support for ignoring auto and opt params
2017-11-21 11:52:40 -08:00
Leonardo de Moura
b3e429a1b8
chore(library/data/rbtree/insert): reduce proofs size
2017-11-21 10:37:10 -08:00
Leonardo de Moura
ae0f5642d3
feat(library/data/rbtree): find_insert_of_not_eqv lemmas
...
Remark: the balance2 case (dual of balance1) is still missing.
2017-11-20 21:27:19 -08:00
Leonardo de Moura
02545cb941
feat(library/data/rbmap): find_insert lemmas
2017-11-20 12:14:05 -08:00
Leonardo de Moura
319faca00a
feat(library/data/rbtree): add mem_exact predicate and find_insert lemmas
2017-11-20 11:52:36 -08:00
Leonardo de Moura
a666c7f04e
chore(library/init/data/rbmap): add missing file
2017-11-19 19:49:36 -08:00
Leonardo de Moura
1033836953
feat(library/data/rbmap): add rbmap lemmas
2017-11-19 19:49:36 -08:00
Leonardo de Moura
902c1219b0
feat(library/data/rbtree): more find lemmas
2017-11-19 19:49:36 -08:00
Leonardo de Moura
2354338287
feat(library/init/data/rbmap): add rbmap module
2017-11-19 19:49:36 -08:00
Leonardo de Moura
50797c1d05
feat(library/data/rbtree): add specialized lemmas (for strict total orders)
2017-11-18 16:36:58 -08:00
Leonardo de Moura
320b33f305
feat(library/data/rbtree): add find and define contains using it
2017-11-18 16:06:16 -08:00
Leonardo de Moura
8ffff9e48b
feat(library/data/rbtree): cleanup and add min max
2017-11-18 12:22:10 -08:00
Leonardo de Moura
effa90e884
refactor(library/init/data/rbtree): rbtree does not need (decidable_rel lt) parameter
2017-11-17 22:59:50 -08:00
Leonardo de Moura
dec5b7c806
feat(library/data/rbtree/lemmas): add mem_insert_of_incomp
2017-11-17 17:21:03 -08:00
Leonardo de Moura
3134e00341
fix(library/init/algebra/classes): strict_weak_order.equiv should not depend on type class
2017-11-17 17:19:00 -08:00
Leonardo de Moura
52d6adc19c
chore(library): use new structure update notation in the core lib
2017-11-17 16:57:54 -08:00
Sebastian Ullrich
0aacccd8c9
feat(frontends/lean): change structure update notation
...
`{s with ...}` is now `{..., ..s}`, which more clearly expresses that the
result type is not necessarily equal to the type of `s` (in absence of an
expected type and a structure name, we still default to the type of `s`).
Multiple fallback sources can be given: `{..., ..s, ..t}` will fall back to
searching a field in `s`, then in `t`. The last component can also be `..`,
which will replace any missing fields with a placeholder.
The old notation will be removed in the future.
2017-11-17 16:40:47 -08:00
Leonardo de Moura
65368a0c85
refactor(library): rbtree lemmas do not need to be in init folder
2017-11-17 16:14:28 -08:00
Leonardo de Moura
956f29cdb2
chore(library/init/data/rbtree/lemmas): do not rely on and.comm, and.assoc and and.left_comm as simp rules
2017-11-17 15:36:17 -08:00
Leonardo de Moura
2e66c422f3
feat(library/init/data/rbtree/lemmas): simplify blast_disjs
2017-11-17 15:06:49 -08:00
Leonardo de Moura
7dd70b0ef1
feat(library/init/algebra/classes): add is_strict_total_order type class
2017-11-17 15:06:32 -08:00
Leonardo de Moura
e2e8d56e6e
feat(library/init/data/rbtree/lemmas): add equiv_or_mem_of_mem_insert lemma
2017-11-17 13:49:58 -08:00
Leonardo de Moura
3783eaa6e1
feat(library/init/algebra/classes): add is_trichotomous type class
2017-11-17 13:49:26 -08:00
Leonardo de Moura
1b8f9d6550
feat(library/init/data/rbtree/lemmas): add mem_ins_of_mem lemma
2017-11-17 11:42:55 -08:00
Leonardo de Moura
d2b27035ae
feat(library/init/data/rbtree/lemmas): add contains_correct user lemma
2017-11-16 17:24:37 -08:00
Leonardo de Moura
d40b255d14
feat(library/init/data/rbtree/lemmas): show that a well formed red black tree is searchable
2017-11-16 17:04:33 -08:00
