proposition: Lemma disp_rwhisker_transport_left_new {a b c : C} {f1 f2 : C⟦a,b⟧} {g : C⟦b,c⟧} {x x' : f1 ==> f2} (p : x = x') {aa : D a} {bb : D b} {cc : D c} {ff1 : aa -->[f1] bb} {ff2 : aa -->[f2] bb} (xx : ff1 ==>[x] ff2) (gg : bb -->[g] cc) : (transportf (λ x, _ ==>[x] _) p xx) ▹▹ gg = transportf (λ x, _ ==>[x] _) (maponpaths (λ x, x ▹ g) p) (xx ▹▹ gg).
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