fact: Definition is_distr_law_op (α : g · f ==> f · g) : UU := (rinvunitor f • (f ◃ unit_of_mnd m₂) = linvunitor f • (unit_of_mnd m₂ ▹ f) • α) × (rassociator _ _ _ • (_ ◃ α) • lassociator _ _ _ • (α ▹ _) • rassociator _ _ _ • (f ◃ μ₂) = (μ₂ ▹ f) • α) × (runitor g • linvunitor g • (η₁ ▹ endo_of_mnd m₂) = (g ◃ η₁) • α) × (lassociator _ _ _ • (α ▹ f) • rassociator _ _ _ • (f ◃ α) • lassociator _ _ _ • (μ₁ ▹ g) = (g ◃ μ₁) • α).
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.DisplayedCats.Core UniMath.Bicategories.Core.Bicat UniMath.Bicategories.Core.BicategoryLaws UniMath.Bicategories.Core.Invertible_2cells UniMath.Bicategories.Core.Unitors UniMath.Bicategories.DisplayedBicats.DispBicat UniMath.Bicategories.DisplayedBicats.Examples.MonadsLax UniMath.Bicategories.Monads.Examples.MonadsInOp1Bicat