fact: Definition is_classifying_full_help : UU := ∏ (x : B) (f g : x --> s) (β : disc_sopfib_slice HB x ⟦ pr1 (pb _ f) , pr1 (pb _ g) ⟧), ∑ (α : f ==> g) (γ : mor_of_pb_disc_sopfib_mor α ==> pr1 β) (Hγ : is_invertible_2cell γ), γ ▹ pr121 (pb x g) = pb_ump_mor_pr2 (pr222 (pb x g)) (mor_of_pb_disc_sopfib_mor_cone α) • pr122 β.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Unitors UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.Discreteness UniMath.Bicategories.Core.TransportLaws UniMath.Bicategories.Morphisms.FullyFaithful UniMath.Bicategories.Morphisms.InternalStreetFibration UniMath.Bicategories.Morphisms.InternalStreetOpFibration UniMath.Bicategories.Morphisms.DiscreteMorphisms UniMath.Bicategories.Morphisms.Properties.ClosedUnderPullback UniMath.Bicategories.DisplayedBicats.Examples.DisplayMapBicatSlice UniMath.Bicategories.Logic.DisplayMapBicat UniMath.Bicategories.Limits.Pullbacks UniMath.Bicategories.Limits.PullbackFunctions