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

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