-- Lean 4 proof step from Mathlib.Condensed.Discrete.Colimit (goal)
Goal:
I : Type u
inst : Category.{u, u} I
inst_1 : IsCofiltered I
F : I ⥤ FintypeCat
c : Cone (F ⋙ toProfinite)
X : Type (u + 1)
hc : IsLimit c
inst_2 : ∀ (i : I), Epi (c.π.app i)
i j : I
fi :
  LocallyConstant
    (↑(((F ⋙ toProfinite).obj (Opposite.unop (Opposite.op i))).toTop (P := fun (X : TopCat.{u}) ↦
          TotallyDisconnectedSpace.{u} (↑X : Type u))) :
      Type u)
    X
fj :
  LocallyConstant
    (↑(((F ⋙ toProfinite).obj (Opposite.unop (Opposite.op j))).toTop (P := fun (X : TopCat.{u}) ↦
          TotallyDisconnectedSpace.{u} (↑X : Type u))) :
      Type u)
    X
h :
  LocallyConstant.comap (TopCat.Hom.hom (c.π.app i).hom) fi = LocallyConstant.comap (TopCat.Hom.hom (c.π.app j).hom) fj
k : I
ki : k ⟶ i
kj : k ⟶ j
h_1 : True
⊢ Eq (α := (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op k)))
    ((ConcreteCategory.hom (FC := TypeCat.Fun) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).map ki.op) :
          (a : (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op i))) →
            (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op k)))
        fi :
      (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op k)))
    ((ConcreteCategory.hom (FC := TypeCat.Fun) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).map kj.op) :
          (a : (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op j))) →
            (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op k)))
        fj :
      (fun (X : Type (u + 1)) ↦ X) (((F ⋙ toProfinite).op ⋙ locallyConstantPresheaf X).obj (Opposite.op k)))
have refine_2 : Eq (α :=
  LocallyConstant
    (↑((toProfinite.obj (F.obj k)).toTop (P := fun (X : TopCat.{u}) ↦ TotallyDisconnectedSpace.{u} (↑X : Type u))) :
      Type u)
    X)
  (({
          toFun :=
            fun
              (g :
                LocallyConstant
                  (↑((toProfinite.obj (F.obj i)).toTop (P := fun (X : TopCat.{u}) ↦
                        TotallyDisconnectedSpace.{u} (↑X : Type u))) :
                    Type u)
                  X) ↦
            LocallyConstant.comap (TopCat.Hom.hom (toProfinite.map (F.map ki)).hom) g } :
        (a : LocallyConstant (↑(toProfinite.obj (F.obj i)).toTop : Type u) X) →
          LocallyConstant (↑(toProfinite.obj (F.obj k)).toTop : Type u) X)
      fi :
    LocallyConstant
      (↑((toProfinite.obj (F.obj k)).toTop (P := fun (X : TopCat.{u}) ↦ TotallyDisconnectedSpace.{u} (↑X : Type u))) :
        Type u)
      X)
  (({
          toFun :=
            fun
              (g :
                LocallyConstant
                  (↑((toProfinite.obj (F.obj j)).toTop (P := fun (X : TopCat.{u}) ↦
                        TotallyDisconnectedSpace.{u} (↑X : Type u))) :
                    Type u)
                  X) ↦
            LocallyConstant.comap (TopCat.Hom.hom (toProfinite.map (F.map kj)).hom) g } :
        (a : LocallyConstant (↑(toProfinite.obj (F.obj j)).toTop : Type u) X) →
          LocallyConstant (↑(toProfinite.obj (F.obj k)).toTop : Type u) X)
      fj :
    LocallyConstant
      (↑((toProfinite.obj (F.obj k)).toTop (P := fun (X : TopCat.{u}) ↦ TotallyDisconnectedSpace.{u} (↑X : Type u))) :
        Type u)
      X)
Tactic: dsimp