fact: Definition id_is_eso_full_eq_2 {c₁ c₂ : B} (m : c₁ --> c₂) {l₁ l₂ : b --> c₁} (k₁ : id₁ b · l₁ ==> id₁ b · l₂) (k₂ : l₁ · m ==> l₂ · m) (p : (k₁ ▹ m) • rassociator (id₁ b) l₂ m = rassociator (id₁ b) l₁ m • (id₁ b ◃ k₂)) : (linvunitor l₁ • k₁ • lunitor l₂) ▹ m = k₂.
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.Unitors UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.EquivToAdjequiv UniMath.Bicategories.Morphisms.FullyFaithful UniMath.Bicategories.Morphisms.Adjunctions UniMath.Bicategories.Morphisms.DiscreteMorphisms UniMath.Bicategories.Morphisms.Eso UniMath.Bicategories.Limits.Pullbacks