Theorems · Definition · category theory

CategoryTheory.Oplax.OplaxTrans.StrongCore.casesOn

{B : Type u₁} →
  [inst : CategoryTheory.Bicategory B] →
    {C : Type u₂} →
      [inst_1 : CategoryTheory.Bicategory C] →
        {F G : CategoryTheory.OplaxFunctor B C} →
          {η : F ⟶ G} →
            {motive : CategoryTheory.Oplax.OplaxTrans.StrongCore η → Sort u} →
              (t : CategoryTheory.Oplax.OplaxTrans.StrongCore η) →
                ((naturality :
                      {a b : B} →
                        (f : a ⟶ b) →
                          CategoryTheory.CategoryStruct.comp (F.map f) (η.app b) ≅
                            CategoryTheory.CategoryStruct.comp (η.app a) (G.map f)) →
                    (naturality_hom : ∀ {a b : B} (f : a ⟶ b), (naturality f).hom = η.naturality f) →
                      motive { naturality := naturality, naturality_hom := naturality_hom }) →
                  motive t

Defined in

Mathlib.CategoryTheory.Bicategory.NaturalTransformation.Oplax

Cited by

0 results in Mathlib

Foundations

Depth 31 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.BicategoryCategoryTheory.Bicategory