Module: Mathlib.CategoryTheory.Limits.Bicones

Goal state before:
pp: case diagram
J : Type v₁
inst✝¹ : SmallCategory J
C : Type u₁
inst✝ : Category.{v₁, u₁} C
F : J ⥤ C
c₁ c₂ : Cone F
Z✝ : Bicone J
j✝ k✝ : J
f✝ : j✝ ⟶ k✝
g : Bicone.diagram k✝ ⟶ Z✝
⊢ BiconeHom.casesOn (motive := fun a a_1 x ↦
      Bicone.diagram j✝ = a →
        Z✝ = a_1 →
          BiconeHom.diagram f✝ ≫ g ≍ x →
            ((Bicone.casesOn (Bicone.diagram j✝) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
              Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
      (BiconeHom.diagram f✝ ≫ g)
      (fun h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Z✝) →
            Z✝ = Bicone.left →
              f ≍ BiconeHom.left_id →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.left ⟶ Y) →
                f ≍ BiconeHom.left_id →
                  ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
          ⋯ (BiconeHom.diagram f✝ ≫ g))
      (fun h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Z✝) →
            Z✝ = Bicone.right →
              f ≍ BiconeHom.right_id →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.right ⟶ Y) →
                f ≍ BiconeHom.right_id →
                  ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
          ⋯ (BiconeHom.diagram f✝ ≫ g))
      (fun j h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Z✝) →
            Z✝ = Bicone.diagram j →
              f ≍ BiconeHom.left j →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.left ⟶ Y) →
                f ≍ BiconeHom.left j →
                  ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ c₁.π.app j) ⋯ f)
          ⋯ (BiconeHom.diagram f✝ ≫ g))
      (fun j h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Z✝) →
            Z✝ = Bicone.diagram j →
              f ≍ BiconeHom.right j →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.right ⟶ Y) →
                f ≍ BiconeHom.right j →
                  ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ c₂.π.app j) ⋯ f)
          ⋯ (BiconeHom.diagram f✝ ≫ g))
      (fun {j k} f h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f_1 : X ⟶ Z✝) →
            Z✝ = Bicone.diagram k →
              f_1 ≍ BiconeHom.diagram f →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f_1 h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f_2 : Bicone.diagram j ⟶ Y) →
                f_2 ≍ BiconeHom.diagram f →
                  ((Bicone.casesOn (Bicone.diagram j) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f_2 h ↦ F.map f) ⋯ f_1)
          ⋯ (BiconeHom.diagram f✝ ≫ g))
      ⋯ ⋯ ⋯ =
    BiconeHom.casesOn (motive := fun a a_1 x ↦
        Bicone.diagram j✝ = a →
          Bicone.diagram k✝ = a_1 →
            BiconeHom.diagram f✝ ≍ x →
              ((Bicone.casesOn (Bicone.diagram j✝) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
        (BiconeHom.diagram f✝)
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.left →
                f ≍ BiconeHom.left_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left_id →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.right →
                f ≍ BiconeHom.right_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right_id →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.diagram j →
                f ≍ BiconeHom.left j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left j →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₁.π.app j) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.diagram j →
                f ≍ BiconeHom.right j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right j →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₂.π.app j) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun {j k} f h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f_1 : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.diagram k →
                f_1 ≍ BiconeHom.diagram f →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f_1 h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f_2 : Bicone.diagram j ⟶ Y) →
                  f_2 ≍ BiconeHom.diagram f →
                    ((Bicone.casesOn (Bicone.diagram j) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f_2 h ↦ F.map f) ⋯ f_1)
            ⋯ (BiconeHom.diagram f✝))
        ⋯ ⋯ ⋯ ≫
      BiconeHom.casesOn (motive := fun a a_1 x ↦
        Bicone.diagram k✝ = a →
          Z✝ = a_1 →
            g ≍ x →
              ((Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
        g
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Z✝) →
              Z✝ = Bicone.left →
                f ≍ BiconeHom.left_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left_id →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ g)
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Z✝) →
              Z✝ = Bicone.right →
                f ≍ BiconeHom.right_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right_id →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ g)
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Z✝) →
              Z✝ = Bicone.diagram j →
                f ≍ BiconeHom.left j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left j →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₁.π.app j) ⋯ f)
            ⋯ g)
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Z✝) →
              Z✝ = Bicone.diagram j →
                f ≍ BiconeHom.right j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right j →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₂.π.app j) ⋯ f)
            ⋯ g)
        (fun {j k} f h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f_1 : X ⟶ Z✝) →
              Z✝ = Bicone.diagram k →
                f_1 ≍ BiconeHom.diagram f →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶ Bicone.casesOn Z✝ c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f_1 h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f_2 : Bicone.diagram j ⟶ Y) →
                  f_2 ≍ BiconeHom.diagram f →
                    ((Bicone.casesOn (Bicone.diagram j) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f_2 h ↦ F.map f) ⋯ f_1)
            ⋯ g)
        ⋯ ⋯ ⋯

Tactic:
cases g

Goal state after:
case diagram.diagram
J : Type v₁
inst✝¹ : SmallCategory J
C : Type u₁
inst✝ : Category.{v₁, u₁} C
F : J ⥤ C
c₁ c₂ : Cone F
j✝ k✝¹ : J
f✝¹ : j✝ ⟶ k✝¹
k✝ : J
f✝ : k✝¹ ⟶ k✝
⊢ BiconeHom.casesOn (motive := fun a a_1 x ↦
      Bicone.diagram j✝ = a →
        Bicone.diagram k✝ = a_1 →
          BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝ ≍ x →
            ((Bicone.casesOn (Bicone.diagram j✝) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
              Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
      (BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝)
      (fun h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Bicone.diagram k✝) →
            Bicone.diagram k✝ = Bicone.left →
              f ≍ BiconeHom.left_id →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                  Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.left ⟶ Y) →
                f ≍ BiconeHom.left_id →
                  ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
          ⋯ (BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝))
      (fun h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Bicone.diagram k✝) →
            Bicone.diagram k✝ = Bicone.right →
              f ≍ BiconeHom.right_id →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                  Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.right ⟶ Y) →
                f ≍ BiconeHom.right_id →
                  ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
          ⋯ (BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝))
      (fun j h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Bicone.diagram k✝) →
            Bicone.diagram k✝ = Bicone.diagram j →
              f ≍ BiconeHom.left j →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                  Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.left ⟶ Y) →
                f ≍ BiconeHom.left j →
                  ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ c₁.π.app j) ⋯ f)
          ⋯ (BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝))
      (fun j h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f : X ⟶ Bicone.diagram k✝) →
            Bicone.diagram k✝ = Bicone.diagram j →
              f ≍ BiconeHom.right j →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                  Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f : Bicone.right ⟶ Y) →
                f ≍ BiconeHom.right j →
                  ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f h ↦ c₂.π.app j) ⋯ f)
          ⋯ (BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝))
      (fun {j k} f h ↦
        Eq.ndrec (motive := fun {X} ↦
          (f_1 : X ⟶ Bicone.diagram k✝) →
            Bicone.diagram k✝ = Bicone.diagram k →
              f_1 ≍ BiconeHom.diagram f →
                ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                  Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
          (fun f_1 h ↦
            Eq.ndrec (motive := fun {Y} ↦
              (f_2 : Bicone.diagram j ⟶ Y) →
                f_2 ≍ BiconeHom.diagram f →
                  ((Bicone.casesOn (Bicone.diagram j) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
              (fun f_2 h ↦ F.map f) ⋯ f_1)
          ⋯ (BiconeHom.diagram f✝¹ ≫ BiconeHom.diagram f✝))
      ⋯ ⋯ ⋯ =
    BiconeHom.casesOn (motive := fun a a_1 x ↦
        Bicone.diagram j✝ = a →
          Bicone.diagram k✝¹ = a_1 →
            BiconeHom.diagram f✝¹ ≍ x →
              ((Bicone.casesOn (Bicone.diagram j✝) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j))
        (BiconeHom.diagram f✝¹)
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝¹) →
              Bicone.diagram k✝¹ = Bicone.left →
                f ≍ BiconeHom.left_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left_id →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ (BiconeHom.diagram f✝¹))
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝¹) →
              Bicone.diagram k✝¹ = Bicone.right →
                f ≍ BiconeHom.right_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right_id →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ (BiconeHom.diagram f✝¹))
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝¹) →
              Bicone.diagram k✝¹ = Bicone.diagram j →
                f ≍ BiconeHom.left j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left j →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₁.π.app j) ⋯ f)
            ⋯ (BiconeHom.diagram f✝¹))
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝¹) →
              Bicone.diagram k✝¹ = Bicone.diagram j →
                f ≍ BiconeHom.right j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right j →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₂.π.app j) ⋯ f)
            ⋯ (BiconeHom.diagram f✝¹))
        (fun {j k} f h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f_1 : X ⟶ Bicone.diagram k✝¹) →
              Bicone.diagram k✝¹ = Bicone.diagram k →
                f_1 ≍ BiconeHom.diagram f →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f_1 h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f_2 : Bicone.diagram j ⟶ Y) →
                  f_2 ≍ BiconeHom.diagram f →
                    ((Bicone.casesOn (Bicone.diagram j) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f_2 h ↦ F.map f) ⋯ f_1)
            ⋯ (BiconeHom.diagram f✝¹))
        ⋯ ⋯ ⋯ ≫
      BiconeHom.casesOn (motive := fun a a_1 x ↦
        Bicone.diagram k✝¹ = a →
          Bicone.diagram k✝ = a_1 →
            BiconeHom.diagram f✝ ≍ x →
              ((Bicone.casesOn (Bicone.diagram k✝¹) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
        (BiconeHom.diagram f✝)
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.left →
                f ≍ BiconeHom.left_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left_id →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.right →
                f ≍ BiconeHom.right_id →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right_id →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ 𝟙 (Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j)) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.diagram j →
                f ≍ BiconeHom.left j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.left ⟶ Y) →
                  f ≍ BiconeHom.left j →
                    ((Bicone.casesOn Bicone.left c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₁.π.app j) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun j h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.diagram j →
                f ≍ BiconeHom.right j →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f : Bicone.right ⟶ Y) →
                  f ≍ BiconeHom.right j →
                    ((Bicone.casesOn Bicone.right c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f h ↦ c₂.π.app j) ⋯ f)
            ⋯ (BiconeHom.diagram f✝))
        (fun {j k} f h ↦
          Eq.ndrec (motive := fun {X} ↦
            (f_1 : X ⟶ Bicone.diagram k✝) →
              Bicone.diagram k✝ = Bicone.diagram k →
                f_1 ≍ BiconeHom.diagram f →
                  ((Bicone.casesOn X c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                    Bicone.casesOn (Bicone.diagram k✝) c₁.pt c₂.pt fun j ↦ F.obj j))
            (fun f_1 h ↦
              Eq.ndrec (motive := fun {Y} ↦
                (f_2 : Bicone.diagram j ⟶ Y) →
                  f_2 ≍ BiconeHom.diagram f →
                    ((Bicone.casesOn (Bicone.diagram j) c₁.pt c₂.pt fun j ↦ F.obj j) ⟶
                      Bicone.casesOn Y c₁.pt c₂.pt fun j ↦ F.obj j))
                (fun f_2 h ↦ F.map f) ⋯ f_1)
            ⋯ (BiconeHom.diagram f✝))
        ⋯ ⋯ ⋯