proposition: Lemma cell_transportf_pathsinv0 {a b : C} {f g : C⟦a,b⟧} {α β : f ==> g} (e : α = β) {aa : D a} {bb : D b} {ff : aa -->[f] bb} {gg : aa -->[g] bb} {αα : ff ==>[α] gg} {ββ : ff ==>[β] gg} (ee : cell_transportf (!e) ββ = αα) : cell_transportf e αα = ββ.
proof: Proof. unfold cell_transportf. apply (transportf_pathsinv0 (λ x : f ==> g, ff ==>[x] gg)). exact ee. 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