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

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