proposition: Lemma CokernelEpiComp1 {x y z : C} (E : Epi C x y) (f : y --> z) (CK1 : Cokernel Z (E · f)) (CK2 : Cokernel Z f) : is_iso (CokernelEpiComp_mor1 E f CK1 CK2).
proof: Proof. use is_iso_qinv. - exact (CokernelEpiComp_mor2 E f CK1 CK2). - split. + unfold CokernelEpiComp_mor1. unfold CokernelEpiComp_mor2. use CokernelOutsEq. rewrite assoc. rewrite CokernelCommutes. rewrite CokernelCommutes. apply pathsinv0. apply id_right. + unfold CokernelEpiComp_mor1. unfold CokernelEpiComp_mor2. use CokernelOutsEq. rewrite assoc. rewrite CokernelCommutes. rewrite CokernelCommutes. apply pathsinv0. apply id_right. 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