proposition: Proposition internal_beta {x y z : V} (f : z ⊗ x --> y) : internal_lam f #⊗ identity x · internal_eval x y = f.
proof: Proof. unfold internal_lam. rewrite tensor_comp_r_id_l. rewrite !assoc'. unfold internal_eval. etrans. { apply maponpaths. pose (nat_trans_ax (counit_from_are_adjoints (pr2 (pr2 V x))) _ _ f) as p. refine (_ @ p). apply maponpaths_2. cbn. unfold rightwhiskering_on_morphisms. unfold monoidal_cat_tensor_mor. unfold functoronmorphisms1. refine (_ @ id_right _). apply maponpaths. apply (bifunctor_leftid V). } cbn. rewrite !assoc. refine (_ @ id_left _). apply maponpaths_2. refine (_ @ triangle_id_left_ad (pr2 (pr2 V x)) _). apply maponpaths_2. cbn. unfold rightwhiskering_on_morphisms. unfold monoidal_cat_tensor_mor. unfold functoronmorphisms1. refine (_ @ id_right _). apply maponpaths. apply (bifunctor_leftid V). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Monoidal.WhiskeredBifunctors UniMath.CategoryTheory.Monoidal.Categories UniMath.CategoryTheory.Monoidal.Structure.Symmetric