proposition: Lemma BinCoproductIn1Commutes (a b : C) (CC : BinCoproductCocone a b): ∏ (c : C) (f : a --> c) g, BinCoproductIn1 CC · BinCoproductArrow CC f g = f.
proof: Proof. intros c f g. unfold BinCoproductIn1. set (H:=colimArrowCommutes CC _ (CopCocone f g) true). apply H. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.EqDiag UniMath.CategoryTheory.Limits.BinCoproducts