-- Lean 4 proof step from Mathlib.CategoryTheory.Shift.Basic (goal)
Goal:
C : Type u
A : Type u_1
inst : Category.{v, u} C
inst_1 : AddGroup A
inst_2 : HasShift.{v, u, u_1} C A
i j : A
h : i + j = 0
X : C
e_1 :
  (obj.{v, v, u, u} (shiftFunctor C i) X ⟶ obj.{v, v, u, u} (shiftFunctor C i) X) =
    (obj.{v, v, u, u}
        (Equivalence.functor
          (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j : Discrete A }
            (Discrete.eqToIso h) (Discrete.eqToIso ⋯) ⋯))
        X ⟶
      obj.{v, v, u, u}
        (Equivalence.functor
          (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
            (Discrete.eqToIso ⋯) ⋯))
        X)
e_4 :
  obj.{v, v, u, u} (shiftFunctor C i) (obj.{v, v, u, u} (shiftFunctor C j) (obj.{v, v, u, u} (shiftFunctor C i) X)) =
    obj.{v, v, u, u}
      (Equivalence.functor
        (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
          (Discrete.eqToIso ⋯) ⋯))
      (obj.{v, v, u, u}
        (Equivalence.inverse
          (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j : Discrete A }
            (Discrete.eqToIso h) (Discrete.eqToIso ⋯) ⋯))
        (obj.{v, v, u, u}
          (Equivalence.functor
            (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j : Discrete A }
              (Discrete.eqToIso h) (Discrete.eqToIso ⋯) ⋯))
          X))
e_5 :
  obj.{v, v, u, u} (shiftFunctor C i) X =
    obj.{v, v, u, u}
      (Equivalence.functor
        (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
          (Discrete.eqToIso ⋯) ⋯))
      X
e_5_1 :
  Eq (α := Functor.{v, v, u, u} C C) (shiftFunctor C j ⋙ shiftFunctor C i)
    (Equivalence.inverse
        (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j : Discrete A }
          (Discrete.eqToIso h) (Discrete.eqToIso ⋯) ⋯) ⋙
      Equivalence.functor
        (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
          (Discrete.eqToIso ⋯) ⋯))
e_3 :
  Eq (α := Functor.{v, v, u, u} C C) (shiftFunctor C j ⋙ shiftFunctor C i)
    (Equivalence.inverse
        (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j : Discrete A }
          (Discrete.eqToIso h) (Discrete.eqToIso ⋯) ⋯) ⋙
      Equivalence.functor
        (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
          (Discrete.eqToIso ⋯) ⋯))
⊢ Eq (α := Iso (C := Functor.{v, v, u, u} C C) (shiftFunctor C j ⋙ shiftFunctor C i) (𝟭 C))
    (shiftFunctorCompIsoId C j i ⋯)
    (Equivalence.counitIso
      (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
        (Discrete.eqToIso ⋯) ⋯))
have h₁ : ∀ (X : C),
  Eq.{v + 1} (α := obj.{v, v, u, u} (shiftFunctor C j ⋙ shiftFunctor C i) X ⟶ obj.{v, v, u, u} (𝟭 C) X)
    (NatTrans.app (Iso.hom (shiftFunctorCompIsoId C j i sorry)) X)
    (NatTrans.app
      (Iso.hom
        (Equivalence.counitIso
          (equivOfTensorIsoUnit (shiftMonoidalFunctor C A) { as := i : Discrete A } { as := j } (Discrete.eqToIso h)
            (Discrete.eqToIso sorry) sorry)))
      X)
Tactic: ext X