∀ {C : Type u_3} [inst : CategoryTheory.Category.{u_1, u_3} C] {D : Type u_5}
  [inst_1 : CategoryTheory.Category.{u_2, u_5} D] {E : Type u_6} [inst_2 : CategoryTheory.Category.{u_4, u_6} E]
  (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D E} {e : E} (f : CategoryTheory.StructuredArrow e G)
  {X Y : CategoryTheory.StructuredArrow f (CategoryTheory.StructuredArrow.pre e F G)} (f_1 : X ⟶ Y),
  CategoryTheory.CategoryStruct.comp
      ((CategoryTheory.Functor.id (CategoryTheory.StructuredArrow f (CategoryTheory.StructuredArrow.pre e F G))).map
        f_1)
      ((fun x =>
            CategoryTheory.StructuredArrow.isoMk
              (CategoryTheory.StructuredArrow.isoMk
                (CategoryTheory.Iso.refl
                  ((CategoryTheory.Functor.id
                            (CategoryTheory.StructuredArrow f (CategoryTheory.StructuredArrow.pre e F G))).obj
                        x).right.right)
                ⋯)
              ⋯)
          Y).hom =
    CategoryTheory.CategoryStruct.comp
      ((fun x =>
            CategoryTheory.StructuredArrow.isoMk
              (CategoryTheory.StructuredArrow.isoMk
                (CategoryTheory.Iso.refl
                  ((CategoryTheory.Functor.id
                            (CategoryTheory.StructuredArrow f (CategoryTheory.StructuredArrow.pre e F G))).obj
                        x).right.right)
                ⋯)
              ⋯)
          X).hom
      (((CategoryTheory.StructuredArrow.preEquivalenceFunctor F f).comp
            (CategoryTheory.StructuredArrow.preEquivalenceInverse F f)).map
        f_1)