Mathlib Map

Theorems · Theorem · category theory

CategoryTheory.Limits.coprodComparison_inv_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.HasBinaryCoproduct A B]
  [inst_3 : CategoryTheory.Limits.HasBinaryCoproduct A' B']
  [inst_4 : CategoryTheory.Limits.HasBinaryCoproduct (F.obj A) (F.obj B)]
  [inst_5 : CategoryTheory.Limits.HasBinaryCoproduct (F.obj A') (F.obj B')] (f : A ⟶ A') (g : B ⟶ B')
  [inst_6 : CategoryTheory.IsIso (CategoryTheory.Limits.coprodComparison F A B)]
  [inst_7 : CategoryTheory.IsIso (CategoryTheory.Limits.coprodComparison F A' B')],
  CategoryTheory.CategoryStruct.comp (CategoryTheory.inv (CategoryTheory.Limits.coprodComparison F A B))
      (CategoryTheory.Limits.coprod.map (F.map f) (F.map g)) =
    CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.coprod.map f g))
      (CategoryTheory.inv (CategoryTheory.Limits.coprodComparison F A' B'))

If the coproduct comparison morphism is an iso, its inverse is natural.

Defined in
Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts
Cited by
1 results in Mathlib
Foundations
Depth 37 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.Limits.HasBinaryCoproductCategoryTheory.Limits.HasBinaryCoproductCategoryTheory.Limits.HasBinaryCoproductCategoryTheory.Limits.HasBinaryCoproductCategoryTheory.IsIsoCategoryTheory.IsIso

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites16

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.