Loogle!
Result
Found 171 declarations mentioning Ordinal.ToType.
- Ordinal.ToType 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u}) : Type u - hasWellFounded_toType 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : WellFoundedRelation o.ToType - Ordinal.instCoeOutToType 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : CoeOut o.ToType Ordinal.{u_1} - Cardinal.mk_ord_toType 📋 Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{u_1}) : Cardinal.mk c.ord.ToType = c - Cardinal.mk_toType 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : Cardinal.mk o.ToType = o.card - Ordinal.isEmpty_toType_zero 📋 Mathlib.SetTheory.Ordinal.Basic
: IsEmpty (Ordinal.ToType 0) - Ordinal.uniqueToTypeOne 📋 Mathlib.SetTheory.Ordinal.Basic
: Unique (Ordinal.ToType 1) - Ordinal.ToType.toOrd 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (α : o.ToType) : ↑(Set.Iio o) - Ordinal.instCoeToTypeElemIio 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : Coe o.ToType ↑(Set.Iio o) - Ordinal.finite_toType_of_lt_omega0 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (h : o < Ordinal.omega0) : Finite o.ToType - Cardinal.nonempty_ord_toType 📋 Mathlib.SetTheory.Ordinal.Basic
{c : Cardinal.{u_1}} (h : c ≠ 0) : Nonempty c.ord.ToType - Ordinal.isEmpty_toType_iff 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} : IsEmpty o.ToType ↔ o = 0 - Ordinal.nonempty_toType_iff 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} : Nonempty o.ToType ↔ o ≠ 0 - Ordinal.instSuccOrderToType 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : SuccOrder o.ToType - Ordinal.toTypeOrderBot 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (ho : o ≠ 0) : OrderBot o.ToType - Cardinal.mk_Iio_ord_toType 📋 Mathlib.SetTheory.Ordinal.Basic
{c : Cardinal.{u_1}} (i : c.ord.ToType) : Cardinal.mk ↑(Set.Iio i) < c - Cardinal.mk_Iio_toType_ord_lt 📋 Mathlib.SetTheory.Ordinal.Basic
{c : Cardinal.{u_1}} (i : c.ord.ToType) : Cardinal.mk ↑(Set.Iio i) < c - Ordinal.ToType.mk 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} : ↑(Set.Iio o) ≃o o.ToType - Ordinal.initialSegToType 📋 Mathlib.SetTheory.Ordinal.Basic
{α β : Ordinal.{u_1}} (h : α ≤ β) : α.ToType ≤i β.ToType - Ordinal.principalSegToType 📋 Mathlib.SetTheory.Ordinal.Basic
{α β : Ordinal.{u_1}} (h : α < β) : α.ToType <i β.ToType - Ordinal.type_toType 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u}) : (Ordinal.type fun x1 x2 => x1 < x2) = o - Ordinal.typein_lt_self 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (i : o.ToType) : (Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding i < o - Cardinal.card_typein_toType_lt 📋 Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{u_1}) (x : c.ord.ToType) : ((Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding x).card < c - Ordinal.typein_one_toType 📋 Mathlib.SetTheory.Ordinal.Basic
(x : Ordinal.ToType 1) : (Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding x = 0 - Ordinal.typein_le_typein' 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) {x y : o.ToType} : (Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding x ≤ (Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding y ↔ x ≤ y - Ordinal.enum_zero_eq_bot 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (ho : 0 < o) : (Ordinal.enum fun x1 x2 => x1 < x2) ⟨0, ⋯⟩ = have H := Ordinal.toTypeOrderBot ⋯; ⊥ - Ordinal.enum_zero_le' 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (h0 : 0 < o) (a : o.ToType) : (Ordinal.enum fun x1 x2 => x1 < x2) ⟨0, ⋯⟩ ≤ a - Ordinal.one_toType_eq 📋 Mathlib.SetTheory.Ordinal.Basic
(x : Ordinal.ToType 1) : x = (Ordinal.enum fun x1 x2 => x1 < x2) ⟨0, Ordinal.uniqueToTypeOne._proof_2⟩ - Ordinal.le_enum_succ 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} (a : (Order.succ o).ToType) : a ≤ (Ordinal.enum fun x1 x2 => x1 < x2) ⟨o, ⋯⟩ - Ordinal.enum_le_enum' 📋 Mathlib.SetTheory.Ordinal.Basic
(a : Ordinal.{u_1}) {o₁ o₂ : ↑(Set.Iio (Ordinal.type fun x1 x2 => x1 < x2))} : (Ordinal.enum fun x1 x2 => x1 < x2) o₁ ≤ (Ordinal.enum fun x1 x2 => x1 < x2) o₂ ↔ o₁ ≤ o₂ - Cardinal.instNonemptyToTypeOrdAleph0 📋 Mathlib.SetTheory.Ordinal.Arithmetic
: Nonempty Cardinal.aleph0.ord.ToType - Cardinal.orderBotAleph0OrdToType 📋 Mathlib.SetTheory.Ordinal.Arithmetic
: OrderBot Cardinal.aleph0.ord.ToType - Cardinal.noMaxOrder 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{c : Cardinal.{u_1}} (h : Cardinal.aleph0 ≤ c) : NoMaxOrder c.ord.ToType - Ordinal.toType_noMax_of_succ_lt 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{o : Ordinal.{u_4}} (ho : ∀ a < o, Order.succ a < o) : NoMaxOrder o.ToType - Ordinal.orderTopToTypeSucc 📋 Mathlib.SetTheory.Ordinal.Arithmetic
(o : Ordinal.{u_4}) : OrderTop (Order.succ o).ToType - Ordinal.enum_succ_eq_top 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{o : Ordinal.{u_4}} : (Ordinal.enum fun x1 x2 => x1 < x2) ⟨o, ⋯⟩ = ⊤ - Ordinal.familyOfBFamily 📋 Mathlib.SetTheory.Ordinal.Family
{α : Type u_1} (o : Ordinal.{u_3}) (f : (a : Ordinal.{u_3}) → a < o → α) : o.ToType → α - Ordinal.lsub_eq_blsub 📋 Mathlib.SetTheory.Ordinal.Family
{o : Ordinal.{u}} (f : (a : Ordinal.{u}) → a < o → Ordinal.{max u v}) : Ordinal.lsub (o.familyOfBFamily f) = o.blsub f - Ordinal.range_familyOfBFamily 📋 Mathlib.SetTheory.Ordinal.Family
{α : Type u_1} {o : Ordinal.{u_3}} (f : (a : Ordinal.{u_3}) → a < o → α) : Set.range (o.familyOfBFamily f) = o.brange f - Ordinal.iSup_eq_bsup 📋 Mathlib.SetTheory.Ordinal.Family
{o : Ordinal.{u_3}} (f : (a : Ordinal.{u_3}) → a < o → Ordinal.{max u_3 u_4}) : iSup (o.familyOfBFamily f) = o.bsup f - Ordinal.comp_familyOfBFamily 📋 Mathlib.SetTheory.Ordinal.Family
{α : Type u_1} {β : Type u_2} {o : Ordinal.{u_3}} (f : (a : Ordinal.{u_3}) → a < o → α) (g : α → β) : g ∘ o.familyOfBFamily f = o.familyOfBFamily fun i hi => g (f i hi) - Ordinal.lsub_typein 📋 Mathlib.SetTheory.Ordinal.Family
(o : Ordinal.{u}) : Ordinal.lsub ⇑(Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding = o - Ordinal.iSup_typein_limit 📋 Mathlib.SetTheory.Ordinal.Family
{o : Ordinal.{u}} (ho : ∀ a < o, Order.succ a < o) : iSup ⇑(Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding = o - Ordinal.iSup_typein_succ 📋 Mathlib.SetTheory.Ordinal.Family
{o : Ordinal.{u_3}} : iSup ⇑(Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding = o - Ordinal.familyOfBFamily_enum 📋 Mathlib.SetTheory.Ordinal.Family
{α : Type u_1} (o : Ordinal.{u_3}) (f : (a : Ordinal.{u_3}) → a < o → α) (i : Ordinal.{u_3}) (hi : i < o) : o.familyOfBFamily f ((Ordinal.enum fun x1 x2 => x1 < x2) ⟨i, ⋯⟩) = f i hi - Cardinal.countable_toType_of_lt_omega_one 📋 Mathlib.SetTheory.Cardinal.Aleph
{o : Ordinal.{u_1}} (h : o < Ordinal.omega 1) : Countable o.ToType - Ordinal.cof_toType 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : Order.cof o.ToType = o.cof - Ordinal.card_iSup_Iio_le_sum_card 📋 Mathlib.SetTheory.Cardinal.Ordinal
{o : Ordinal.{u}} (f : ↑(Set.Iio o) → Ordinal.{max u v}) : (⨆ a, f a).card ≤ Cardinal.sum fun i => (f i.toOrd).card - CategoryTheory.instIsCardinalFilteredToTypeOrd 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered κ.ord.ToType κ - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] : Prop - CategoryTheory.SmallObject.hasCoproducts 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Limits.HasCoproducts C - CategoryTheory.SmallObject.hasPushouts 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Limits.HasPushouts C - CategoryTheory.SmallObject.locallySmall 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.hasCoproducts 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Limits.HasCoproducts C - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.hasPushouts 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Limits.HasPushouts C - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.locallySmall 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.SmallObject.isSmall 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.MorphismProperty.IsSmall.{w, v, u} I - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.isSmall 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {I : CategoryTheory.MorphismProperty C} (κ : Cardinal.{w}) {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.MorphismProperty.IsSmall.{w, v, u} I - CategoryTheory.SmallObject.obj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : C - CategoryTheory.SmallObject.iteration 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Functor (CategoryTheory.Arrow C) (CategoryTheory.Arrow C) - CategoryTheory.SmallObject.functorialFactorizationData 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : I.rlp.llp.FunctorialFactorizationData I.rlp - CategoryTheory.SmallObject.hasFunctorialFactorization 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : I.rlp.llp.HasFunctorialFactorization I.rlp - CategoryTheory.SmallObject.llp_rlp_of_isCardinalForSmallObjectArgument 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : I.rlp.llp = (CategoryTheory.MorphismProperty.transfiniteCompositions.{w, v, u} (CategoryTheory.MorphismProperty.coproducts.{w, v, u} I).pushouts).retracts - CategoryTheory.SmallObject.succStruct 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.SmallObject.SuccStruct (CategoryTheory.Functor (CategoryTheory.Arrow C) (CategoryTheory.Arrow C)) - CategoryTheory.SmallObject.ιObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : X ⟶ CategoryTheory.SmallObject.obj I κ f - CategoryTheory.SmallObject.πObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : CategoryTheory.SmallObject.obj I κ f ⟶ Y - CategoryTheory.SmallObject.iterationObjRightIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : f.right ≅ ((CategoryTheory.SmallObject.iteration I κ).obj f).right - CategoryTheory.SmallObject.hasIterationOfShape 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.hasIterationOfShape 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} (I : CategoryTheory.MorphismProperty C) {κ : Cardinal.{w}} {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C - CategoryTheory.SmallObject.rlp_πObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : I.rlp (CategoryTheory.SmallObject.πObj I κ f) - CategoryTheory.SmallObject.llp_rlp_ιObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : I.rlp.llp (CategoryTheory.SmallObject.ιObj I κ f) - CategoryTheory.SmallObject.hasRightLiftingProperty_πObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y A B : C} (i : A ⟶ B) (hi : I i) (f : X ⟶ Y) : CategoryTheory.HasLiftingProperty i (CategoryTheory.SmallObject.πObj I κ f) - CategoryTheory.SmallObject.functorialFactorizationData_Z_obj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : (CategoryTheory.SmallObject.functorialFactorizationData I κ).Z.obj f = CategoryTheory.SmallObject.obj I κ f.hom - CategoryTheory.SmallObject.objMap 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g : CategoryTheory.Arrow C} (φ : f ⟶ g) : CategoryTheory.SmallObject.obj I κ f.hom ⟶ CategoryTheory.SmallObject.obj I κ g.hom - CategoryTheory.SmallObject.ιObj_πObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.ιObj I κ f) (CategoryTheory.SmallObject.πObj I κ f) = f - CategoryTheory.SmallObject.iterationFunctor 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Functor κ.ord.ToType (CategoryTheory.Functor (CategoryTheory.Arrow C) (CategoryTheory.Arrow C)) - CategoryTheory.SmallObject.ιIteration 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : CategoryTheory.Functor.id (CategoryTheory.Arrow C) ⟶ CategoryTheory.SmallObject.iteration I κ - CategoryTheory.SmallObject.objMap_id 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : CategoryTheory.SmallObject.objMap I κ (CategoryTheory.CategoryStruct.id f) = CategoryTheory.CategoryStruct.id (CategoryTheory.SmallObject.obj I κ f.hom) - CategoryTheory.SmallObject.ιObj_πObj_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) {Z : C} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.ιObj I κ f) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f) h) = CategoryTheory.CategoryStruct.comp f h - CategoryTheory.SmallObject.iterationFunctorObjObjRightIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj f).right ≅ f.right - CategoryTheory.SmallObject.functorialFactorizationData_Z_map 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X✝ Y✝ : CategoryTheory.Arrow C} (φ : X✝ ⟶ Y✝) : (CategoryTheory.SmallObject.functorialFactorizationData I κ).Z.map φ = CategoryTheory.SmallObject.objMap I κ φ - CategoryTheory.SmallObject.instIsIsoRightAppArrowιIteration 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : CategoryTheory.IsIso (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f)) - CategoryTheory.SmallObject.llp_rlp_of_isCardinalForSmallObjectArgument' 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : I.rlp.llp = ((CategoryTheory.MorphismProperty.coproducts.{w, v, u} I).pushouts.transfiniteCompositionsOfShape κ.ord.ToType).retracts - CategoryTheory.SmallObject.transfiniteCompositionsOfShape_ιObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : (CategoryTheory.MorphismProperty.coproducts.{w, v, u} I).pushouts.transfiniteCompositionsOfShape κ.ord.ToType (CategoryTheory.SmallObject.ιObj I κ f) - CategoryTheory.SmallObject.iterationObjRightIso_hom 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : (CategoryTheory.SmallObject.iterationObjRightIso I κ f).hom = CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f) - CategoryTheory.SmallObject.functorialFactorizationData_i_app 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : (CategoryTheory.SmallObject.functorialFactorizationData I κ).i.app f = CategoryTheory.SmallObject.ιObj I κ f.hom - CategoryTheory.SmallObject.functorialFactorizationData_p_app 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : (CategoryTheory.SmallObject.functorialFactorizationData I κ).p.app f = CategoryTheory.SmallObject.πObj I κ f.hom - CategoryTheory.SmallObject.ιObj_naturality 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g : CategoryTheory.Arrow C} (φ : f ⟶ g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.ιObj I κ f.hom) (CategoryTheory.SmallObject.objMap I κ φ) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.left φ) (CategoryTheory.SmallObject.ιObj I κ g.hom) - CategoryTheory.SmallObject.πObj_naturality 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g : CategoryTheory.Arrow C} (φ : f ⟶ g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ φ) (CategoryTheory.SmallObject.πObj I κ g.hom) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f.hom) (CategoryTheory.Arrow.Hom.right φ) - CategoryTheory.SmallObject.objMap_comp 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g h : CategoryTheory.Arrow C} (φ : f ⟶ g) (ψ : g ⟶ h) : CategoryTheory.SmallObject.objMap I κ (CategoryTheory.CategoryStruct.comp φ ψ) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ φ) (CategoryTheory.SmallObject.objMap I κ ψ) - CategoryTheory.SmallObject.hasColimitsOfShape_discrete 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (X Y : C) (p : X ⟶ Y) : CategoryTheory.Limits.HasColimitsOfShape (CategoryTheory.Discrete (CategoryTheory.SmallObject.FunctorObjIndex I.homFamily p)) C - CategoryTheory.SmallObject.transfiniteCompositionOfShapeSuccStructPropιIteration 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : (CategoryTheory.SmallObject.succStruct I κ).prop.TransfiniteCompositionOfShape κ.ord.ToType (CategoryTheory.SmallObject.ιIteration I κ) - CategoryTheory.SmallObject.ιObj_naturality_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g : CategoryTheory.Arrow C} (φ : f ⟶ g) {Z : C} (h : CategoryTheory.SmallObject.obj I κ g.hom ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.ιObj I κ f.hom) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ φ) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.left φ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.ιObj I κ g.hom) h) - CategoryTheory.SmallObject.πObj_naturality_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g : CategoryTheory.Arrow C} (φ : f ⟶ g) {Z : C} (h : g.right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ φ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ g.hom) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f.hom) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right φ) h) - CategoryTheory.SmallObject.πObj_ιIteration_app_right 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f) (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app (CategoryTheory.Arrow.mk f))) = ((CategoryTheory.SmallObject.iteration I κ).obj (CategoryTheory.Arrow.mk f)).hom - CategoryTheory.SmallObject.relativeCellComplexιObj 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) (CategoryTheory.SmallObject.ιObj I κ f) - CategoryTheory.SmallObject.transfiniteCompositionOfShapeιIterationAppRight 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) : (CategoryTheory.MorphismProperty.isomorphisms C).TransfiniteCompositionOfShape κ.ord.ToType (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f)) - CategoryTheory.SmallObject.objMap_comp_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {f g h : CategoryTheory.Arrow C} (φ : f ⟶ g) (ψ : g ⟶ h) {Z : C} (h✝ : CategoryTheory.SmallObject.obj I κ h.hom ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ (CategoryTheory.CategoryStruct.comp φ ψ)) h✝ = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ φ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.objMap I κ ψ) h✝) - CategoryTheory.SmallObject.πObj_ιIteration_app_right_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) {Z : C} (h : ((CategoryTheory.SmallObject.iteration I κ).obj (CategoryTheory.Arrow.mk f)).right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app (CategoryTheory.Arrow.mk f))) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.iteration I κ).obj (CategoryTheory.Arrow.mk f)).hom h - CategoryTheory.SmallObject.attachCellsOfSuccStructProp 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {F G : CategoryTheory.Functor (CategoryTheory.Arrow C) (CategoryTheory.Arrow C)} {φ : F ⟶ G} (h : (CategoryTheory.SmallObject.succStruct I κ).prop φ) (f : CategoryTheory.Arrow C) : HomotopicalAlgebra.AttachCells I.homFamily (CategoryTheory.Arrow.Hom.left (φ.app f)) - CategoryTheory.SmallObject.succStruct_prop_le_propArrow 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : (CategoryTheory.SmallObject.succStruct I κ).prop ≤ (CategoryTheory.SmallObject.propArrow I).functorCategory (CategoryTheory.Arrow C) - CategoryTheory.SmallObject.transfiniteCompositionOfShapeSuccStructPropιIteration_F 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] : (CategoryTheory.SmallObject.transfiniteCompositionOfShapeSuccStructPropιIteration I κ).F = CategoryTheory.SmallObject.iterationFunctor I κ - CategoryTheory.SmallObject.prop_iterationFunctor_map_succ 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (j : κ.ord.ToType) : (CategoryTheory.SmallObject.succStruct I κ).prop ((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.SmallObject.preservesColimit 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {A B X Y : C} (i : A ⟶ B) (hi : I i) (f : X ⟶ Y) (hf : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) f) : CategoryTheory.Limits.PreservesColimit hf.F (CategoryTheory.coyoneda.obj (Opposite.op A)) - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.preservesColimit 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {I : CategoryTheory.MorphismProperty C} {κ : Cardinal.{w}} {inst✝¹ : Fact κ.IsRegular} {inst✝² : OrderBot κ.ord.ToType} [self : I.IsCardinalForSmallObjectArgument κ] {A B X Y : C} (i : A ⟶ B) : I i → ∀ (f : X ⟶ Y) (hf : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) f), CategoryTheory.Limits.PreservesColimit hf.F (CategoryTheory.coyoneda.obj (Opposite.op A)) - CategoryTheory.SmallObject.instIsIsoRightAppArrowMapToTypeOrdFunctorIterationFunctor 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {j₁ j₂ : κ.ord.ToType} (φ : j₁ ⟶ j₂) (f : CategoryTheory.Arrow C) : CategoryTheory.IsIso (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map φ).app f)) - CategoryTheory.MorphismProperty.IsCardinalForSmallObjectArgument.mk 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : CategoryTheory.MorphismProperty C} {κ : Cardinal.{w}} [Fact κ.IsRegular] [OrderBot κ.ord.ToType] (isSmall : CategoryTheory.MorphismProperty.IsSmall.{w, v, u} I := by infer_instance) (locallySmall : CategoryTheory.LocallySmall.{w, v, u} C := by infer_instance) (hasPushouts : CategoryTheory.Limits.HasPushouts C := by infer_instance) (hasCoproducts : CategoryTheory.Limits.HasCoproducts C := by infer_instance) (hasIterationOfShape : CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C := by infer_instance) (preservesColimit : ∀ {A B X Y : C} (i : A ⟶ B), I i → ∀ (f : X ⟶ Y) (hf : HomotopicalAlgebra.RelativeCellComplex (fun x => I.homFamily) f), CategoryTheory.Limits.PreservesColimit hf.F (CategoryTheory.coyoneda.obj (Opposite.op A))) : I.IsCardinalForSmallObjectArgument κ - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f) ≅ CategoryTheory.Arrow.mk ((CategoryTheory.SmallObject.ε I.homFamily).app (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj f)) - CategoryTheory.SmallObject.iterationFunctorObjObjRightIso_ιIteration_app_right_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) {Z : C} (h : ((CategoryTheory.SmallObject.iteration I κ).obj f).right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ f j).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f)) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.transfiniteCompositionOfShapeιIterationAppRight I κ f).incl.app j) h - CategoryTheory.SmallObject.iterationFunctorObjObjRightIso_ιIteration_app_right 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ f j).hom (CategoryTheory.Arrow.Hom.right ((CategoryTheory.SmallObject.ιIteration I κ).app f)) = (CategoryTheory.SmallObject.transfiniteCompositionOfShapeιIterationAppRight I κ f).incl.app j - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_left 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.Arrow.Hom.left (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom = CategoryTheory.CategoryStruct.id (CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)).left - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_right_right_comp_assoc 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) {Z : C} (h : (((CategoryTheory.SmallObject.iterationFunctor I κ).obj (Order.succ j)).obj f).right ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (CategoryTheory.Arrow.Hom.right (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)) h) = h - CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso_hom_right_right_comp 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] (f : CategoryTheory.Arrow C) (j : κ.ord.ToType) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Arrow.Hom.right (CategoryTheory.Arrow.Hom.right (CategoryTheory.SmallObject.iterationFunctorMapSuccAppArrowIso I κ f j).hom)) (CategoryTheory.Arrow.Hom.right (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)) = CategoryTheory.CategoryStruct.id (CategoryTheory.Arrow.mk (((CategoryTheory.SmallObject.iterationFunctor I κ).map (CategoryTheory.homOfLE ⋯)).app f)).right.right - CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : (CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.obj (Order.succ j) ≅ CategoryTheory.SmallObject.functorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom - CategoryTheory.SmallObject.ιFunctorObj_eq 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.ιFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).F.map (CategoryTheory.homOfLE ⋯)) (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).hom - CategoryTheory.SmallObject.πFunctorObj_eq 📋 Mathlib.CategoryTheory.SmallObject.IsCardinalForSmallObjectArgument
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [OrderBot κ.ord.ToType] [I.IsCardinalForSmallObjectArgument κ] {X Y : C} (f : X ⟶ Y) (j : κ.ord.ToType) : CategoryTheory.SmallObject.πFunctorObj I.homFamily (((CategoryTheory.SmallObject.iterationFunctor I κ).obj j).obj (CategoryTheory.Arrow.mk f)).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.relativeCellComplexιObjFObjSuccIso I κ f j).inv (CategoryTheory.CategoryStruct.comp ((CategoryTheory.SmallObject.relativeCellComplexιObj I κ f).incl.app (Order.succ j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.SmallObject.πObj I κ f) (CategoryTheory.SmallObject.iterationFunctorObjObjRightIso I κ (CategoryTheory.Arrow.mk f) j).inv)) - CategoryTheory.MorphismProperty.instOrderBotToTypeOrdSmallObjectκ 📋 Mathlib.CategoryTheory.SmallObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) [I.HasSmallObjectArgument] : OrderBot I.smallObjectκ.ord.ToType - CategoryTheory.MorphismProperty.HasSmallObjectArgument.exists_cardinal 📋 Mathlib.CategoryTheory.SmallObject.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {I : CategoryTheory.MorphismProperty C} [self : I.HasSmallObjectArgument] : ∃ κ, ∃ (x : Fact κ.IsRegular), ∃ x_1, I.IsCardinalForSmallObjectArgument κ - CategoryTheory.MorphismProperty.HasSmallObjectArgument.mk 📋 Mathlib.CategoryTheory.SmallObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : CategoryTheory.MorphismProperty C} (exists_cardinal : ∃ κ, ∃ (x : Fact κ.IsRegular), ∃ x_1, I.IsCardinalForSmallObjectArgument κ) : I.HasSmallObjectArgument - CategoryTheory.MorphismProperty.llp_rlp_of_hasSmallObjectArgument' 📋 Mathlib.CategoryTheory.SmallObject.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (I : CategoryTheory.MorphismProperty C) [I.HasSmallObjectArgument] : I.rlp.llp = ((CategoryTheory.MorphismProperty.coproducts.{w, v, u} I).pushouts.transfiniteCompositionsOfShape I.smallObjectκ.ord.ToType).retracts - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.exists_ordinal 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (A₀ : CategoryTheory.Subobject X) : ∃ o j, transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j A₀ = ⊤ - CategoryTheory.SmallCategoryCardinalLT.hasCardinalLT 📋 Mathlib.CategoryTheory.SmallRepresentatives
(κ : Cardinal.{w}) (S : CategoryTheory.SmallCategoryCardinalLT κ) : HasCardinalLT (CategoryTheory.Arrow (CategoryTheory.SmallCategoryCardinalLT.categoryFamily κ S)) κ - CategoryTheory.SmallCategoryCardinalLT.exists_equivalence 📋 Mathlib.CategoryTheory.SmallRepresentatives
(κ : Cardinal.{w}) (C : Type u) [CategoryTheory.Category.{v, u} C] (hC : HasCardinalLT (CategoryTheory.Arrow C) κ) : ∃ S, Nonempty (CategoryTheory.SmallCategoryCardinalLT.categoryFamily κ S ≌ C) - CategoryTheory.ObjectProperty.instIsClosedUnderColimitsOfShapeColimitsCardinalClosureCategoryFamily 📋 Mathlib.CategoryTheory.ObjectProperty.ColimitsCardinalClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) (κ : Cardinal.{w}) (S : CategoryTheory.SmallCategoryCardinalLT κ) : (P.colimitsCardinalClosure κ).IsClosedUnderColimitsOfShape (CategoryTheory.SmallCategoryCardinalLT.categoryFamily κ S) - CategoryTheory.OrthogonalReflection.reflectionObj 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] : C - CategoryTheory.OrthogonalReflection.reflection 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] : Z ⟶ CategoryTheory.OrthogonalReflection.reflectionObj W Z κ - CategoryTheory.OrthogonalReflection.isLocal_isLocal_reflection 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] : W.isLocal.isLocal (CategoryTheory.OrthogonalReflection.reflection W Z κ) - CategoryTheory.OrthogonalReflection.iteration 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] : CategoryTheory.Functor κ.ord.ToType C - CategoryTheory.OrthogonalReflection.isLocal_reflectionObj 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (hW : ∀ ⦃X Y : C⦄ (f : X ⟶ Y), W f → CategoryTheory.IsCardinalPresentable X κ ∧ CategoryTheory.IsCardinalPresentable Y κ) : W.isLocal (CategoryTheory.OrthogonalReflection.reflectionObj W Z κ) - CategoryTheory.OrthogonalReflection.isRightAdjoint_ι 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (hW : ∀ ⦃X Y : C⦄ (f : X ⟶ Y), W f → CategoryTheory.IsCardinalPresentable X κ ∧ CategoryTheory.IsCardinalPresentable Y κ) : W.isLocal.ι.IsRightAdjoint - CategoryTheory.OrthogonalReflection.corepresentableBy 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (hW : ∀ ⦃X Y : C⦄ (f : X ⟶ Y), W f → CategoryTheory.IsCardinalPresentable X κ ∧ CategoryTheory.IsCardinalPresentable Y κ) : (W.isLocal.ι.comp (CategoryTheory.coyoneda.obj (Opposite.op Z))).CorepresentableBy { obj := CategoryTheory.OrthogonalReflection.reflectionObj W Z κ, property := ⋯ } - CategoryTheory.OrthogonalReflection.transfiniteCompositionOfShapeReflection 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] : W.isLocal.isLocal.TransfiniteCompositionOfShape κ.ord.ToType (CategoryTheory.OrthogonalReflection.reflection W Z κ) - CategoryTheory.OrthogonalReflection.iterationObjSuccIso 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) : (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj (Order.succ j) ≅ CategoryTheory.OrthogonalReflection.succ W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) - CategoryTheory.OrthogonalReflection.iteration_map_succ_surjectivity 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {Z : C} [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] {X Y : C} (f : X ⟶ Y) (hf : W f) {j : κ.ord.ToType} (g : X ⟶ (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) : ∃ g', CategoryTheory.CategoryStruct.comp f g' = CategoryTheory.CategoryStruct.comp g ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.OrthogonalReflection.iteration_map_succ_injectivity 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] {W : CategoryTheory.MorphismProperty C} {Z : C} [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] {κ : Cardinal.{w}} [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] {X Y : C} (f : X ⟶ Y) (hf : W f) {j : κ.ord.ToType} (g₁ g₂ : Y ⟶ (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j) (hg : CategoryTheory.CategoryStruct.comp f g₁ = CategoryTheory.CategoryStruct.comp f g₂) : CategoryTheory.CategoryStruct.comp g₁ ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) = CategoryTheory.CategoryStruct.comp g₂ ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) - CategoryTheory.OrthogonalReflection.iteration_map_succ 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) : (CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯) = CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.toSucc W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.OrthogonalReflection.iterationObjSuccIso W Z κ j).inv - CategoryTheory.OrthogonalReflection.iteration_map_succ_assoc 📋 Mathlib.CategoryTheory.Presentable.OrthogonalReflection
{C : Type u} [CategoryTheory.Category.{v, u} C] (W : CategoryTheory.MorphismProperty C) (Z : C) [CategoryTheory.Limits.HasPushouts C] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₁] [∀ (Z : C), CategoryTheory.Limits.HasCoproduct CategoryTheory.OrthogonalReflection.D₁.obj₂] [∀ (Z : C), CategoryTheory.Limits.HasMulticoequalizer (CategoryTheory.OrthogonalReflection.D₂.multispanIndex W Z)] (κ : Cardinal.{w}) [OrderBot κ.ord.ToType] [CategoryTheory.Limits.HasIterationOfShape κ.ord.ToType C] [Fact κ.IsRegular] (j : κ.ord.ToType) {Z✝ : C} (h : (CategoryTheory.OrthogonalReflection.iteration W Z κ).obj (Order.succ j) ⟶ Z✝) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.OrthogonalReflection.iteration W Z κ).map (CategoryTheory.homOfLE ⋯)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.toStep W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.fromStep W ((CategoryTheory.OrthogonalReflection.iteration W Z κ).obj j)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.OrthogonalReflection.iterationObjSuccIso W Z κ j).inv h)) - CategoryTheory.CardinalDirectedPoset.SetCardinalLT.fromSigma 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Lemmas
(κ : Cardinal.{u}) (X : Type u) (x : (κ' : ↑(Set.Iio κ)) × ((↑κ').ord.ToType → X)) : CategoryTheory.CardinalDirectedPoset.SetCardinalLT κ X - CategoryTheory.CardinalDirectedPoset.SetCardinalLT.fromSigma_surjective 📋 Mathlib.CategoryTheory.Presentable.SharplyLT.Lemmas
(κ : Cardinal.{u}) (X : Type u) : Function.Surjective (CategoryTheory.CardinalDirectedPoset.SetCardinalLT.fromSigma κ X) - Field.Emb.Cardinal.wellOrderedBasis 📋 Mathlib.FieldTheory.CardinalEmb
(F : Type u) (E : Type v) [Field F] [Field E] [Algebra F E] : Module.Basis (Module.rank F E).ord.ToType F E - Field.Emb.Cardinal.factor 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) : Type v - Field.Emb.Cardinal.leastExt 📋 Mathlib.FieldTheory.CardinalEmb
(F : Type u) (E : Type v) [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : (Module.rank F E).ord.ToType → (Module.rank F E).ord.ToType - Field.Emb.Cardinal.embEquivPi 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : Field.Emb F E ≃ ((i : (Module.rank F E).ord.ToType) → Field.Emb.Cardinal.factor ↑i) - Field.Emb.Cardinal.noMaxOrder_rank_toType 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] : NoMaxOrder (Module.rank F E).ord.ToType - Field.Emb.Cardinal.filtration 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : WithTop (Module.rank F E).ord.ToType ↪o IntermediateField F E - Field.Emb.Cardinal.adjoin_basis_eq_top 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] : IntermediateField.adjoin F (Set.range ⇑(Field.Emb.Cardinal.wellOrderedBasis F E)) = ⊤ - Field.Emb.Cardinal.strictMono_leastExt 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : StrictMono (Field.Emb.Cardinal.leastExt F E) - Field.Emb.Cardinal.strictMono_filtration 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : StrictMono fun x => IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio x) - Field.Emb.Cardinal.iSup_adjoin_eq_top 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : ⨆ i, IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i) = ⊤ - Field.Emb.Cardinal.adjoin_image_leastExt 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i) = IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) '' Set.Iio (Field.Emb.Cardinal.leastExt F E i)) - Field.Emb.Cardinal.isLeast_leastExt 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : IsLeast {k | (Field.Emb.Cardinal.wellOrderedBasis F E) k ∉ IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)} (Field.Emb.Cardinal.leastExt F E i) - Field.Emb.Cardinal.eq_bot_of_not_nonempty 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] {i : WithTop (Module.rank F E).ord.ToType} (hi : Order.IsSuccPrelimit i) : ¬Nonempty ↑(Set.Iio i) → Field.Emb.Cardinal.filtration i = ⊥ - Field.Emb.Cardinal.directed_filtration 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] {i : WithTop (Module.rank F E).ord.ToType} : Directed (fun x1 x2 => x1 ≤ x2) fun j => Field.Emb.Cardinal.filtration ↑j - Field.Emb.Cardinal.filtration_apply 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) : Field.Emb.Cardinal.filtration i = WithTop.recTopCoe ⊤ (fun x => IntermediateField.adjoin F ((fun a => (Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E a)) '' Set.Iio x)) i - Field.Emb.Cardinal.iSup_filtration 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] {i : WithTop (Module.rank F E).ord.ToType} (hi : Order.IsSuccPrelimit i) : ⨆ j, Field.Emb.Cardinal.filtration ↑j = Field.Emb.Cardinal.filtration i - Field.Emb.Cardinal.instInverseSystemWithTopToTypeOrdRankAlgHomSubtypeMemIntermediateFieldCoeOrderEmbeddingFiltrationAlgebraicClosureEmbFunctor 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] : InverseSystem (Field.Emb.Cardinal.embFunctor F E) - Field.Emb.Cardinal.filtration_succ 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i)) = IntermediateField.restrictScalars F (↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯ - Field.Emb.Cardinal.embFunctor 📋 Mathlib.FieldTheory.CardinalEmb
(F : Type u) (E : Type v) [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] ⦃i j : WithTop (Module.rank F E).ord.ToType⦄ (h : i ≤ j) (f : ↥(Field.Emb.Cardinal.filtration j) →ₐ[F] AlgebraicClosure E) : ↥(Field.Emb.Cardinal.filtration i) →ₐ[F] AlgebraicClosure E - Field.Emb.Cardinal.equivSucc 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) : (↥(Field.Emb.Cardinal.filtration (Order.succ i)) →ₐ[F] AlgebraicClosure E) ≃ (↥(Field.Emb.Cardinal.filtration i) →ₐ[F] AlgebraicClosure E) × Field.Emb.Cardinal.factor i - Field.Emb.Cardinal.equivLim 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] {i : WithTop (Module.rank F E).ord.ToType} (hi : Order.IsSuccPrelimit i) : (↥(Field.Emb.Cardinal.filtration i) →ₐ[F] AlgebraicClosure E) ≃ ↑(InverseSystem.limit (Field.Emb.Cardinal.embFunctor F E) i) - Field.Emb.Cardinal.deg_lt_aleph0 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : Cardinal.mk (Field.Emb ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) ↥(↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯) < Cardinal.aleph0 - Field.Emb.Cardinal.two_le_deg 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] [Algebra.IsSeparable F E] (i : (Module.rank F E).ord.ToType) : 2 ≤ Cardinal.mk (Field.Emb ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) ↥(↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯) - Field.Emb.Cardinal.succEquiv 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : (↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i))) →ₐ[F] AlgebraicClosure E) ≃ (↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) →ₐ[F] AlgebraicClosure E) × Field.Emb ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) ↥(↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯ - Field.Emb.Cardinal.instIsSeparableSubtypeMemIntermediateFieldAdjoinImageToTypeOrdRankCompCoeBasisWellOrderedBasisLeastExtIioSingletonSet 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] [Algebra.IsSeparable F E] (i : (Module.rank F E).ord.ToType) : Algebra.IsSeparable ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) ↥(↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯ - Field.Emb.Cardinal.instFiniteDimensionalSubtypeMemIntermediateFieldAdjoinImageToTypeOrdRankCompCoeBasisWellOrderedBasisLeastExtIioSingletonSet 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) : FiniteDimensional ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)) ↥(↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio i)))⟮(Field.Emb.Cardinal.wellOrderedBasis F E) (Field.Emb.Cardinal.leastExt F E i)⟯ - Field.Emb.Cardinal.equivSucc_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : WithTop (Module.rank F E).ord.ToType) (f : ↥(Field.Emb.Cardinal.filtration (Order.succ i)) →ₐ[F] AlgebraicClosure E) : ((Field.Emb.Cardinal.equivSucc i) f).1 = Field.Emb.Cardinal.embFunctor F E ⋯ f - Field.Emb.Cardinal.equivLim_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] {i : WithTop (Module.rank F E).ord.ToType} (hi : Order.IsSuccPrelimit i) (x : ↥(Field.Emb.Cardinal.filtration i) →ₐ[F] AlgebraicClosure E) (l : ↑(Set.Iio i)) : ↑((Field.Emb.Cardinal.equivLim hi) x) l = Field.Emb.Cardinal.embFunctor F E ⋯ x - Field.Emb.Cardinal.succEquiv_coherence 📋 Mathlib.FieldTheory.CardinalEmb
{F : Type u} {E : Type v} [Field F] [Field E] [Algebra F E] [rank_inf : Fact (Cardinal.aleph0 ≤ Module.rank F E)] [Algebra.IsAlgebraic F E] (i : (Module.rank F E).ord.ToType) (f : ↥(IntermediateField.adjoin F (⇑(Field.Emb.Cardinal.wellOrderedBasis F E) ∘ Field.Emb.Cardinal.leastExt F E '' Set.Iio (Order.succ i))) →ₐ[F] AlgebraicClosure E) : ((Field.Emb.Cardinal.succEquiv i) f).1 = f.comp (Subalgebra.inclusion ⋯) - Ordinal.instCountableToTypeEpsilonOfNat 📋 Mathlib.SetTheory.Ordinal.Veblen
: Countable (Ordinal.epsilon 0).ToType - Ordinal.instCountableToTypeGammaOfNat 📋 Mathlib.SetTheory.Ordinal.Veblen
: Countable (Ordinal.gamma 0).ToType - Ordinal.type_toPSet 📋 Mathlib.SetTheory.ZFC.Ordinal
(o : Ordinal.{u_1}) : o.toPSet.Type = o.ToType
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c