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