Theorem: Graph.toList_cast_init (GroupComp/Graph/ReducedPaths.lean)

State before:
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
v v' w : V
p : EdgePath G v w
eqn : v = v'
⊢ toList p = toList (eqn ▸ p)
Tactic:
cases eqn
State after:
case refl
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
v w : V
p : EdgePath G v w
⊢ toList p = toList ((_ : v = v) ▸ p)

State before:
case refl
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
v w : V
p : EdgePath G v w
⊢ toList p = toList ((_ : v = v) ▸ p)
Tactic:
rfl
State after:
no goals