Theorems · Definition · category theory

CategoryTheory.Comma.map

{A : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} A] →
    {B : Type u₂} →
      [inst_1 : CategoryTheory.Category.{v₂, u₂} B] →
        {T : Type u₃} →
          [inst_2 : CategoryTheory.Category.{v₃, u₃} T] →
            {A' : Type u₄} →
              [inst_3 : CategoryTheory.Category.{v₄, u₄} A'] →
                {B' : Type u₅} →
                  [inst_4 : CategoryTheory.Category.{v₅, u₅} B'] →
                    {T' : Type u₆} →
                      [inst_5 : CategoryTheory.Category.{v₆, u₆} T'] →
                        {L : CategoryTheory.Functor A T} →
                          {R : CategoryTheory.Functor B T} →
                            {L' : CategoryTheory.Functor A' T'} →
                              {R' : CategoryTheory.Functor B' T'} →
                                {F₁ : CategoryTheory.Functor A A'} →
                                  {F₂ : CategoryTheory.Functor B B'} →
                                    {F : CategoryTheory.Functor T T'} →
                                      (F₁.comp L' ⟶ L.comp F) →
                                        (R.comp F ⟶ F₂.comp R') →
                                          CategoryTheory.Functor (CategoryTheory.Comma L R) (CategoryTheory.Comma L' R')

The functor Comma L R ⥤ Comma L' R' induced by three functors F₁, F₂, F and two natural transformations F₁ ⋙ L' ⟶ L ⋙ F and R ⋙ F ⟶ F₂ ⋙ R'.

Defined in

Mathlib.CategoryTheory.Comma.Basic

Cited by

28 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Category