2013-12-07 23:37:54 +00:00
|
|
|
(**
|
|
|
|
|
|
|
|
|
|
-- Tactic for trying to prove goal using Reflexivity, Congruence and available assumptions
|
2013-12-25 05:36:49 +00:00
|
|
|
congr_tac = TRY(unfold_tac("eq")) .. REPEAT(ORELSE(apply_tac("Refl"), apply_tac("Congr"), assumption_tac))
|
2013-12-07 23:37:54 +00:00
|
|
|
|
|
|
|
|
**)
|
|
|
|
|
|
|
|
|
|
Theorem T1 (a b : Int) (f : Int -> Int) : a = b -> (f (f a)) = (f (f b)) :=
|
|
|
|
|
fun assumption : a = b,
|
|
|
|
|
show (f (f a)) = (f (f b)) by congr_tac
|
|
|
|
|
|
|
|
|
|
Show Environment 1.
|
