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
..
buffer	chore(library): use new structure update notation in the core lib	2017-11-17 16:57:54 -08:00
rbmap	feat(library): provide names for constructor arguments	2017-12-04 16:25:16 -08:00
rbtree	fix(library/tactic/cases_tactic): try to clear input hypothesis when performing dependent elimination	2017-12-05 11:03:46 -08:00
bitvec.lean	feat(library): do not using simp lemmas for sorting arguments of AC operators by default	2017-12-03 15:03:58 -08:00
buffer.lean	feat(library/init): add d_array type	2017-11-06 14:56:11 -08:00
dlist.lean	feat(library/init): add funext tactic	2017-12-04 14:54:39 -08:00
lazy_list.lean	feat(library): provide names for constructor arguments	2017-12-04 16:25:16 -08:00
stream.lean	feat(library/init): add funext tactic	2017-12-04 14:54:39 -08:00
vector.lean	refactor(library): remove vector and bitvec from init	2017-08-16 13:40:50 -07:00