-- Lean 4 proof step from Mathlib.AlgebraicTopology.SimplicialSet.Path (goal)
Goal:
n : ℕ
X : Truncated (n + 1)
m : ℕ
hₘ : m ≤ n + 1
j l : ℕ
h : j + l ≤ m
Δ : X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋m⦌ hₘ))
i : Fin (l + 1)
hᵥ :
  Eq (α := X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ ⋯)))
    ((ConcreteCategory.hom (FC := TypeCat.Fun)
            (X.map ((tr (subinterval j l h) ⋯ hₘ).op ≫ Quiver.Hom.op (tr (⦋0⦌.const ⦋l⦌ i) ⋯ ⋯))) :
          (a : X.obj (op { obj := ⦋m⦌, property := hₘ })) → X.obj (op { obj := ⦋0⦌, property := ⋯ }))
        Δ :
      X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ ⋯)))
    (Path.vertex
        {
          vertex := fun (i : Fin (l + 1)) ↦
            (ConcreteCategory.hom (FC := TypeCat.Fun)
                  (X.map (Quiver.Hom.op (tr (⦋0⦌.const ⦋m⦌ (⟨j + (↑i : ℕ), ⋯⟩ : Fin (m + 1))) ⋯ hₘ))) :
                (a : X.obj (op { obj := ⦋m⦌, property := hₘ })) → X.obj (op { obj := ⦋0⦌, property := ⋯ }))
              Δ,
          arrow := fun (i : Fin l) ↦ (X.spine m hₘ Δ).arrow ⟨j + (↑i : ℕ), ⋯⟩, arrow_src := ⋯, arrow_tgt := ⋯ }
        i :
      X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ ⋯)))
⊢ Eq (α := X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ ⋯)))
    ((ConcreteCategory.hom (FC := TypeCat.Fun) (X.map (Quiver.Hom.op (tr (⦋0⦌.const ⦋l⦌ i) ⋯ ⋯))) :
          (a : X.obj (op { obj := ⦋l⦌, property := ⋯ })) → X.obj (op { obj := ⦋0⦌, property := ⋯ }))
        ((ConcreteCategory.hom (FC := TypeCat.Fun) (X.map (tr (subinterval j l h) ⋯ hₘ).op) :
              (a : X.obj (op { obj := ⦋m⦌, property := hₘ })) → X.obj (op { obj := ⦋l⦌, property := ⋯ }))
            Δ :
          X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋l⦌ ⋯))) :
      X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ ⋯)))
    (Path.vertex
        {
          vertex := fun (i : Fin (l + 1)) ↦
            (ConcreteCategory.hom (FC := TypeCat.Fun)
                  (X.map (Quiver.Hom.op (tr (⦋0⦌.const ⦋m⦌ (⟨j + (↑i : ℕ), ⋯⟩ : Fin (m + 1))) ⋯ hₘ))) :
                (a : X.obj (op { obj := ⦋m⦌, property := hₘ })) → X.obj (op { obj := ⦋0⦌, property := ⋯ }))
              Δ,
          arrow := fun (i : Fin l) ↦ (X.spine m hₘ Δ).arrow ⟨j + (↑i : ℕ), ⋯⟩, arrow_src := ⋯, arrow_tgt := ⋯ }
        i :
      X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ ⋯)))
have hᵥ₁ : Eq (α := X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ sorry)))
  ((ConcreteCategory.hom (FC := TypeCat.Fun)
          (X.map (Quiver.Hom.op (tr (⦋0⦌.const ⦋l⦌ i) sorry sorry ≫ tr (subinterval j l h) sorry hₘ))) :
        (a : X.obj (op { obj := ⦋m⦌, property := hₘ })) → X.obj (op { obj := ⦋0⦌, property := sorry }))
      Δ :
    X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ sorry)))
  (Path.vertex
      {
        vertex := fun (i : Fin (l + 1)) ↦
          (ConcreteCategory.hom (FC := TypeCat.Fun)
                (X.map (Quiver.Hom.op (tr (⦋0⦌.const ⦋m⦌ (⟨j + (↑i : ℕ), sorry⟩ : Fin (m + 1))) sorry hₘ))) :
              (a : X.obj (op { obj := ⦋m⦌, property := hₘ })) → X.obj (op { obj := ⦋0⦌, property := sorry }))
            Δ,
        arrow := fun (i : Fin l) ↦ (X.spine m hₘ Δ).arrow ⟨j + (↑i : ℕ), sorry⟩, arrow_src := sorry, arrow_tgt := sorry }
      i :
    X.obj (op (ObjectProperty.FullSubcategory.mk (P := fun (a : SimplexCategory) ↦ a.len ≤ n + 1) ⦋0⦌ sorry)))
Tactic: rw [← Functor.map_comp_apply, ← op_comp, ← tr_comp,
      const_subinterval_eq]