fact: Definition has_inserter_ump_eq : UU := ∏ (x : B) (u₁ u₂ : x --> cone) (α : u₁ · inserter_cone_pr1 cone ==> u₂ · inserter_cone_pr1 cone) (p : rassociator _ _ _ • (u₁ ◃ inserter_cone_cell cone) • lassociator _ _ _ • (α ▹ g) = (α ▹ f) • rassociator _ _ _ • (u₂ ◃ inserter_cone_cell cone) • lassociator _ _ _) (φ₁ φ₂ : u₁ ==> u₂) (q₁ : φ₁ ▹ inserter_cone_pr1 cone = α) (q₂ : φ₂ ▹ inserter_cone_pr1 cone = α), φ₁ = φ₂.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.Univalence UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core UniMath.CategoryTheory.Equivalences.FullyFaithful UniMath.CategoryTheory.Categories.Dialgebras UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.AdjointUnique UniMath.Bicategories.Core.Examples.BicatOfUnivCats UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Morphisms.FullyFaithful UniMath.Bicategories.Morphisms.DiscreteMorphisms