proposition: Proposition internal_eta {x y z : V} (f : z --> x ⊸ y) : f = internal_lam (f #⊗ identity _ · internal_eval x y).
proof: Proof. unfold internal_lam. unfold internal_eval. refine (!_). rewrite functor_comp. rewrite !assoc. etrans. { apply maponpaths_2. pose (nat_trans_ax (unit_from_are_adjoints (pr2 (pr2 V x))) _ _ f) as p. cbn in p. refine (_ @ !p). do 2 apply maponpaths. unfold rightwhiskering_on_morphisms. unfold monoidal_cat_tensor_mor. unfold functoronmorphisms1. refine (_ @ id_right _). apply maponpaths. apply (bifunctor_leftid V). } refine (_ @ id_right _). rewrite !assoc'. apply maponpaths. exact (triangle_id_right_ad (pr2 (pr2 V x)) _). 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