Theorems · Theorem · category theory

CategoryTheory.Functor.CommShift.comp_commShiftIso_hom_app

∀ {C : Type u_1} {D : Type u_2} {E : Type u_3} [inst : CategoryTheory.Category.{v_1, u_1} C]
  [inst_1 : CategoryTheory.Category.{v_2, u_2} D] [inst_2 : CategoryTheory.Category.{v_3, u_3} E]
  (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) {A : Type u_4} [inst_3 : AddMonoid A]
  [inst_4 : CategoryTheory.HasShift C A] [inst_5 : CategoryTheory.HasShift D A] [inst_6 : CategoryTheory.HasShift E A]
  [inst_7 : F.CommShift A] [inst_8 : G.CommShift A] (a : A) (X : C),
  (CategoryTheory.Functor.commShiftIso (F.comp G) a).hom.app X =
    CategoryTheory.CategoryStruct.comp (G.map ((CategoryTheory.Functor.commShiftIso F a).hom.app X))
      ((CategoryTheory.Functor.commShiftIso G a).hom.app (F.obj X))

Defined in

Mathlib.CategoryTheory.Shift.CommShift

Cited by

1 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryCategoryTheory.CategoryAddMonoidCategoryTheory.HasShiftCategoryTheory.HasShiftCategoryTheory.HasShiftCategoryTheory.Functor.CommShiftCategoryTheory.Functor.CommShift