-- Lean 4 proof step from Mathlib.CategoryTheory.Limits.Shapes.Equalizers (goal)
Goal:
C : Type u
inst : Category.{v, u} C
X Y : C
f g_1 : X ⟶ Y
Z : WalkingParallelPair
g : one ⟶ Z
⊢ Eq.{v + 1} (α :=
    Quiver.Hom.{v, u} (V := C)
      (match (motive := WalkingParallelPair → C) zero with
        | zero => X
        | one => Y :
        C)
      (match (motive := WalkingParallelPair → C) Z with
        | zero => X
        | one => Y :
        C))
    (match (motive :=
        (X_1 Y_1 : WalkingParallelPair) →
          (X_1 ⟶ Y_1) →
            Quiver.Hom.{v, u} (V := C)
              (match (motive := WalkingParallelPair → C) X_1 with
                | zero => X
                | one => Y :
                C)
              (match (motive := WalkingParallelPair → C) Y_1 with
                | zero => X
                | one => Y :
                C))
        zero, Z, left ≫ g with
      | x, .(x), WalkingParallelPairHom.id .(x) =>
        𝟙
          (match (motive := WalkingParallelPair → C) x with
          | zero => X
          | one => Y)
      | .(zero), .(one), left => f
      | .(zero), .(one), right => g_1 :
      Quiver.Hom.{v, u} (V := C)
        (match (motive := WalkingParallelPair → C) zero with
          | zero => X
          | one => Y :
          C)
        (match (motive := WalkingParallelPair → C) Z with
          | zero => X
          | one => Y :
          C))
    (CategoryStruct.comp (Y :=
        match (motive := WalkingParallelPair → C) one with
        | zero => X
        | one => Y)
        (match (motive :=
          (X_1 Y_1 : WalkingParallelPair) →
            (X_1 ⟶ Y_1) →
              Quiver.Hom.{v, u} (V := C)
                (match (motive := WalkingParallelPair → C) X_1 with
                  | zero => X
                  | one => Y :
                  C)
                (match (motive := WalkingParallelPair → C) Y_1 with
                  | zero => X
                  | one => Y :
                  C))
          zero, one, left with
        | x, .(x), WalkingParallelPairHom.id .(x) =>
          𝟙
            (match (motive := WalkingParallelPair → C) x with
            | zero => X
            | one => Y)
        | .(zero), .(one), left => f
        | .(zero), .(one), right => g_1)
        (match (motive :=
          (X_1 Y_1 : WalkingParallelPair) →
            (X_1 ⟶ Y_1) →
              Quiver.Hom.{v, u} (V := C)
                (match (motive := WalkingParallelPair → C) X_1 with
                  | zero => X
                  | one => Y :
                  C)
                (match (motive := WalkingParallelPair → C) Y_1 with
                  | zero => X
                  | one => Y :
                  C))
          one, Z, g with
        | x, .(x), WalkingParallelPairHom.id .(x) =>
          𝟙
            (match (motive := WalkingParallelPair → C) x with
            | zero => X
            | one => Y)
        | .(zero), .(one), left => f
        | .(zero), .(one), right => g_1) :
      Quiver.Hom.{v, u} (V := C)
        (match (motive := WalkingParallelPair → C) zero with
          | zero => X
          | one => Y :
          C)
        (match (motive := WalkingParallelPair → C) Z with
          | zero => X
          | one => Y :
          C))
have left : Eq.{v + 1} (α :=
  Quiver.Hom.{v, u} (V := C)
    (match (motive := WalkingParallelPair → C) zero with
      | zero => X
      | one => Y :
      C)
    (match (motive := WalkingParallelPair → C) one with
      | zero => X
      | one => Y :
      C))
  (match (motive :=
      (X_1 Y_1 : WalkingParallelPair) →
        (X_1 ⟶ Y_1) →
          Quiver.Hom.{v, u} (V := C)
            (match (motive := WalkingParallelPair → C) X_1 with
              | zero => X
              | one => Y :
              C)
            (match (motive := WalkingParallelPair → C) Y_1 with
              | zero => X
              | one => Y :
              C))
      zero, one, left ≫ WalkingParallelPairHom.id one with
    | x, .(x), WalkingParallelPairHom.id .(x) =>
      𝟙
        (match (motive := WalkingParallelPair → C) x with
        | zero => X
        | one => Y)
    | .(zero), .(one), left => f
    | .(zero), .(one), right => g_1 :
    Quiver.Hom.{v, u} (V := C)
      (match (motive := WalkingParallelPair → C) zero with
        | zero => X
        | one => Y :
        C)
      (match (motive := WalkingParallelPair → C) one with
        | zero => X
        | one => Y :
        C))
  (CategoryStruct.comp (Y :=
      match (motive := WalkingParallelPair → C) one with
      | zero => X
      | one => Y)
      (match (motive :=
        (X_1 Y_1 : WalkingParallelPair) →
          (X_1 ⟶ Y_1) →
            Quiver.Hom.{v, u} (V := C)
              (match (motive := WalkingParallelPair → C) X_1 with
                | zero => X
                | one => Y :
                C)
              (match (motive := WalkingParallelPair → C) Y_1 with
                | zero => X
                | one => Y :
                C))
        zero, one, left with
      | x, .(x), WalkingParallelPairHom.id .(x) =>
        𝟙
          (match (motive := WalkingParallelPair → C) x with
          | zero => X
          | one => Y)
      | .(zero), .(one), left => f
      | .(zero), .(one), right => g_1)
      (match (motive :=
        (X_1 Y_1 : WalkingParallelPair) →
          (X_1 ⟶ Y_1) →
            Quiver.Hom.{v, u} (V := C)
              (match (motive := WalkingParallelPair → C) X_1 with
                | zero => X
                | one => Y :
                C)
              (match (motive := WalkingParallelPair → C) Y_1 with
                | zero => X
                | one => Y :
                C))
        one, one, WalkingParallelPairHom.id one with
      | x, .(x), WalkingParallelPairHom.id .(x) =>
        𝟙
          (match (motive := WalkingParallelPair → C) x with
          | zero => X
          | one => Y)
      | .(zero), .(one), left => f
      | .(zero), .(one), right => g_1) :
    Quiver.Hom.{v, u} (V := C)
      (match (motive := WalkingParallelPair → C) zero with
        | zero => X
        | one => Y :
        C)
      (match (motive := WalkingParallelPair → C) one with
        | zero => X
        | one => Y :
        C))
Tactic: cases g
Cleared hypotheses: Z, g