Theorem: Graph.EdgePath.reverse_concat (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
p : EdgePath G v w
e : EdgeBetween G w u
⊢ reverse (concat p e) = cons (EdgeBetween.bar e) (reverse p)
Tactic:
induction p <;> aesop (add norm simp [concat_cons, reverse_cons])
State after:
no goals