fact: Definition left_adjoint_equivalence_eq_to_pb {B : bicat} {b₁ b₂ b₃ : B} {f : b₁ --> b₃} {g : b₂ --> b₃} (cone₁ cone₂ : pb_cone f g) (H₂ : has_pb_ump cone₂) (p : pr1 cone₁ = pr1 cone₂) (qp1 : invertible_2cell (idtoiso_2_0 _ _ (!p) · pb_cone_pr1 cone₁) (pb_cone_pr1 cone₂)) (qp2 : invertible_2cell (idtoiso_2_0 _ _ (!p) · pb_cone_pr2 cone₁) (pb_cone_pr2 cone₂)) (path : (qp1^-1 ▹ f) • rassociator _ _ _ • (_ ◃ pb_cone_cell cone₁) • lassociator _ _ _ • (qp2 ▹ g) = pr1 (pb_cone_cell cone₂)) : has_pb_ump cone₁.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Univalence UniMath.Bicategories.Core.AdjointUnique UniMath.Bicategories.Core.EquivToAdjequiv UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.Unitors UniMath.Bicategories.Core.TransportLaws UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Morphisms.Properties.ClosedUnderInvertibles UniMath.Bicategories.Limits.Pullbacks