proposition: Lemma CoproductArrowUnique (a b : C) (CC : CoproductCocone a b) (x : C) (f : a --> x) (g : b --> x) (k : CoproductObject CC --> x) : CoproductIn1 CC · k = f -> CoproductIn2 CC · k = g -> k = CoproductArrow CC f g.
proof: Proof. intros u v. apply binarySumMapUniqueness. { refine (u @ _). apply pathsinv0, CoproductIn1Commutes. } { refine (v @ _). apply pathsinv0, CoproductIn2Commutes. } Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.RepresentableFunctors.Representation