Theorems · Theorem · category theory

CategoryTheory.Limits.prodComparison_natural

∀ {C : Type u} [inst : CategoryTheory.Category.{v, u} C] {D : Type u₂} [inst_1 : CategoryTheory.Category.{w, u₂} D]
  (F : CategoryTheory.Functor C D) {A A' B B' : C} [inst_2 : CategoryTheory.Limits.HasBinaryProduct A B]
  [inst_3 : CategoryTheory.Limits.HasBinaryProduct A' B']
  [inst_4 : CategoryTheory.Limits.HasBinaryProduct (F.obj A) (F.obj B)]
  [inst_5 : CategoryTheory.Limits.HasBinaryProduct (F.obj A') (F.obj B')] (f : A ⟶ A') (g : B ⟶ B'),
  CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.prod.map f g))
      (CategoryTheory.Limits.prodComparison F A' B') =
    CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.prodComparison F A B)
      (CategoryTheory.Limits.prod.map (F.map f) (F.map g))

Naturality of the prodComparison morphism in both arguments.

Defined in

Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts

Cited by

3 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Limits.HasBinaryProductCategoryTheory.Limits.HasBinaryProductCategoryTheory.Limits.HasBinaryProductCategoryTheory.Limits.HasBinaryProduct