lean2/tests/lean/run/tactic10.lean

import logic

theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a
:= by rapply iff.intro;
      apply (assume Ha, iff.elim_left H Ha);
      apply (assume Hb, iff.elim_right H Hb)

check tst
chore(*): minimize dependencies on tests Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-08-25 02:58:48 +00:00			`import logic`
feat(frontends/lean): add exact_apply Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-30 07:51:11 +00:00
refactor(*): rename Bool to Prop Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-22 16:43:18 +00:00			`theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a`
feat(library/tactic): change apply tactic semantics: goals are not reversed; and dependent arguments are not included This commit also adds the tactic rapply that corresponds to the previous semantics we have been using. 2014-10-23 01:11:09 +00:00			`:= by rapply iff.intro;`
refactor(library/tactic): elaborate expressions nested in tactics with respect to current goal, save postponed constraints (e.g., flex-flex constraints) closes #44, fixes #70 2014-10-15 00:12:57 +00:00			`apply (assume Ha, iff.elim_left H Ha);`
			`apply (assume Hb, iff.elim_right H Hb)`
feat(library/tactic): new apply tactic Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-02 20:14:50 +00:00
			`check tst`