proposition: Proposition pstrans_to_indexed_functor_laws : indexed_functor_laws pstrans_to_indexed_functor_data.
proof: Proof. repeat split. - intros x xx. refine (nat_trans_eq_pointwise (pstrans_id τ x) xx @ _) ; cbn. rewrite !id_left. apply idpath. - intros x y z f g xx. refine (nat_trans_eq_pointwise (pstrans_comp τ f g) xx @ _) ; cbn. rewrite !id_left, !id_right. apply idpath. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.OppositeCategory.Core UniMath.CategoryTheory.IndexedCategories.IndexedCategory UniMath.CategoryTheory.IndexedCategories.IndexedFunctor UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Discreteness UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.Core.Examples.DiscreteBicat UniMath.Bicategories.PseudoFunctors.Display.PseudoFunctorBicat UniMath.Bicategories.PseudoFunctors.PseudoFunctor UniMath.Bicategories.PseudoFunctors.Examples.PseudoFunctorsIntoCat UniMath.Bicategories.Transformations.PseudoTransformation