proposition: Lemma total_cell_eq {C : bicat} {D : disp_bicat C} {a b : C} {f g : C⟦a, b⟧} {aa : D a} {bb : D b} {ff : aa -->[f] bb} {gg : aa -->[g] bb} (x y : make_total_mor ff ==> make_total_mor gg) (e : pr1 x = pr1 y) (ee : pr2 x = transportb (λ η : f ==> g, ff ==>[ η] gg) e (pr2 y)) : x = y.
proof: Proof. exact (total2_paths2_b e ee). Defined.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.PrecategoryBinProduct UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.Core.EquivToAdjequiv UniMath.Bicategories.Core.AdjointUnique UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.DisplayedBicats.DispAdjunctions UniMath.Bicategories.DisplayedBicats.DispUnivalence