proposition: Lemma isaprop_disp_adjoint_equivalence_cell_unit_bicat {C : bicat} {D : disp_cat_data C} {a b : C} {aa : (disp_cell_unit_bicat D) a} {bb : (disp_cell_unit_bicat D) b} {f : adjoint_equivalence a b} (ff : aa -->[ f ] bb) : isaprop (bb -->[left_adjoint_right_adjoint f] aa) -> isaprop (aa -->[ f] bb) -> isaprop (disp_adjoint_equivalence f aa bb).
proof: Proof. exact (λ p q, isaprop_total2 (_,,q) (λ _ , _ ,, isaprop_disp_left_adjoint_equivalence_cell_unit_bicat _ _ 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