proposition: Proposition is_univalent_poset_disp_cat : is_univalent_disp poset_disp_cat.
proof: Proof. use is_univalent_disp_from_SIP_data. - exact (λ X, isaset_PartialOrder X). - cbn. refine (λ X R₁ R₂ p q, _). use subtypePath. { intro. apply isaprop_isPartialOrder. } use funextsec ; intro. use funextsec ; intro. use weqtopathshProp. use weqimplimpl. + apply p. + apply q. + apply (pr1 R₁). + apply (pr1 R₂). Qed.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.OrderTheory.Posets UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.DisplayedCats.Core UniMath.CategoryTheory.DisplayedCats.Isos UniMath.CategoryTheory.DisplayedCats.Total UniMath.CategoryTheory.DisplayedCats.SIP UniMath.CategoryTheory.DisplayedCats.Univalence UniMath.CategoryTheory.DisplayedCats.Constructions UniMath.CategoryTheory.Limits.BinProducts UniMath.CategoryTheory.Limits.Products UniMath.CategoryTheory.Limits.Terminal UniMath.CategoryTheory.Limits.Equalizers UniMath.CategoryTheory.DisplayedCats.Binproducts UniMath.CategoryTheory.exponentials UniMath.CategoryTheory.Categories.HSET.All