lean2/tests/lean/run/tactic11.lean

import logic

theorem tst (a b : Prop) (H : a ↔ b) : b ↔ a
:= have H1 [visible] : a → b, -- We need to mark H1 as fact, otherwise it is not visible by tactics
   from iff.elim_left H,
   by rapply iff.intro;
      intro Ha;
        apply (H1 Ha);
      intro Hb;
        apply (iff.elim_right H Hb)

theorem tst2 (a b : Prop) (H : a ↔ b) : b ↔ a
:= have H1 [visible] : a → b,
   from iff.elim_left H,
   begin
     rapply iff.intro,
     intro Ha;
       apply (H1 Ha),
     intro Hb;
       apply (iff.elim_right H Hb)
   end
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(frontends/lean): rename '[fact]' to '[visible]' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-08 14:47:42 +00:00			`:= have H1 [visible] : a → b, -- We need to mark H1 as fact, otherwise it is not visible by tactics`
refactor(library): add namespaces 'or', 'and' and 'iff' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-05 04:25:21 +00:00			`from iff.elim_left H,`
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;`
feat(library/tactic/apply_tactic): modify heuristic for adding arguments to apply tactic. 2014-10-24 05:36:32 +00:00			`intro Ha;`
			`apply (H1 Ha);`
			`intro Hb;`
			`apply (iff.elim_right H Hb)`
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
			`theorem tst2 (a b : Prop) (H : a ↔ b) : b ↔ a`
			`:= have H1 [visible] : a → b,`
			`from iff.elim_left H,`
			`begin`
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			`rapply iff.intro,`
feat(library/tactic/apply_tactic): modify heuristic for adding arguments to apply tactic. 2014-10-24 05:36:32 +00:00			`intro Ha;`
			`apply (H1 Ha),`
			`intro Hb;`
			`apply (iff.elim_right H Hb)`
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			`end`