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