proposition: Lemma isEqualizer_path {hs : has_homsets C} {x y z : C} {f g : y --> z} {e : x --> y} {H H' : e · f = e · g} (iC : isEqualizer f g e H) : isEqualizer f g e H'.
proof: Proof. use make_isEqualizer. intros w0 h H'0. use unique_exists. - exact (pr1 (pr1 (iC w0 h H'0))). - exact (pr2 (pr1 (iC w0 h H'0))). - intros y0. apply hs. - intros y0 X. exact (base_paths _ _ (pr2 (iC w0 h H'0) (tpair _ y0 X))). Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Monics UniMath.CategoryTheory.Retracts