proposition: Lemma p1types_disp_univalent_2_1 : disp_univalent_2_1 p1types_disp.
proof: Proof. apply fiberwise_local_univalent_is_univalent_2_1. intros X Y f x y. cbn. intros p q. use isweq_iso. - intro α. apply α. - intros α. apply Y. - intros α. cbn in *. use subtypePath. { intro. apply (isaprop_is_disp_invertible_2cell (D:=p1types_disp)). } apply Y. Defined.
imports: UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Examples.OneTypes UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.DispUnivalence