Theorems · Definition · category theory

CategoryTheory.Lax.OplaxTrans.naturality

{B : Type u₁} →
  [inst : CategoryTheory.Bicategory B] →
    {C : Type u₂} →
      [inst_1 : CategoryTheory.Bicategory C] →
        {F G : CategoryTheory.LaxFunctor B C} →
          (self : CategoryTheory.Lax.OplaxTrans F G) →
            {a b : B} →
              (f : a ⟶ b) →
                CategoryTheory.CategoryStruct.comp (F.map f) (self.app b) ⟶
                  CategoryTheory.CategoryStruct.comp (self.app a) (G.map f)

The 2-morphisms underlying the oplax naturality constraint.

Defined in

Mathlib.CategoryTheory.Bicategory.NaturalTransformation.Lax

Cited by

20 results in Mathlib

Foundations

Depth 5 from the axioms · uses no axioms

Assumes

CategoryTheory.BicategoryCategoryTheory.Bicategory