Theorems · Definition · category theory

CategoryTheory.Functor.CommShift.noConfusionType

Sort u →
  {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_6} →
              [inst_2 : AddMonoid A] →
                [inst_3 : CategoryTheory.HasShift C A] →
                  [inst_4 : CategoryTheory.HasShift D A] →
                    F.CommShift A →
                      {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_6} →
                                  [inst'_2 : AddMonoid A'] →
                                    [inst'_3 : CategoryTheory.HasShift C' A'] →
                                      [inst'_4 : CategoryTheory.HasShift D' A'] → F'.CommShift A' → Sort u

Defined in

Mathlib.CategoryTheory.Shift.CommShift

Cited by

0 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.CategoryAddMonoidCategoryTheory.HasShiftCategoryTheory.HasShiftCategoryTheory.CategoryCategoryTheory.CategoryAddMonoidCategoryTheory.HasShiftCategoryTheory.HasShift