-- Lean 4 proof step from Mathlib.CategoryTheory.Sites.ConcreteSheafification (goal)
Goal:
C : Type u
inst : Category.{v, u} C
J : GrothendieckTopology.{v, u} C
D : Type w
inst_1 : Category.{w', w} D
FD : D → D → Type u_1
CD : D → Type t
inst_2 : (X Y : D) → FunLike.{u_1 + 1, t + 1, t + 1} (FD X Y) (CD X) (CD Y)
instCC : ConcreteCategory.{t, w', w, u_1} D FD (CC := CD)
inst_3 : ∀ {X : C} (S : J.Cover X), PreservesLimitsOfShape (WalkingMulticospan S.shape) (forget D (FC := FD) (CC := CD))
inst_4 : ∀ (X : C), HasColimitsOfShape (J.Cover X)ᵒᵖ D
inst_5 : ∀ (P : Functor.{v, w', u, w} Cᵒᵖ D) (X : C) (S : J.Cover X), HasMultiequalizer (S.index P)
inst_6 : ∀ (X : C), PreservesColimitsOfShape (J.Cover X)ᵒᵖ (forget D (FC := FD) (CC := CD))
P : Functor.{v, w', u, w} Cᵒᵖ D
hsep :
  ∀ (X : C) (S : J.Cover X) (x y : ToType.{t, w', w, u_1} (FC := FD) (CC := CD) (P.obj (op X))),
    (∀ (I : S.Arrow),
        Eq (α := CD (P.obj (op I.Y)))
          ((ConcreteCategory.hom (FC := FD) (CC := CD) (P.map I.f.op) : (a : CD (P.obj (op X))) → CD (P.obj (op I.Y)))
              x :
            CD (P.obj (op I.Y)))
          ((ConcreteCategory.hom (FC := FD) (CC := CD) (P.map I.f.op) : (a : CD (P.obj (op X))) → CD (P.obj (op I.Y)))
              y :
            CD (P.obj (op I.Y)))) →
      x = y
X : C
S : J.Cover X
s : Meq (FD := FD) (CD := CD) (J.plusObj P) S
T : (I : S.Arrow) → J.Cover I.Y
t : (I : S.Arrow) → Meq (FD := FD) (CD := CD) P (T I)
ht : ∀ (I : S.Arrow), (↑s : (I : S.Arrow) → ToType ((J.plusObj P).obj (op I.Y))) I = mk (FD := FD) (CD := CD) (t I)
II : (S.bind T).Relation
⊢ Eq (α := CD ((J.plusObj P).obj (op II.r.Z)))
    ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.r.g₁.op) :
          (a : CD ((J.plusObj P).obj (op II.fst.Y))) → CD ((J.plusObj P).obj (op II.r.Z)))
        ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.fst.toMiddle.f.op) :
              (a : CD ((J.plusObj P).obj (op II.fst.fromMiddle.Y))) → CD ((J.plusObj P).obj (op II.fst.toMiddle.Y)))
            (mk (FD := FD) (CD := CD) (t II.fst.fromMiddle)) :
          CD ((J.plusObj P).obj (op II.fst.toMiddle.Y))) :
      CD ((J.plusObj P).obj (op II.r.Z)))
    ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.r.g₂.op) :
          (a : CD ((J.plusObj P).obj (op II.snd.Y))) → CD ((J.plusObj P).obj (op II.r.Z)))
        ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.snd.toMiddle.f.op) :
              (a : CD ((J.plusObj P).obj (op II.snd.fromMiddle.Y))) → CD ((J.plusObj P).obj (op II.snd.toMiddle.Y)))
            (mk (FD := FD) (CD := CD) (t II.snd.fromMiddle)) :
          CD ((J.plusObj P).obj (op II.snd.toMiddle.Y))) :
      CD ((J.plusObj P).obj (op II.r.Z)))
have a : Eq (α := CD ((J.plusObj P).obj (op II.r.Z)))
  ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.r.g₁.op) :
        (a : CD ((J.plusObj P).obj (op II.fst.Y))) → CD ((J.plusObj P).obj (op II.r.Z)))
      ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.fst.toMiddle.f.op) :
            (a : CD ((J.plusObj P).obj (op II.fst.fromMiddle.Y))) → CD ((J.plusObj P).obj (op II.fst.toMiddle.Y)))
          ((↑s : (I : S.Arrow) → ToType ((J.plusObj P).obj (op I.Y))) II.fst.fromMiddle) :
        CD ((J.plusObj P).obj (op II.fst.toMiddle.Y))) :
    CD ((J.plusObj P).obj (op II.r.Z)))
  ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.r.g₂.op) :
        (a : CD ((J.plusObj P).obj (op II.snd.Y))) → CD ((J.plusObj P).obj (op II.r.Z)))
      ((ConcreteCategory.hom (FC := FD) (CC := CD) ((J.plusObj P).map II.snd.toMiddle.f.op) :
            (a : CD ((J.plusObj P).obj (op II.snd.fromMiddle.Y))) → CD ((J.plusObj P).obj (op II.snd.toMiddle.Y)))
          ((↑s : (I : S.Arrow) → ToType ((J.plusObj P).obj (op I.Y))) II.snd.fromMiddle) :
        CD ((J.plusObj P).obj (op II.snd.toMiddle.Y))) :
    CD ((J.plusObj P).obj (op II.r.Z)))
Tactic: rw [← ht, ← ht]