proposition: Lemma equiv_isZero2 (c : C) : Limits.Zero.isZero c <- isZero c.
proof: Proof. intros X. set (XZ := make_Zero c X). split. - intros b. use tpair. apply (InitialArrow (Zero_to_Initial XZ) b). intros t. use (InitialArrowUnique (Zero_to_Initial XZ) b). - intros a. use tpair. apply (TerminalArrow (Zero_to_Terminal XZ) a). intros t. use (TerminalArrowUnique (Zero_to_Terminal XZ) a). Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.CategoryTheory.Limits.Graphs.Initial UniMath.CategoryTheory.Limits.Graphs.Terminal UniMath.CategoryTheory.Limits.Zero