proposition: Lemma precompWithBinProductArrow {c d : C} (Pcd : BinProductCone c d) {a : C} (f : C⟦a,c⟧) (g : C⟦a,d⟧) {x : C} (k : C⟦x,a⟧) : k · BinProductArrow Pcd f g = BinProductArrow Pcd (k · f) (k · g).
proof: Proof. apply BinProductArrowUnique. - now rewrite <- assoc, BinProductPr1Commutes. - now rewrite <- assoc, BinProductPr2Commutes. Qed.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.Foundations.Sets UniMath.MoreFoundations.Tactics UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.Limits