proposition: Lemma postcompWithBinCoproductArrow {a b : C} (CCab : BinCoproduct a b) {c : C} (f : a --> c) (g : b --> c) {x : C} (k : c --> x) : BinCoproductArrow CCab f g · k = BinCoproductArrow CCab (f · k) (g · k).
proof: Proof. apply BinCoproductArrowUnique. - rewrite assoc, BinCoproductIn1Commutes; apply idpath. - rewrite assoc, BinCoproductIn2Commutes; apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Limits.Zero UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Coproducts UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.ProductCategory