proposition: Lemma KernelInsEq {y z: C} {g : y --> z} (K : Kernel g) {w : C} (φ1 φ2 : C⟦w, K⟧) (H : φ1 · (KernelArrow K) = φ2 · (KernelArrow K)) : φ1 = φ2.
proof: Proof. assert (H1 : φ1 · (KernelArrow K) · g = ZeroArrow Z _ _). { rewrite <- assoc. rewrite KernelCompZero. apply ZeroArrow_comp_right. } rewrite (KernelInUnique (KernelisKernel K) H1 (idpath _)). apply pathsinv0. set (tmp := pr2 (KernelisKernel K w (φ1 · KernelArrow K) H1) (tpair _ φ2 (! H))). exact (base_paths _ _ tmp). Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Monics UniMath.CategoryTheory.Limits.Equalizers UniMath.CategoryTheory.Limits.Zero