Theorems · Definition · category theory

CategoryTheory.Oplax.StrongTrans.Hom.noConfusionType

Sort u →
  {B : Type u₁} →
    [inst : CategoryTheory.Bicategory B] →
      {C : Type u₂} →
        [inst_1 : CategoryTheory.Bicategory C] →
          {F G : CategoryTheory.OplaxFunctor B C} →
            {η θ : F ⟶ G} →
              CategoryTheory.Oplax.StrongTrans.Hom η θ →
                {B' : Type u₁} →
                  [inst' : CategoryTheory.Bicategory B'] →
                    {C' : Type u₂} →
                      [inst'_1 : CategoryTheory.Bicategory C'] →
                        {F' G' : CategoryTheory.OplaxFunctor B' C'} →
                          {η' θ' : F' ⟶ G'} → CategoryTheory.Oplax.StrongTrans.Hom η' θ' → Sort u

Defined in

Mathlib.CategoryTheory.Bicategory.Modification.Oplax

Cited by

0 results in Mathlib

Foundations

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

Assumes

CategoryTheory.BicategoryCategoryTheory.BicategoryCategoryTheory.BicategoryCategoryTheory.Bicategory