Theorems · Definition · category theory

CategoryTheory.RepresentablyFlat.casesOn

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    {D : Type u₂} →
      [inst_1 : CategoryTheory.Category.{v₂, u₂} D] →
        {F : CategoryTheory.Functor C D} →
          {motive : CategoryTheory.RepresentablyFlat F → Sort u} →
            (t : CategoryTheory.RepresentablyFlat F) →
              ((cofiltered : ∀ (X : D), CategoryTheory.IsCofiltered (CategoryTheory.StructuredArrow X F)) → motive ⋯) →
                motive t

Defined in

Mathlib.CategoryTheory.Functor.Flat

Cited by

0 results in Mathlib

Foundations

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

Assumes

CategoryTheory.CategoryCategoryTheory.Category