proposition: Lemma Cokernel_up_to_iso_eq {x y z : C} (f : x --> y) (g : y --> z) (CK : Cokernel Z f) (h : z_iso CK z) (H : g = (CokernelArrow CK) · h) : f · g = ZeroArrow Z x z.
proof: Proof. induction CK as [t p]. induction t as [t' p']. induction p as [t'' p'']. unfold isCoequalizer in p''. rewrite H. rewrite <- (ZeroArrow_comp_left _ _ _ _ _ h). rewrite assoc. apply cancel_postcomposition. apply CokernelCompZero. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Epis UniMath.CategoryTheory.Limits.Coequalizers UniMath.CategoryTheory.Limits.Zero