Theorem: Graph.SubgroupCover.liftFactors (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₂
⊢ lift e (groupCoverProj H) (basepoint H)
      (_ : (groupCoverProj H).toFuncV (basepoint H) = (groupCoverProj H).toFuncV (basepoint H)) =
    liftViaUniv H e
Tactic:
apply unique_Pathlift
State after:
no goals