proposition: Lemma comp_fmonoidal_tensor_inv_laws (x y : C) : is_inverse_in_precat (fmonoidal_preservestensordata (comp_fmonoidal_lax Fm Gm) x y) (comp_fmonoidal_tensor_inv x y).
proof: Proof. unfold comp_fmonoidal_tensor_inv. split. - cbn. etrans. { rewrite !assoc'. apply maponpaths. rewrite assoc. apply cancel_postcomposition. rewrite <- functor_comp. apply maponpaths. apply (pr12 (fmonoidal_preservestensorstrongly Fm x y)). } rewrite functor_id. rewrite id_left. apply (pr12 (fmonoidal_preservestensorstrongly Gm (F x) (F y))). - cbn. etrans. { rewrite !assoc'. apply maponpaths. rewrite assoc. apply cancel_postcomposition. apply (pr22 (fmonoidal_preservestensorstrongly Gm (F x) (F y))). } rewrite id_left. rewrite <- functor_comp. etrans. { apply maponpaths. apply (pr22 (fmonoidal_preservestensorstrongly Fm x y)). } apply functor_id. 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.whiskering UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors UniMath.CategoryTheory.Monoidal.Categories UniMath.CategoryTheory.Monoidal.Structure.Symmetric