Theorem: Graph.EdgePath.reverse_cons (GroupComp/Graph.lean)

State before:
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
u✝ v✝ w✝ : V
e✝ : EdgeBetween G v✝ w✝
v w u : V
e : EdgeBetween G v w
p : EdgePath G w u
⊢ reverse (cons e p) = concat (reverse p) (EdgeBetween.bar e)
Tactic:
rfl
State after:
no goals