Theorem: heq_of_eq' (Qpf/Util/HEq.lean)

State before:
α β : Sort u_1
a : α
b : β
h : β = α
⊢ a = cast h b → HEq a b
Tactic:
intro eq
State after:
α β : Sort u_1
a : α
b : β
h : β = α
eq : a = cast h b
⊢ HEq a b

State before:
α β : Sort u_1
a : α
b : β
h : β = α
eq : a = cast h b
⊢ HEq a b
Tactic:
cases eq
State after:
case refl
α β : Sort u_1
b : β
h : β = α
⊢ HEq (cast h b) b

State before:
case refl
α β : Sort u_1
b : β
h : β = α
⊢ HEq (cast h b) b
Tactic:
apply cast_heq
State after:
no goals