Module: Mathlib.CategoryTheory.Limits.Constructions.Over.Products

Goal state before:
pp: J✝ : Type w
C : Type u
inst✝ : Category.{v, u} C
X✝ Y✝ Z B : C
J : Type w
F : Discrete J ⥤ Over B
c : Cone F
X Y : WidePullbackShape J
f : X ⟶ Y
⊢ 𝟙 c.pt.left ≫ Option.rec c.pt.hom (fun val ↦ Hom.left (c.π.app { as := val })) Y =
    Option.rec c.pt.hom (fun val ↦ Hom.left (c.π.app { as := val })) X ≫
      WidePullbackShape.Hom.rec (motive := fun a a_1 x ↦
        X = a →
          Y = a_1 →
            f ≍ x →
              (Option.rec B (fun val ↦ (F.obj { as := val }).left) X ⟶
                Option.rec B (fun val ↦ (F.obj { as := val }).left) Y))
        (fun X_1 h ↦
          Eq.rec (motive := fun x x_1 ↦
            Y = x →
              f ≍ 𝟙 x →
                (Option.rec B (fun val ↦ (F.obj { as := val }).left) X ⟶
                  Option.rec B (fun val ↦ (F.obj { as := val }).left) Y))
            (fun h ↦
              Eq.rec (motive := fun x x_1 ↦
                (f : X ⟶ x) →
                  f ≍ 𝟙 X →
                    (Option.rec B (fun val ↦ (F.obj { as := val }).left) X ⟶
                      Option.rec B (fun val ↦ (F.obj { as := val }).left) x))
                (fun f h ↦ 𝟙 (Option.rec B (fun val ↦ (F.obj { as := val }).left) X)) ⋯ f)
            h)
        (fun j h ↦
          Eq.rec (motive := fun x x_1 ↦
            (f : x ⟶ Y) →
              Y = none →
                f ≍ WidePullbackShape.Hom.term j →
                  (Option.rec B (fun val ↦ (F.obj { as := val }).left) x ⟶
                    Option.rec B (fun val ↦ (F.obj { as := val }).left) Y))
            (fun f h ↦
              Eq.rec (motive := fun x x_1 ↦
                (f : some j ⟶ x) →
                  f ≍ WidePullbackShape.Hom.term j →
                    ((F.obj { as := j }).left ⟶ Option.rec B (fun val ↦ (F.obj { as := val }).left) x))
                (fun f h ↦ (F.obj { as := j }).hom) ⋯ f)
            ⋯ f)
        f ⋯ ⋯ ⋯

Tactic:
;

Goal state after:
J✝ : Type w
C : Type u
inst✝ : Category.{v, u} C
X✝ Y✝ Z B : C
J : Type w
F : Discrete J ⥤ Over B
c : Cone F
X Y : WidePullbackShape J
f : X ⟶ Y
⊢ 𝟙 c.pt.left ≫ Option.rec c.pt.hom (fun val ↦ Hom.left (c.π.app { as := val })) Y =
    Option.rec c.pt.hom (fun val ↦ Hom.left (c.π.app { as := val })) X ≫
      WidePullbackShape.Hom.rec (motive := fun a a_1 x ↦
        X = a →
          Y = a_1 →
            f ≍ x →
              (Option.rec B (fun val ↦ (F.obj { as := val }).left) X ⟶
                Option.rec B (fun val ↦ (F.obj { as := val }).left) Y))
        (fun X_1 h ↦
          Eq.rec (motive := fun x x_1 ↦
            Y = x →
              f ≍ 𝟙 x →
                (Option.rec B (fun val ↦ (F.obj { as := val }).left) X ⟶
                  Option.rec B (fun val ↦ (F.obj { as := val }).left) Y))
            (fun h ↦
              Eq.rec (motive := fun x x_1 ↦
                (f : X ⟶ x) →
                  f ≍ 𝟙 X →
                    (Option.rec B (fun val ↦ (F.obj { as := val }).left) X ⟶
                      Option.rec B (fun val ↦ (F.obj { as := val }).left) x))
                (fun f h ↦ 𝟙 (Option.rec B (fun val ↦ (F.obj { as := val }).left) X)) ⋯ f)
            h)
        (fun j h ↦
          Eq.rec (motive := fun x x_1 ↦
            (f : x ⟶ Y) →
              Y = none →
                f ≍ WidePullbackShape.Hom.term j →
                  (Option.rec B (fun val ↦ (F.obj { as := val }).left) x ⟶
                    Option.rec B (fun val ↦ (F.obj { as := val }).left) Y))
            (fun f h ↦
              Eq.rec (motive := fun x x_1 ↦
                (f : some j ⟶ x) →
                  f ≍ WidePullbackShape.Hom.term j →
                    ((F.obj { as := j }).left ⟶ Option.rec B (fun val ↦ (F.obj { as := val }).left) x))
                (fun f h ↦ (F.obj { as := j }).hom) ⋯ f)
            ⋯ f)
        f ⋯ ⋯ ⋯