lean2/tests/lean/run/rename_tac.lean

import tools.tactic logic
open tactic

theorem foo1 (A : Type) (a b c : A) (Hab : a = b) (Hbc : b = c) : a = c :=
begin
  apply eq.trans,
  rename Hab Foo,
  apply Foo,
  apply Hbc,
end

theorem foo2 (A : Type) (a b c : A) (Hab : a = b) (Hbc : b = c) : a = c :=
begin
  apply eq.trans,
  Hab ↦ Foo,
  apply Foo,
  apply Hbc,
end
refactor(data/num/string): break into pieces to reduce dependencies 2014-11-07 16:53:14 +00:00			`import tools.tactic logic`
feat(library/tactic): add 'rename' hypothesis tactic 2014-10-15 01:19:34 +00:00			`open tactic`

feat(library/rename): add notation for `rename` 2014-11-27 03:02:11 +00:00			`theorem foo1 (A : Type) (a b c : A) (Hab : a = b) (Hbc : b = c) : a = c :=`
feat(library/tactic): add 'rename' hypothesis tactic 2014-10-15 01:19:34 +00:00			`begin`
			`apply eq.trans,`
			`rename Hab Foo,`
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			`apply Foo,`
			`apply Hbc,`
feat(library/tactic): add 'rename' hypothesis tactic 2014-10-15 01:19:34 +00:00			`end`
feat(library/rename): add notation for `rename` 2014-11-27 03:02:11 +00:00
			`theorem foo2 (A : Type) (a b c : A) (Hab : a = b) (Hbc : b = c) : a = c :=`
			`begin`
			`apply eq.trans,`
			`Hab ↦ Foo,`
			`apply Foo,`
			`apply Hbc,`
			`end`