-- Lean 4 proof step from Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks (goal)
Goal:
C : Type u₁
inst : Category.{v₁, u₁} C
J : Type u₂
inst_1 : Category.{v₂, u₂} J
X Y Z : C
f_1 : X ⟶ Z
g : Y ⟶ Z
f : some WalkingPair.right ⟶ some WalkingPair.right
⊢ Eq (α :=
    obj.{0, v₁, 0, u₁} (span f_1.op g.op) (some WalkingPair.right) ⟶
      (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj (some WalkingPair.right))
    (map (span f_1.op g.op) f ≫
      Iso.hom
        ((fun (x : WalkingSpan) ↦
            (match (motive :=
                (x : WalkingSpan) →
                  obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x)
                x with
              | none => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) none)
              | some WalkingPair.left => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.left)
              | some WalkingPair.right => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.right) :
              obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x))
          (some WalkingPair.right)))
    (Iso.hom
        ((fun (x : WalkingSpan) ↦
            (match (motive :=
                (x : WalkingSpan) →
                  obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x)
                x with
              | none => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) none)
              | some WalkingPair.left => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.left)
              | some WalkingPair.right => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.right) :
              obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x))
          (some WalkingPair.right)) ≫
      (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).map f)
have some : Eq (α :=
  obj.{0, v₁, 0, u₁} (span f_1.op g.op) (some WalkingPair.right) ⟶
    (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj (some WalkingPair.right))
  (map (span f_1.op g.op) (WidePushoutShape.Hom.id (some WalkingPair.right)) ≫
    Iso.hom
      ((fun (x : WalkingSpan) ↦
          (match (motive :=
              (x : WalkingSpan) →
                obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x)
              x with
            | none => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) none)
            | some WalkingPair.left => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.left)
            | some WalkingPair.right => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.right) :
            obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x))
        (some WalkingPair.right)))
  (Iso.hom
      ((fun (x : WalkingSpan) ↦
          (match (motive :=
              (x : WalkingSpan) →
                obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x)
              x with
            | none => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) none)
            | some WalkingPair.left => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.left)
            | some WalkingPair.right => Iso.refl (obj.{0, v₁, 0, u₁} (span f_1.op g.op) WalkingSpan.right) :
            obj.{0, v₁, 0, u₁} (span f_1.op g.op) x ≅ (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).obj x))
        (some WalkingPair.right)) ≫
    (walkingCospanOpEquiv.inverse ⋙ (cospan f_1 g).op).map (WidePushoutShape.Hom.id (some WalkingPair.right)))
Tactic: cases f
Cleared hypotheses: f