Theorems · Definition · category theory

CategoryTheory.SmallObject.SuccStruct.Iteration.F

{C : Type u} →
  [inst : CategoryTheory.Category.{v, u} C] →
    {J : Type w} →
      {Φ : CategoryTheory.SmallObject.SuccStruct C} →
        [inst_1 : LinearOrder J] →
          [inst_2 : SuccOrder J] →
            [inst_3 : OrderBot J] →
              [inst_4 : CategoryTheory.Limits.HasIterationOfShape J C] →
                [inst_5 : WellFoundedLT J] → {j : J} → Φ.Iteration j → CategoryTheory.Functor (↑(Set.Iic j)) C

The data of all ith iterations for i : J such that i ≤ j.

Defined in

Mathlib.CategoryTheory.SmallObject.Iteration.Basic

Cited by

23 results in Mathlib

Foundations

Depth 18 from the axioms · uses propext

Assumes

CategoryTheory.CategoryLinearOrderSuccOrderOrderBotCategoryTheory.Limits.HasIterationOfShapeWellFoundedLT