proposition: Proposition prod_lwhisker_rwhisker {x₁ x₂ : C} {y₁ y₂ : C} (f : x₁ --> x₂) (g : y₁ --> y₂) : prod_lwhisker f _ · prod_rwhisker _ g = BinProductOfArrows _ _ _ f g.
proof: Proof. unfold prod_lwhisker, prod_rwhisker. rewrite BinProductOfArrows_comp. rewrite id_left, id_right. 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.Monics UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.Zero UniMath.CategoryTheory.Limits.Graphs.Colimits UniMath.CategoryTheory.Limits.Graphs.Limits UniMath.CategoryTheory.Limits.Products UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.FunctorCategory UniMath.Combinatorics.StandardFiniteSets