13 lines
392 B
Text
13 lines
392 B
Text
import Int.
|
|
(*
|
|
|
|
-- Tactic for trying to prove goal using reflexivity, congruence and available assumptions
|
|
congr_tac = Try(unfold_tac("eq")) .. Repeat(OrElse(apply_tac("refl"), apply_tac("congr"), assumption_tac()))
|
|
|
|
*)
|
|
|
|
theorem T1 (a b : Int) (f : Int -> Int) : a = b -> (f (f a)) = (f (f b)) :=
|
|
fun assumption : a = b,
|
|
have (f (f a)) = (f (f b)) by congr_tac
|
|
|
|
print environment 1.
|