proposition: Lemma actegory_prod_action_data_is_bifunctor : is_bifunctor actegory_prod_action_data.
proof: Proof. red; repeat split. * intros v cs. apply funextsec; intro i; apply (bifunctor_leftid (ActC i)). * intros cs v. apply funextsec; intro i; apply (bifunctor_rightid (ActC i)). * intros v cs1 cs2 cs3 fs1 fs2. apply funextsec; intro i; apply (bifunctor_leftcomp (ActC i)). * intros cs v1 v2 v3 h1 h2. apply funextsec; intro i; apply (bifunctor_rightcomp (ActC i)). * intros v1 v2 cs1 cs2 h fs. apply funextsec; intro i; apply (bifunctor_equalwhiskers (ActC i)). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors UniMath.CategoryTheory.Monoidal.Categories UniMath.CategoryTheory.Monoidal.Functors UniMath.CategoryTheory.Actegories.Actegories UniMath.CategoryTheory.Actegories.MorphismsOfActegories UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.ProductCategory