set_option maxHeartbeats 600000 in
/-- (Implementation) The natural map `Γ(𝒪_{U_i}, U) ⟶ Γ(𝒪_X, 𝖣.ι i '' U)`.
This forms the inverse of `(𝖣.ι i).c.app (op U)`. -/
def ιInvApp {i : D.J} (U : Opens (D.U i).carrier) :
    (D.U i).presheaf.obj (op U) ⟶ limit (D.diagramOverOpen U) :=
  limit.lift (D.diagramOverOpen U)
    { pt := (D.U i).presheaf.obj (op U)
      π :=
        { app := fun j => D.ιInvAppπApp U (unop j)
          naturality := fun {X Y} f' => by
            induction X using Opposite.rec' with | h X => ?_
            induction Y using Opposite.rec' with | h Y => ?_
            let f : Y ⟶ X := f'.unop; have : f' = f.op := rfl; clear_value f; subst this
            rcases f with (_ | ⟨j, k⟩ | ⟨j, k⟩)
            · erw [Category.id_comp, CategoryTheory.Functor.map_id]
              rw [Category.comp_id]
            · erw [Category.id_comp]; congr 1
            erw [Category.id_comp]
            -- It remains to show that the blue is equal to red + green in the original diagram.
            -- The proof strategy is illustrated in ![this diagram](https://i.imgur.com/mBzV1Rx.png)
            -- where we prove red = pink = light-blue = green = blue.
            change
              D.opensImagePreimageMap i j U ≫
                  (D.f j k).c.app _ ≫ (D.V (j, k)).presheaf.map (eqToHom _) =
                D.opensImagePreimageMap _ _ _ ≫
                  ((D.f k j).c.app _ ≫ (D.t j k).c.app _) ≫ (D.V (j, k)).presheaf.map (eqToHom _)
            

Proof state:
case h.h.snd.mk
C : Type u
inst✝¹ : Category.{v, u} C
D : GlueData C
inst✝ : HasLimits C
i : D.J
U : Opens ↑↑(CategoryTheory.GlueData.U D.toGlueData i)
j k : D.J
⊢ opensImagePreimageMap D i j U ≫
      (f D.toGlueData j k).c.app
          (op
            ((Opens.map (ι D.toGlueData j).base).obj
              ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U))) ≫
        (V D.toGlueData (j, k)).presheaf.map
          (eqToHom
            (_ :
              (Opens.map (f D.toGlueData j k).base).op.obj
                  (op
                    ((Opens.map (ι D.toGlueData j).base).obj
                      ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U))) =
                op
                  ((Opens.map
                        (colimit.ι (MultispanIndex.multispan (diagram D.toGlueData))
                            (op (WalkingMultispan.left (j, k))).unop).base).obj
                    ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U)))) =
    opensImagePreimageMap D i k U ≫
      ((f D.toGlueData k j).c.app
            (op
              ((Opens.map (ι D.toGlueData k).base).obj
                ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U))) ≫
          (t D.toGlueData j k).c.app
            ((Opens.map (f D.toGlueData k j).base).op.obj
              (op
                ((Opens.map (ι D.toGlueData k).base).obj
                  ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U))))) ≫
        (V D.toGlueData (j, k)).presheaf.map
          (eqToHom
            (_ :
              (Opens.map
                        ((MultispanIndex.multispan (diagram D.toGlueData)).map
                            (WalkingMultispan.Hom.snd (j, k)).op.unop).base).op.obj
                  (op
                    ((Opens.map
                          (colimit.ι (MultispanIndex.multispan (diagram D.toGlueData))
                              (op
                                  (WalkingMultispan.right
                                    (MultispanIndex.sndFrom (diagram D.toGlueData) (j, k)))).unop).base).obj
                      ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U))) =
                op
                  ((Opens.map
                        (colimit.ι (MultispanIndex.multispan (diagram D.toGlueData))
                            (op (WalkingMultispan.left (j, k))).unop).base).obj
                    ((IsOpenMap.functor (_ : IsOpenMap ⇑(ι D.toGlueData i).base)).obj U))))

Next tactic:
erw [opensImagePreimageMap_app_assoc]