Theorems · Definition · category theory

CategoryTheory.Abelian.casesOn

{C : Type u} →
  [inst : CategoryTheory.Category.{v, u} C] →
    {motive : CategoryTheory.Abelian C → Sort u_1} →
      (t : CategoryTheory.Abelian C) →
        ([toPreadditive : CategoryTheory.Preadditive C] →
            [toIsNormalMonoCategory : CategoryTheory.IsNormalMonoCategory C] →
              [toIsNormalEpiCategory : CategoryTheory.IsNormalEpiCategory C] →
                [has_finite_products : CategoryTheory.Limits.HasFiniteProducts C] →
                  [has_kernels : CategoryTheory.Limits.HasKernels C] →
                    [has_cokernels : CategoryTheory.Limits.HasCokernels C] →
                      motive
                        { toPreadditive := toPreadditive, toIsNormalMonoCategory := toIsNormalMonoCategory,
                          toIsNormalEpiCategory := toIsNormalEpiCategory, has_finite_products := has_finite_products,
                          has_kernels := has_kernels, has_cokernels := has_cokernels }) →
          motive t

Defined in

Mathlib.CategoryTheory.Abelian.Basic

Cited by

0 results in Mathlib

Foundations

Depth 20 from the axioms · uses propext

Assumes

CategoryTheory.Category