Theorem: Graph.EdgePath.concat_append (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 w' u : V
e : EdgeBetween G w w'
p : EdgePath G v w
q : EdgePath G w' u
⊢ concat p e ++ q = p ++ cons e q
Tactic:
induction p <;> aesop
State after:
no goals