Theorem: Graph.EdgePath.concat_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 u' : V
e : EdgeBetween G v w
p : EdgePath G w u
e' : EdgeBetween G u u'
⊢ concat (cons e p) e' = cons e (concat p e')
Tactic:
rfl
State after:
no goals