Theorems · Theorem · category theory

CategoryTheory.HasShift.Induced.zero.congr_simp

∀ {C : Type u_1} {D : Type u_2} [inst : CategoryTheory.Category.{v_1, u_1} C]
  [inst_1 : CategoryTheory.Category.{v_2, u_2} D] (F : CategoryTheory.Functor C D) {A : Type u_3} [inst_2 : AddMonoid A]
  [inst_3 : CategoryTheory.HasShift C A] (s : A → CategoryTheory.Functor D D)
  (i i_1 : (a : A) → F.comp (s a) ≅ (CategoryTheory.shiftFunctor C a).comp F),
  i = i_1 →
    ∀ [inst_4 : ((CategoryTheory.Functor.whiskeringLeft C D D).obj F).Full]
      [inst_5 : ((CategoryTheory.Functor.whiskeringLeft C D D).obj F).Faithful],
      CategoryTheory.HasShift.Induced.zero F s i = CategoryTheory.HasShift.Induced.zero F s i_1

Defined in

Mathlib.CategoryTheory.Shift.Induced

Cited by

0 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryAddMonoidCategoryTheory.HasShiftCategoryTheory.Functor.FullCategoryTheory.Functor.Faithful