∀ {C : Type u_2} {A : Type u_3} [inst : CategoryTheory.Category.{u_1, u_2} C] {D : Type u_5}
  [inst_1 : CategoryTheory.Category.{u_4, u_5} D] [inst_2 : AddMonoid A] [inst_3 : CategoryTheory.HasShift D A]
  {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (s : A → CategoryTheory.Functor C C)
  (i : (i : A) → (s i).comp F ≅ F.comp (CategoryTheory.shiftFunctor D i)) (n : A) (X : C),
  (CategoryTheory.Functor.FullyFaithful.hasShift.add hF s i 0 n).hom.app X =
    CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom ⋯)
      ((s n).map ((CategoryTheory.Functor.FullyFaithful.hasShift.zero hF s i).inv.app X))