∀ {C : Type u_2} [inst : CategoryTheory.Category.{u_1, u_2} C] [inst_1 : CategoryTheory.Abelian C] {D : Type u_4}
  [inst_2 : CategoryTheory.Category.{u_3, u_4} D] [inst_3 : CategoryTheory.Limits.HasZeroMorphisms D] {X Y : D}
  (p : X ⟶ Y) [inst_4 : CategoryTheory.Limits.HasKernel p] (F : CategoryTheory.Functor D C)
  [inst_5 : F.PreservesZeroMorphisms]
  [inst_6 : CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.parallelPair p 0) F],
  CategoryTheory.CategoryStruct.comp
      (((CategoryTheory.Limits.parallelPair (CategoryTheory.Limits.kernel.ι p) 0).comp F).map
        CategoryTheory.Limits.WalkingParallelPairHom.right)
      (CategoryTheory.Iso.refl
          (((CategoryTheory.Limits.parallelPair (CategoryTheory.Limits.kernel.ι p) 0).comp F).obj
            CategoryTheory.Limits.WalkingParallelPair.one)).hom =
    CategoryTheory.CategoryStruct.comp (CategoryTheory.asIso (CategoryTheory.Limits.kernelComparison p F)).hom
      ((CategoryTheory.Limits.parallelPair (CategoryTheory.Limits.kernel.ι (F.map p)) 0).map
        CategoryTheory.Limits.WalkingParallelPairHom.right)