proposition: Lemma evaluation_is_pstrans: is_pstrans evaluation_pstrans_data.
proof: Proof. repeat split. - intros A A' F F' α. apply (nat_trans_eq (homset_property _)). intro Gb. induction Gb as [G b]. cbn. do 2 rewrite functor_id. do 2 rewrite id_left. apply id_right. - intro A. apply (nat_trans_eq (homset_property _)). intro Gb. induction Gb as [G b]. cbn. do 5 rewrite id_left. rewrite id_right. apply pathsinv0, functor_id. - intros A1 A2 A3 F H. apply (nat_trans_eq (homset_property _)). intro Gb. induction Gb as [G b]. cbn. do 7 rewrite id_right. do 3 rewrite functor_id. rewrite id_left, id_right. apply pathsinv0, functor_id. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.FunctorCategory UniMath.CategoryTheory.HorizontalComposition UniMath.CategoryTheory.UnitorsAndAssociatorsForEndofunctors UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.BicatOfCats UniMath.Bicategories.PseudoFunctors.Display.PseudoFunctorBicat UniMath.Bicategories.PseudoFunctors.PseudoFunctor UniMath.Bicategories.PseudoFunctors.Biadjunction UniMath.Bicategories.Transformations.PseudoTransformation UniMath.Bicategories.PseudoFunctors.Examples.Composition UniMath.Bicategories.PseudoFunctors.Examples.Identity UniMath.Bicategories.Modifications.Modification