fact: Definition transportf_cell_of_cod_over {B : bicat} {b₁ b₂ : B} {f₁ f₂ : b₁ --> b₂} {α β : f₁ ==> f₂} {h₁ : cod_disp_bicat B b₁} {h₂ : cod_disp_bicat B b₂} {ff₁ : h₁ -->[ f₁ ] h₂} {ff₂ : h₁ -->[ f₂ ] h₂} (p : α = β) (αα : ff₁ ==>[ α ] ff₂) : pr1 (transportf (λ z, ff₁ ==>[ z ] ff₂) p αα) = pr1 αα.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Prelude UniMath.CategoryTheory.opp_precat UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.whiskering 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.Core.Unitors UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.AdjointUnique UniMath.Bicategories.Core.Examples.OneTypes UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispAdjunctions UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.Examples.Trivial UniMath.Bicategories.DisplayedBicats.Examples.Sigma