Theorem: Graph.homotopyLift_of_path (GroupComp/Graph/Covering.lean)

State before:
V : Type u
E : Type v
V₁ : Type u_1
E₁ : Type u_2
V₂ : Type u_3
E₂ : Type u_4
G₁ : Graph V₁ E₁
G₂ : Graph V₂ E₂
p : Morphism G₁ G₂
inst✝ : CoveringMap p
v₁ : V₁
v₂ w₂ : V₂
h : p.toFuncV v₁ = v₂
e : EdgePath G₂ v₂ w₂
⊢ homotopyLift p v₁ h [[e]] = PathLift.pathClass (lift e p v₁ h)
Tactic:
rfl
State after:
no goals