proposition: Lemma transportf_yy {C : category} (F : opp_precat_data C ⟶ SET) (c c' : C) (A : (F : functor _ _ ) c : hSet) (e : c = c') : paths (pr1weq (@yy C F c') (@transportf _ (fun d => pr1hSet (functor_on_objects F d : hSet)) _ _ e A)) (@transportf _ (fun d => nat_trans _ F) _ _ e (pr1weq (@yy C F c) A)).
proof: Proof. induction e. apply idpath. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.Categories.HSET.All UniMath.CategoryTheory.whiskering UniMath.CategoryTheory.yoneda UniMath.CategoryTheory.Limits.Pullbacks UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Univalence UniMath.Bicategories.DisplayedBicats.Examples.ContravariantFunctor UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.DisplayedBicats.Examples.Cofunctormap UniMath.Bicategories.DisplayedBicats.Examples.FullSub UniMath.Bicategories.DisplayedBicats.Examples.Sigma UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispAdjunctions UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.DisplayedBicats.Examples.Prod UniMath.Bicategories.DisplayedBicats.Examples.DisplayedCatToBicat