proposition: Lemma rightwhiskering_functor_pre (F : bifunctor_data) (bri : bifunctor_rightidax F) (brc : bifunctor_rightcompax F) (b : B) : functor A C.
proof: Proof. use make_functor. - use tpair. + intro a. exact (a ⊗_{F} b). + intros a1 a2 f. exact (f ⊗^{F}_{r} b). - use tpair. + intros a. exact (bri b a). + intros a1 a2 a3 f2 f3. cbn. exact (brc b a1 a2 a3 f2 f3). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Limits.BinCoproducts UniMath.CategoryTheory.Limits.Coproducts UniMath.CategoryTheory.ProductCategory