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