Theorem: HEq.eqRec_heq (GMLInit/Logic/HEq.lean)

State before:
α : Sort u_1
a : α
β : (a' : α) → a = a' → Sort u_2
a' : α
h : a = a'
x : β a ⋯
⊢ h ▸ x ≅ x
Tactic:
cases h
State after:
case refl
α : Sort u_1
a : α
β : (a' : α) → a = a' → Sort u_2
x : β a ⋯
⊢ ⋯ ▸ x ≅ x

State before:
case refl
α : Sort u_1
a : α
β : (a' : α) → a = a' → Sort u_2
x : β a ⋯
⊢ ⋯ ▸ x ≅ x
Tactic:
exact HEq.rfl
State after:
no goals