Theorems · Definition · category theory

CategoryTheory.Functor.whiskerRight

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {D : Type u₂} →
      [inst_1 : CategoryTheory.Category.{v₂, u₂} D] →
        {E : Type u₃} →
          [inst_2 : CategoryTheory.Category.{v₃, u₃} E] →
            {G H : CategoryTheory.Functor C D} → (G ⟶ H) → (F : CategoryTheory.Functor D E) → G.comp F ⟶ H.comp F

If α : G ⟶ H then whiskerRight α F : G ⋙ F ⟶ H ⋙ F has components F.map (α.app X).

Defined in

Mathlib.CategoryTheory.Whiskering

Cited by

467 results in Mathlib

Foundations

Depth 21 from the axioms, rests on 106 definitions · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Category