Theorem: Graph.redCons_nil (GroupComp/Graph/ReducedPaths.lean)

State before:
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
u v : V
e : EdgeBetween G u v
⊢ redCons e (nil v) = cons e (nil v)
Tactic:
simp [redCons]
State after:
no goals