proposition: Lemma bicatcattensor_disp_prebicat_is_globally_univalent : disp_univalent_2_0 bidisp_tensor_disp_bicat.
proof: Proof. intros C D equalcats TC TD. induction equalcats. use weqhomot. - set (i1 := tensor_iso_disp_eq_equiv TC TD). set (i2 := tensor_iso_equiv_tensor_eq TC TD). set (i3 := tensor_eq_equiv_tensor_eq' TC TD). set (i4 := tensor_eq'_equiv_tensor_eq'' TC TD). set (i5 := tensor_eq''_equiv_tensor_eqi'' TC TD). set (i6 := tensor_eqi''_equiv_tensor_eqi''' TC TD). set (i7 := tensor_eqi'''_equiv_eq TC TD). exact ((i1 ∘ i2 ∘ i3 ∘ i4 ∘ i5 ∘ i6 ∘ i7)%weq). - intro p. induction p. use subtypePath. + intro. apply (@isaprop_disp_left_adjoint_equivalence bicat_of_univ_cats bidisp_tensor_disp_bicat). * exact univalent_cat_is_univalent_2_1. * exact bidisp_tensor_disp_bicat_is_locally_univalent. + use total2_paths_b. * repeat (apply funextsec ; intro). apply idpath. * repeat (apply funextsec ; intro). apply homset_property. Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Functors UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispUnivalence UniMath.Bicategories.DisplayedBicats.DispInvertibles UniMath.Bicategories.Core.Univalence UniMath.Bicategories.MonoidalCategories.UnivalenceMonCat.CurriedMonoidalCategories