proposition: Lemma isaprop_disp_left_adjoint_data_cell_unit_bicat {C : bicat} {D : disp_cat_data C} {a b : C} {f : C⟦ a, b ⟧} (l : left_adjoint_data f) {aa : (disp_cell_unit_bicat D) a} {bb : (disp_cell_unit_bicat D) b} (ff : aa -->[ f] bb) : isaprop (bb -->[ left_adjoint_right_adjoint l] aa) -> isaprop (disp_left_adjoint_data l ff).
proof: Proof. intro p. use isaproptotal2. - intro ; apply isapropdirprod ; apply isapropunit. - intro ; intros ; apply p. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Propositions UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.Initial UniMath.Bicategories.Core.Examples.Final UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.Core.Univalence UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.DisplayedBicats.DispAdjunctions UniMath.Bicategories.DisplayedBicats.DispUnivalence