proposition: Lemma disp_rwhisker_transport_right {a b c : C} {f : C⟦a,b⟧} {g1 g2 : C⟦b,c⟧} {x x' : g1 ==> g2} (p : x = x') {aa : D a} {bb : D b} {cc : D c} {ff : aa -->[f] bb} (gg1 : bb -->[g1] cc) (gg2 : bb -->[g2] cc) (xx : gg1 ==>[x] gg2) : ff ◃◃ (transportf (λ x, _ ==>[x] _) p xx) = transportf (λ x, _ ==>[x] _) (maponpaths (λ x, f ◃ x) p) (ff ◃◃ xx).
proof: Proof. induction p. apply idpath. Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Total UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.Unitors UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Core.Univalence