proposition: Lemma DAG_disp_univalent_2_0 : disp_univalent_2_0 DAG_disp_bicat.
proof: Proof. intros C1 C2 p dag1 dag2. use fiberwise_univalent_2_0_to_disp_univalent_2_0. intros C udag1 udag2. apply isweqimplimpl. - intro a. apply dagger_equality. repeat (apply funextsec ; intro). apply (pr1 a _). - intro ; apply isaset_dagger. - intro a. apply (isaprop_disp_adjoint_equivalence_cell_unit_bicat a) ; apply isaprop_is_dagger_functor. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DaggerCategories.Categories UniMath.CategoryTheory.DaggerCategories.Functors UniMath.CategoryTheory.DaggerCategories.Transformations UniMath.CategoryTheory.DaggerCategories.Unitary UniMath.CategoryTheory.DaggerCategories.Univalence UniMath.CategoryTheory.DaggerCategories.FunctorCategory UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.BicatOfCats UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.Examples.FullSub UniMath.Bicategories.DisplayedBicats.Examples.Sigma UniMath.Bicategories.DisplayedBicats.Examples.DisplayedCatToBicat