Theorem: Graph.SubgroupCover.reduced_liftTerminal_factor (GroupComp/Graph/SubgroupCover.lean)

State before:
V : Type u
E : Type v
inst✝¹ : DecidableEq V
inst✝ : DecidableEq E
G : Graph V E
x₀ : V
H : Subgroup (π₁ G x₀)
w₂ : V
e : EdgePath G x₀ w₂
hyp : reduced e
⊢ (lift e (groupCoverProj H) (basepoint H)
        (_ : (groupCoverProj H).toFuncV (basepoint H) = (groupCoverProj H).toFuncV (basepoint H))).τ =
    ⟦{ τ := w₂, p := e, is_reduced := hyp }⟧
Tactic:
rw [liftTermFactors, reduced_liftTerminal]
State after:
no goals