Loogle!
Result
Found 506 declarations mentioning Cardinal.IsRegular. Of these, only the first 200 are shown.
- Cardinal.IsRegular 📋 Mathlib.SetTheory.Cardinal.Regular
(c : Cardinal.{u_1}) : Prop - Cardinal.isRegular_aleph0 📋 Mathlib.SetTheory.Cardinal.Regular
: Cardinal.aleph0.IsRegular - Cardinal.fact_isRegular_aleph0 📋 Mathlib.SetTheory.Cardinal.Regular
: Fact Cardinal.aleph0.IsRegular - Cardinal.IsInaccessible.isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (h : c.IsInaccessible) : c.IsRegular - Cardinal.IsRegular.lift 📋 Mathlib.SetTheory.Cardinal.Regular
{κ : Cardinal.{v}} (h : κ.IsRegular) : (Cardinal.lift.{u, v} κ).IsRegular - Cardinal.IsRegular.not_isSingular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsRegular) : ¬c.IsSingular - Cardinal.IsSingular.not_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsSingular) : ¬c.IsRegular - Cardinal.isRegular_lift_iff 📋 Mathlib.SetTheory.Cardinal.Regular
{κ : Cardinal.{v}} : (Cardinal.lift.{u, v} κ).IsRegular ↔ κ.IsRegular - Cardinal.IsRegular.aleph0_le 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (self : c.IsRegular) : Cardinal.aleph0 ≤ c - Cardinal.IsRegular.cof_eq 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) : c.ord.cof = c - Cardinal.IsRegular.cof_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) : c.ord.cof = c - Cardinal.isRegular_cof 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} (h : Order.IsSuccLimit o) : o.cof.IsRegular - Cardinal.IsRegular.le_cof_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (self : c.IsRegular) : c ≤ c.ord.cof - Cardinal.isRegular_or_isSingular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (h : Cardinal.aleph0 ≤ c) : c.IsRegular ∨ c.IsSingular - Cardinal.IsRegular.of_not_isSingular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (h₀ : Cardinal.aleph0 ≤ c) (hc : ¬c.IsSingular) : c.IsRegular - Cardinal.IsSingular.of_not_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (h₀ : Cardinal.aleph0 ≤ c) (hc : ¬c.IsRegular) : c.IsSingular - Cardinal.IsRegular.ne_zero 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) : c ≠ 0 - Cardinal.isRegular_succ 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : (Order.succ c).IsRegular - Cardinal.IsRegular.mk 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (aleph0_le : Cardinal.aleph0 ≤ c) (le_cof_ord : c ≤ c.ord.cof) : c.IsRegular - Cardinal.lt_aleph0_or_isRegular_or_isSingular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} : c < Cardinal.aleph0 ∨ c.IsRegular ∨ c.IsSingular - Cardinal.IsRegular.nat_lt 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) (n : ℕ) : ↑n < c - Cardinal.isRegular_iff 📋 Mathlib.SetTheory.Cardinal.Regular
(c : Cardinal.{u_1}) : c.IsRegular ↔ Cardinal.aleph0 ≤ c ∧ c ≤ c.ord.cof - Cardinal.IsRegular.pos 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) : 0 < c - Cardinal.IsRegular.ord_pos 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) : 0 < c.ord - Cardinal.isInaccessible_def 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} : c.IsInaccessible ↔ Cardinal.aleph0 < c ∧ c.IsRegular ∧ c.IsStrongLimit - Cardinal.isRegular_aleph_one 📋 Mathlib.SetTheory.Cardinal.Regular
: (Cardinal.aleph 1).IsRegular - Cardinal.isRegular_aleph_succ 📋 Mathlib.SetTheory.Cardinal.Regular
(o : Ordinal.{u_1}) : (Cardinal.aleph (Order.succ o)).IsRegular - Cardinal.sum_lt_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u}} {ι : Type u} {f : ι → Cardinal.{u}} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) : (∀ (i : ι), f i < c) → Cardinal.sum f < c - Cardinal.isRegular_aleph_add_one 📋 Mathlib.SetTheory.Cardinal.Regular
(o : Ordinal.{u_1}) : (Cardinal.aleph (o + 1)).IsRegular - Cardinal.sum_lt_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{max u v}} {ι : Type u} {f : ι → Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c) (hf : ∀ (i : ι), f i < c) : Cardinal.sum f < c - Cardinal.lsub_lt_ord_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type (max u_1 u_2)} {f : ι → Ordinal.{max u_1 u_2}} {c : Cardinal.{max u_1 u_2}} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) : (∀ (i : ι), f i < c.ord) → Ordinal.lsub f < c.ord - Cardinal.isRegular_preAleph_succ 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} (h : Ordinal.omega0 ≤ o) : (Cardinal.preAleph (Order.succ o)).IsRegular - Cardinal.lsub_lt_ord_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Ordinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c) (hf : ∀ (i : ι), f i < c.ord) : Ordinal.lsub f < c.ord - Cardinal.isRegular_preAleph_add_one 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} (h : Ordinal.omega0 ≤ o) : (Cardinal.preAleph (o + 1)).IsRegular - Cardinal.card_iUnion_lt_iff_forall_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u}} {ι α : Type u} {t : ι → Set α} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) : Cardinal.mk ↑(⋃ i, t i) < c ↔ ∀ (i : ι), Cardinal.mk ↑(t i) < c - Cardinal.iSup_lt_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u_1} {f : ι → Cardinal.{u_1}} {c : Cardinal.{u_1}} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) : (∀ (i : ι), f i < c) → iSup f < c - Cardinal.iSup_lt_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Cardinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c) (hf : ∀ (i : ι), f i < c) : iSup f < c - Cardinal.iSup_lt_ord_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u_1} {f : ι → Ordinal.{u_1}} {c : Cardinal.{u_1}} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) : (∀ (i : ι), f i < c.ord) → iSup f < c.ord - Cardinal.iSup_lt_ord_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Ordinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c) (hf : ∀ (i : ι), f i < c.ord) : iSup f < c.ord - Cardinal.deriv_lt_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{f : Ordinal.{u} → Ordinal.{u}} {c : Cardinal.{u}} (hc : c.IsRegular) (hc' : c ≠ Cardinal.aleph0) (hf : ∀ i < c.ord, f i < c.ord) {a : Ordinal.{u}} : a < c.ord → Ordinal.deriv f a < c.ord - Cardinal.nfp_lt_ord_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{f : Ordinal.{u_1} → Ordinal.{u_1}} {c : Cardinal.{u_1}} (hc : c.IsRegular) (hc' : c ≠ Cardinal.aleph0) (hf : ∀ i < c.ord, f i < c.ord) {a : Ordinal.{u_1}} : a < c.ord → Ordinal.nfp f a < c.ord - Cardinal.blsub_lt_ord_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{max u_1 u_2}} {f : (a : Ordinal.{max u_1 u_2}) → a < o → Ordinal.{max u_1 u_2}} {c : Cardinal.{max u_1 u_2}} (hc : c.IsRegular) (ho : o.card < c) : (∀ (i : Ordinal.{max u_1 u_2}) (hi : i < o), f i hi < c.ord) → o.blsub f < c.ord - Cardinal.bsup_lt_ord_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{max u_1 u_2}} {f : (a : Ordinal.{max u_1 u_2}) → a < o → Ordinal.{max u_1 u_2}} {c : Cardinal.{max u_1 u_2}} (hc : c.IsRegular) (hι : o.card < c) : (∀ (i : Ordinal.{max u_1 u_2}) (hi : i < o), f i hi < c.ord) → o.bsup f < c.ord - Cardinal.blsub_lt_ord_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) → a < o → Ordinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (ho : Cardinal.lift.{v, u} o.card < c) : (∀ (i : Ordinal.{u}) (hi : i < o), f i hi < c.ord) → o.blsub f < c.ord - Cardinal.bsup_lt_ord_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) → a < o → Ordinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} o.card < c) : (∀ (i : Ordinal.{u}) (hi : i < o), f i hi < c.ord) → o.bsup f < c.ord - Cardinal.derivFamily_lt_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Ordinal.{u} → Ordinal.{u}} {c : Cardinal.{u}} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) (hc' : c ≠ Cardinal.aleph0) (hf : ∀ (i : ι), ∀ b < c.ord, f i b < c.ord) {a : Ordinal.{u}} : a < c.ord → Ordinal.derivFamily f a < c.ord - Cardinal.nfpFamily_lt_ord_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Ordinal.{u} → Ordinal.{u}} {c : Cardinal.{u}} (hc : c.IsRegular) (hι : Cardinal.mk ι < c) (hc' : c ≠ Cardinal.aleph0) {a : Ordinal.{u}} (hf : ∀ (i : ι), ∀ b < c.ord, f i b < c.ord) : a < c.ord → Ordinal.nfpFamily f a < c.ord - Cardinal.derivFamily_lt_ord_lift 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Ordinal.{max u v} → Ordinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c) (hc' : c ≠ Cardinal.aleph0) (hf : ∀ (i : ι), ∀ b < c.ord, f i b < c.ord) {a : Ordinal.{max u v}} : a < c.ord → Ordinal.derivFamily f a < c.ord - Cardinal.nfpFamily_lt_ord_lift_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{ι : Type u} {f : ι → Ordinal.{max u v} → Ordinal.{max u v}} {c : Cardinal.{max u v}} (hc : c.IsRegular) (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c) (hc' : c ≠ Cardinal.aleph0) (hf : ∀ (i : ι), ∀ b < c.ord, f i b < c.ord) {a : Ordinal.{max u v}} (ha : a < c.ord) : Ordinal.nfpFamily f a < c.ord - Cardinal.IsRegular.cof_omega_eq 📋 Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} (H : (Cardinal.aleph o).IsRegular) : (Ordinal.omega o).cof = Cardinal.aleph o - Cardinal.card_biUnion_lt_iff_forall_of_isRegular 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u}} {α β : Type u} {s : Set α} {t : (a : α) → a ∈ s → Set β} (hc : c.IsRegular) (hs : Cardinal.mk ↑s < c) : Cardinal.mk ↑(⋃ a, ⋃ (h : a ∈ s), t a h) < c ↔ ∀ (a : α) (ha : a ∈ s), Cardinal.mk ↑(t a ha) < c - HasCardinalLT.exists_regular_cardinal 📋 Mathlib.SetTheory.Cardinal.HasCardinalLT
(X : Type u) [Small.{w, u} X] : ∃ κ, κ.IsRegular ∧ HasCardinalLT X κ - HasCardinalLT.exists_regular_cardinal_forall 📋 Mathlib.SetTheory.Cardinal.HasCardinalLT
{ι : Type v} (X : ι → Type u) [Small.{w, v} ι] [∀ (i : ι), Small.{w, u} (X i)] : ∃ κ, κ.IsRegular ∧ ∀ (i : ι), HasCardinalLT (X i) κ - hasCardinalLT_sigma 📋 Mathlib.SetTheory.Cardinal.HasCardinalLT
{ι : Type u} (α : ι → Type v) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hι : HasCardinalLT ι κ) (hα : ∀ (i : ι), HasCardinalLT (α i) κ) : HasCardinalLT ((i : ι) × α i) κ - hasCardinalLT_sigma' 📋 Mathlib.SetTheory.Cardinal.HasCardinalLT
{ι : Type w} (α : ι → Type w) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hι : HasCardinalLT ι κ) (hα : ∀ (i : ι), HasCardinalLT (α i) κ) : HasCardinalLT ((i : ι) × α i) κ - hasCardinalLT_iUnion 📋 Mathlib.SetTheory.Cardinal.HasCardinalLT
{ι : Type u_1} {X : Type u_2} (S : ι → Set X) {κ : Cardinal.{u_3}} [Fact κ.IsRegular] (hι : HasCardinalLT ι κ) (hS : ∀ (i : ι), HasCardinalLT (↑(S i)) κ) : HasCardinalLT (↑(⋃ i, S i)) κ - hasCardinalLT_subtype_iSup 📋 Mathlib.SetTheory.Cardinal.HasCardinalLT
{ι : Type u_1} {X : Type u_2} (P : ι → X → Prop) {κ : Cardinal.{u_3}} [Fact κ.IsRegular] (hι : HasCardinalLT ι κ) (hP : ∀ (i : ι), HasCardinalLT (Subtype (P i)) κ) : HasCardinalLT (Subtype (⨆ i, P i)) κ - CategoryTheory.ObjectProperty.isEssentiallySmall_limitsClosure 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] (κ : Cardinal.{w}) [Fact κ.IsRegular] (h : ∀ (a : α), HasCardinalLT (J a) κ) [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] [CategoryTheory.LocallySmall.{w, v, u} C] [Small.{w, t} α] [∀ (a : α), Small.{w, u'} (J a)] [∀ (a : α), CategoryTheory.LocallySmall.{w, v', u'} (J a)] : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} (P.limitsClosure J) - CategoryTheory.ObjectProperty.isoClosure_strictLimitsClosureIter_eq_limitsClosure 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] (κ : Cardinal.{w}) [Fact κ.IsRegular] (h : ∀ (a : α), HasCardinalLT (J a) κ) : (P.strictLimitsClosureIter J κ.ord).isoClosure = P.limitsClosure J - CategoryTheory.ObjectProperty.strictLimitsClosureStep_strictLimitsClosureIter_eq_self 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] (κ : Cardinal.{w}) [Fact κ.IsRegular] (h : ∀ (a : α), HasCardinalLT (J a) κ) : (P.strictLimitsClosureIter J κ.ord).strictLimitsClosureStep J = P.strictLimitsClosureIter J κ.ord - CategoryTheory.IsCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] : Prop - CategoryTheory.IsCardinalFiltered.nonempty 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] : Nonempty J - CategoryTheory.isCardinalFiltered_of_hasTerminal 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] [CategoryTheory.Limits.HasTerminal J] (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.isFiltered_of_isCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.IsFiltered J - CategoryTheory.Limits.IsTerminal.isCardinalFiltered 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {X : J} (hX : CategoryTheory.Limits.IsTerminal X) (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.IsCardinalFiltered.max 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type u'} (S : K → J) (hS : HasCardinalLT K κ) : J - CategoryTheory.IsCardinalFiltered.instOfSubsingletonOfNonemptyOfIsThin 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(κ : Cardinal.{w}) [Fact κ.IsRegular] (J : Type u_1) [CategoryTheory.Category.{v_1, u_1} J] [Subsingleton J] [Nonempty J] [Quiver.IsThin J] : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.isCardinalFiltered_under 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (j₀ : J) : CategoryTheory.IsCardinalFiltered (CategoryTheory.Under j₀) κ - CategoryTheory.IsCardinalFiltered.of_equivalence 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {J' : Type u'} [CategoryTheory.Category.{v', u'} J'] (e : J ≌ J') : CategoryTheory.IsCardinalFiltered J' κ - CategoryTheory.IsCardinalFiltered.of_le 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {κ' : Cardinal.{w}} [Fact κ'.IsRegular] (h : κ' ≤ κ) : CategoryTheory.IsCardinalFiltered J κ' - CategoryTheory.isCardinalFiltered_pi 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{ι : Type u'} (J : ι → Type u) [(i : ι) → CategoryTheory.Category.{v, u} (J i)] (κ : Cardinal.{w}) [Fact κ.IsRegular] [∀ (i : ι), CategoryTheory.IsCardinalFiltered (J i) κ] : CategoryTheory.IsCardinalFiltered ((i : ι) → J i) κ - CategoryTheory.IsCardinalFiltered.coeq 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) : J - CategoryTheory.isCardinalFiltered_prod 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J₁ : Type u) (J₂ : Type u') [CategoryTheory.Category.{v, u} J₁] [CategoryTheory.Category.{v', u'} J₂] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J₁ κ] [CategoryTheory.IsCardinalFiltered J₂ κ] : CategoryTheory.IsCardinalFiltered (J₁ × J₂) κ - CategoryTheory.IsCardinalFiltered.cocone 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {A : Type v'} [CategoryTheory.Category.{u', v'} A] (F : CategoryTheory.Functor A J) (hA : HasCardinalLT (CategoryTheory.Arrow A) κ) : CategoryTheory.Limits.Cocone F - CategoryTheory.IsCardinalFiltered.of_final 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J₁ : Type u} [CategoryTheory.Category.{v, u} J₁] {J₂ : Type u'} [CategoryTheory.Category.{v', u'} J₂] (F : CategoryTheory.Functor J₁ J₂) [F.Final] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J₁ κ] : CategoryTheory.IsCardinalFiltered J₂ κ - CategoryTheory.IsCardinalFiltered.mk 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] (nonempty_cocone : ∀ {A : Type w} [inst : CategoryTheory.SmallCategory A] (F : CategoryTheory.Functor A J), HasCardinalLT (CategoryTheory.Arrow A) κ → Nonempty (CategoryTheory.Limits.Cocone F)) : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.IsCardinalFiltered.nonempty_cocone 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} {inst✝ : CategoryTheory.Category.{v, u} J} {κ : Cardinal.{w}} {inst✝¹ : Fact κ.IsRegular} [self : CategoryTheory.IsCardinalFiltered J κ] {A : Type w} [CategoryTheory.SmallCategory A] (F : CategoryTheory.Functor A J) (hA : HasCardinalLT (CategoryTheory.Arrow A) κ) : Nonempty (CategoryTheory.Limits.Cocone F) - CategoryTheory.IsCardinalFiltered.exists_max 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type u'} (S : K → J) (hS : HasCardinalLT K κ) : ∃ j, Nonempty ((k : K) → S k ⟶ j) - CategoryTheory.IsCardinalFiltered.toMax 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type u'} (S : K → J) (hS : HasCardinalLT K κ) (k : K) : S k ⟶ CategoryTheory.IsCardinalFiltered.max S hS - CategoryTheory.isCardinalFiltered_preorder 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type w) [Preorder J] (κ : Cardinal.{w}) [Fact κ.IsRegular] (h : ∀ ⦃K : Type w⦄ (s : K → J), Cardinal.mk K < κ → ∃ j, ∀ (k : K), s k ≤ j) : CategoryTheory.IsCardinalFiltered J κ - CategoryTheory.instIsCardinalFilteredToTypeOrd 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(κ : Cardinal.{w}) [hκ : Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered κ.ord.ToType κ - CategoryTheory.IsCardinalFiltered.coeqHom 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) : j' ⟶ CategoryTheory.IsCardinalFiltered.coeq f hK - CategoryTheory.IsCardinalFiltered.toCoeq 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) : j ⟶ CategoryTheory.IsCardinalFiltered.coeq f hK - CategoryTheory.IsCardinalFiltered.coeq_condition 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) (k : K) : CategoryTheory.CategoryStruct.comp (f k) (CategoryTheory.IsCardinalFiltered.coeqHom f hK) = CategoryTheory.IsCardinalFiltered.toCoeq f hK - CategoryTheory.IsCardinalFiltered.multicoequalizer 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {ι : Type v'} {j : ι → J} {k : J} (f₁ f₂ : (i : ι) → j i ⟶ k) (hι : HasCardinalLT ι κ) : ∃ l a, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f₁ i) a = CategoryTheory.CategoryStruct.comp (f₂ i) a - CategoryTheory.IsCardinalFiltered.wideSpan 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {ι : Type v'} {j : J} {k : ι → J} (f : (i : ι) → j ⟶ k i) (hι : HasCardinalLT ι κ) : ∃ m a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) (a i) = b - CategoryTheory.isCardinalFiltered_iff 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
(J : Type u) [CategoryTheory.Category.{v, u} J] (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ ↔ (∀ ⦃ι : Type w⦄ (j : ι → J), HasCardinalLT ι κ → ∃ k, ∀ (i : ι), Nonempty (j i ⟶ k)) ∧ ∀ ⦃ι : Type w⦄ ⦃j k : J⦄ (f : ι → (j ⟶ k)), HasCardinalLT ι κ → ∃ l a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) a = b - CategoryTheory.isCardinalFiltered_iff' 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] : CategoryTheory.IsCardinalFiltered J κ ↔ (∀ ⦃ι : Type w⦄ (j : ι → J), HasCardinalLT ι κ → ∃ k, ∀ (i : ι), Nonempty (j i ⟶ k)) ∧ ∀ ⦃ι : Type w⦄ ⦃j k : J⦄ (f : ι → (j ⟶ k)), HasCardinalLT ι κ → Nonempty ι → ∃ l a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) a = b - CategoryTheory.IsCardinalFiltered.coeq_condition_assoc 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] {K : Type v'} {j j' : J} (f : K → (j ⟶ j')) (hK : HasCardinalLT K κ) (k : K) {Z : J} (h : CategoryTheory.IsCardinalFiltered.coeq f hK ⟶ Z) : CategoryTheory.CategoryStruct.comp (f k) (CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.coeqHom f hK) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.IsCardinalFiltered.toCoeq f hK) h - CategoryTheory.isCardinalFiltered_iff_aux₂ 📋 Mathlib.CategoryTheory.Presentable.IsCardinalFiltered
{J : Type u} [CategoryTheory.Category.{v, u} J] {κ : Cardinal.{w}} [Fact κ.IsRegular] (h₁ : ∀ ⦃ι : Type w⦄ (j : ι → J), HasCardinalLT ι κ → ∃ k, ∀ (i : ι), Nonempty (j i ⟶ k)) (h₂ : ∀ ⦃ι : Type w⦄ ⦃j k : J⦄ (f : ι → (j ⟶ k)), HasCardinalLT ι κ → ∃ l a b, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f i) a = b) {ι : Type w} {j : ι → J} {k : J} (f₁ f₂ : (i : ι) → j i ⟶ k) (hι : HasCardinalLT ι κ) : ∃ l a, ∀ (i : ι), CategoryTheory.CategoryStruct.comp (f₁ i) a = CategoryTheory.CategoryStruct.comp (f₂ i) a - CategoryTheory.HasCardinalFilteredColimits 📋 Mathlib.CategoryTheory.Presentable.Basic
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] : Prop - CategoryTheory.IsCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] : Prop - CategoryTheory.isCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.ObjectProperty C - CategoryTheory.instHasCardinalFilteredColimitsOfHasColimitsOfSize 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v₁, u₁} C] : CategoryTheory.HasCardinalFilteredColimits C κ - CategoryTheory.instIsClosedUnderIsomorphismsIsCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] : (CategoryTheory.isCardinalPresentable C κ).IsClosedUnderIsomorphisms - CategoryTheory.Functor.IsCardinalAccessible 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] : Prop - CategoryTheory.Functor.instIsCardinalAccessibleId 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] : (CategoryTheory.Functor.id C).IsCardinalAccessible κ - CategoryTheory.isPresentable_of_isCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] : CategoryTheory.IsPresentable.{w, v₁, u₁} X - CategoryTheory.isCardinalPresentable_iff 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] (X : C) : CategoryTheory.isCardinalPresentable C κ X ↔ CategoryTheory.IsCardinalPresentable X κ - CategoryTheory.HasCardinalFilteredColimits.hasColimitsOfShape 📋 Mathlib.CategoryTheory.Presentable.Basic
(C : Type u₁) {inst✝ : CategoryTheory.Category.{v₁, u₁} C} (κ : Cardinal.{w}) {inst✝¹ : Fact κ.IsRegular} [self : CategoryTheory.HasCardinalFilteredColimits C κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.HasColimitsOfShape J C - CategoryTheory.isCardinalPresentable_of_iso 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (e : X ≅ Y) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] : CategoryTheory.IsCardinalPresentable Y κ - CategoryTheory.HasCardinalFilteredColimits.of_le 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {κ : Cardinal.{w}} [Fact κ.IsRegular] [CategoryTheory.HasCardinalFilteredColimits C κ] {κ' : Cardinal.{w}} [Fact κ'.IsRegular] (h : κ ≤ κ') : CategoryTheory.HasCardinalFilteredColimits C κ' - CategoryTheory.HasCardinalFilteredColimits.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {κ : Cardinal.{w}} [Fact κ.IsRegular] (hasColimitsOfShape : ∀ (J : Type w) [inst : CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ], CategoryTheory.Limits.HasColimitsOfShape J C := by intros; infer_instance) : CategoryTheory.HasCardinalFilteredColimits C κ - CategoryTheory.instIsCardinalPresentableObjIsCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] (X : (CategoryTheory.isCardinalPresentable C κ).FullSubcategory) : CategoryTheory.IsCardinalPresentable X.obj κ - CategoryTheory.isCardinalPresentable_of_le 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) {κ : Cardinal.{w}} [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] {κ' : Cardinal.{w}} [Fact κ'.IsRegular] (h : κ ≤ κ') : CategoryTheory.IsCardinalPresentable X κ' - CategoryTheory.Functor.instIsCardinalAccessibleOfPreservesColimitsOfSize 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.Limits.PreservesColimitsOfSize.{w, w, v₁, v₂, u₁, u₂} F] : F.IsCardinalAccessible κ - CategoryTheory.Functor.isAccessible_of_isCardinalAccessible 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] [F.IsCardinalAccessible κ] : CategoryTheory.Functor.IsAccessible.{w, v₁, v₂, u₁, u₂} F - CategoryTheory.Functor.instIsCardinalAccessibleObjConst 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] (A : C) : ((CategoryTheory.Functor.const C).obj A).IsCardinalAccessible κ - CategoryTheory.Functor.IsAccessible.exists_cardinal 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} (F : CategoryTheory.Functor C D) [self : CategoryTheory.Functor.IsAccessible.{w, v₁, v₂, u₁, u₂} F] : ∃ κ, ∃ (x : Fact κ.IsRegular), F.IsCardinalAccessible κ - CategoryTheory.Functor.IsAccessible.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} (exists_cardinal : ∃ κ, ∃ (x : Fact κ.IsRegular), F.IsCardinalAccessible κ) : CategoryTheory.Functor.IsAccessible.{w, v₁, v₂, u₁, u₂} F - CategoryTheory.isCardinalPresentable_monotone 📋 Mathlib.CategoryTheory.Presentable.Basic
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] {κ : Cardinal.{w}} [Fact κ.IsRegular] {κ' : Cardinal.{w}} [Fact κ'.IsRegular] (h : κ ≤ κ') : CategoryTheory.isCardinalPresentable C κ ≤ CategoryTheory.isCardinalPresentable C κ' - CategoryTheory.isCardinalPresentable_of_equivalence 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] {C' : Type u₃} [CategoryTheory.Category.{v₃, u₃} C'] [CategoryTheory.IsCardinalPresentable X κ] (e : C ≌ C') : CategoryTheory.IsCardinalPresentable (e.functor.obj X) κ - CategoryTheory.Functor.preservesColimitsOfShape_of_isCardinalAccessible 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] [F.IsCardinalAccessible κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J F - CategoryTheory.Functor.IsCardinalAccessible.preservesColimitOfShape 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {F : CategoryTheory.Functor C D} (κ : Cardinal.{w}) {inst✝² : Fact κ.IsRegular} [self : F.IsCardinalAccessible κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J F - CategoryTheory.isCardinalPresentable_of_isEquivalence 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] {C' : Type u₃} [CategoryTheory.Category.{v₃, u₃} C'] [CategoryTheory.IsCardinalPresentable X κ] (F : CategoryTheory.Functor C C') [F.IsEquivalence] : CategoryTheory.IsCardinalPresentable (F.obj X) κ - CategoryTheory.Functor.isCardinalAccessible_of_le 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) {κ : Cardinal.{w}} [Fact κ.IsRegular] [F.IsCardinalAccessible κ] {κ' : Cardinal.{w}} [Fact κ'.IsRegular] (h : κ ≤ κ') : F.IsCardinalAccessible κ' - CategoryTheory.isCardinalPresentable_iff_of_isEquivalence 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] {C' : Type u₃} [CategoryTheory.Category.{v₃, u₃} C'] (F : CategoryTheory.Functor C C') [F.IsEquivalence] : CategoryTheory.IsCardinalPresentable (F.obj X) κ ↔ CategoryTheory.IsCardinalPresentable X κ - CategoryTheory.Functor.IsCardinalAccessible.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {κ : Cardinal.{w}} [Fact κ.IsRegular] (preservesColimitOfShape : ∀ (J : Type w) [inst : CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ], CategoryTheory.Limits.PreservesColimitsOfShape J F := by intros; infer_instance) : F.IsCardinalAccessible κ - CategoryTheory.Functor.preservesColimitsOfShape_of_isCardinalAccessible_of_essentiallySmall 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) (κ : Cardinal.{w}) [Fact κ.IsRegular] [F.IsCardinalAccessible κ] (J : Type u₃) [CategoryTheory.Category.{v₃, u₃} J] [CategoryTheory.EssentiallySmall.{w, v₃, u₃} J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J F - CategoryTheory.instIsCardinalAccessibleObjOppositeFunctorTypeUliftCoyonedaOpOfIsCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] : (CategoryTheory.uliftCoyoneda.{t, v₁, u₁}.obj (Opposite.op X)).IsCardinalAccessible κ - CategoryTheory.isCardinalPresentable_iff_isCardinalAccessible_coyoneda_obj 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalPresentable X κ ↔ (CategoryTheory.coyoneda.obj (Opposite.op X)).IsCardinalAccessible κ - CategoryTheory.isCardinalPresentable_iff_isCardinalAccessible_uliftCoyoneda_obj 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] : CategoryTheory.IsCardinalPresentable X κ ↔ (CategoryTheory.uliftCoyoneda.{t, v₁, u₁}.obj (Opposite.op X)).IsCardinalAccessible κ - CategoryTheory.instIsCardinalPresentableObjFullSubcategoryIsCardinalPresentableι 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] (X : (CategoryTheory.isCardinalPresentable C κ).FullSubcategory) : CategoryTheory.IsCardinalPresentable ((CategoryTheory.isCardinalPresentable C κ).ι.obj X) κ - CategoryTheory.Functor.isCardinalAccessible_of_natIso 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F G : CategoryTheory.Functor C D} (e : F ≅ G) (κ : Cardinal.{w}) [Fact κ.IsRegular] [F.IsCardinalAccessible κ] : G.IsCardinalAccessible κ - CategoryTheory.preservesColimitsOfShape_of_isCardinalPresentable 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] (J : Type w) [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.preservesColimitsOfShape_of_isCardinalPresentable_of_essentiallySmall 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (κ : Cardinal.{w}) [Fact κ.IsRegular] [CategoryTheory.IsCardinalPresentable X κ] (J : Type u₃) [CategoryTheory.Category.{v₃, u₃} J] [CategoryTheory.EssentiallySmall.{w, v₃, u₃} J] [CategoryTheory.IsCardinalFiltered J κ] : CategoryTheory.Limits.PreservesColimitsOfShape J (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.Functor.instIsCardinalAccessibleComp 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (κ : Cardinal.{w}) [Fact κ.IsRegular] {E : Type u₃} [CategoryTheory.Category.{v₃, u₃} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) [F.IsCardinalAccessible κ] [G.IsCardinalAccessible κ] : (F.comp G).IsCardinalAccessible κ - CategoryTheory.IsCardinalPresentable.exists_hom_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) (f : X ⟶ c.pt) : ∃ j f', CategoryTheory.CategoryStruct.comp f' (c.ι.app j) = f - CategoryTheory.IsCardinalPresentable.exists_eq_of_isColimit' 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) {i : J} (f₁ f₂ : X ⟶ F.obj i) (hf : CategoryTheory.CategoryStruct.comp f₁ (c.ι.app i) = CategoryTheory.CategoryStruct.comp f₂ (c.ι.app i)) : ∃ j u, CategoryTheory.CategoryStruct.comp f₁ (F.map u) = CategoryTheory.CategoryStruct.comp f₂ (F.map u) - CategoryTheory.IsCardinalPresentable.exists_hom₂_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) (f g : X ⟶ c.pt) : ∃ j f' g', CategoryTheory.CategoryStruct.comp f' (c.ι.app j) = f ∧ CategoryTheory.CategoryStruct.comp g' (c.ι.app j) = g - CategoryTheory.IsCardinalPresentable.exists_eq_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_1} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.IsCardinalPresentable X κ] [CategoryTheory.EssentiallySmall.{w, v_1, u_1} J] [CategoryTheory.IsCardinalFiltered J κ] {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) {i₁ i₂ : J} (f₁ : X ⟶ F.obj i₁) (f₂ : X ⟶ F.obj i₂) (hf : CategoryTheory.CategoryStruct.comp f₁ (c.ι.app i₁) = CategoryTheory.CategoryStruct.comp f₂ (c.ι.app i₂)) : ∃ j u v, CategoryTheory.CategoryStruct.comp f₁ (F.map u) = CategoryTheory.CategoryStruct.comp f₂ (F.map v) - CategoryTheory.IsCardinalPresentable.mk 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {κ : Cardinal.{w}} [Fact κ.IsRegular] (hX : ∀ (J : Type w) [inst : CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] (F : CategoryTheory.Functor J C) (c : CategoryTheory.Limits.Cocone F) (x : CategoryTheory.Limits.IsColimit c), (∀ (g : X ⟶ c.pt), ∃ j f, CategoryTheory.CategoryStruct.comp f (c.ι.app j) = g) ∧ ∀ (j : J) (f₁ f₂ : X ⟶ F.obj j), CategoryTheory.CategoryStruct.comp f₁ (c.ι.app j) = CategoryTheory.CategoryStruct.comp f₂ (c.ι.app j) → ∃ j' a, CategoryTheory.CategoryStruct.comp f₁ (F.map a) = CategoryTheory.CategoryStruct.comp f₂ (F.map a)) : CategoryTheory.IsCardinalPresentable X κ - CategoryTheory.IsCardinalPresentable.exists_commSq_of_isColimit 📋 Mathlib.CategoryTheory.Presentable.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (κ : Cardinal.{w}) [Fact κ.IsRegular] {J : Type u_2} [CategoryTheory.Category.{v_2, u_2} J] [CategoryTheory.EssentiallySmall.{w, v_2, u_2} J] [CategoryTheory.IsCardinalFiltered J κ] {X Y : CategoryTheory.Functor J C} (f : X ⟶ Y) {c₁ : CategoryTheory.Limits.Cocone X} {c₂ : CategoryTheory.Limits.Cocone Y} (hc₁ : CategoryTheory.Limits.IsColimit c₁) (hc₂ : CategoryTheory.Limits.IsColimit c₂) (f' : c₁.pt ⟶ c₂.pt) (hf' : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c₁.ι.app j) f' = CategoryTheory.CategoryStruct.comp (f.app j) (c₂.ι.app j)) ⦃X' Y' : C⦄ ⦃t : X' ⟶ Y'⦄ ⦃l : X' ⟶ c₁.pt⦄ ⦃r : Y' ⟶ c₂.pt⦄ [CategoryTheory.IsCardinalPresentable X' κ] [CategoryTheory.IsCardinalPresentable Y' κ] (sq : CategoryTheory.CommSq t l r f') : ∃ j l' r', CategoryTheory.CategoryStruct.comp l' (c₁.ι.app j) = l ∧ CategoryTheory.CategoryStruct.comp r' (c₂.ι.app j) = r ∧ CategoryTheory.CommSq t l' r' (f.app j) - CategoryTheory.IsGrothendieckAbelian.exists_isIso_of_functor_from_monoOver 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))) (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt ⟶ X) (hf : ∀ (j : J), CategoryTheory.CategoryStruct.comp (c.ι.app j) f = (F.obj j).obj.hom) (h : CategoryTheory.Epi f) : ∃ j, CategoryTheory.IsIso (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.preservesColimit_coyoneda_obj_of_mono 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (Y : CategoryTheory.Functor J C) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) [∀ (j j' : J) (φ : j ⟶ j'), CategoryTheory.Mono (Y.map φ)] : CategoryTheory.Limits.PreservesColimit Y (CategoryTheory.coyoneda.obj (Opposite.op X)) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) [∀ (j j' : J) (φ : j ⟶ j'), CategoryTheory.Mono (Y.map φ)] {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (z : X ⟶ c.pt) : ∃ j₀ y, z = CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) (j₀ : J) (y₁ y₂ : X ⟶ Y.obj j₀) (hy : CategoryTheory.CategoryStruct.comp y₁ (c.ι.app j₀) = CategoryTheory.CategoryStruct.comp y₂ (c.ι.app j₀)) : ∃ j φ, CategoryTheory.CategoryStruct.comp y₁ (Y.map φ) = CategoryTheory.CategoryStruct.comp y₂ (Y.map φ) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivity₀ 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (hc : CategoryTheory.Limits.IsColimit c) {κ : Cardinal.{w}} [hκ : Fact κ.IsRegular] [CategoryTheory.IsCardinalFiltered J κ] (hXκ : HasCardinalLT (CategoryTheory.Subobject X) κ) {j₀ : J} (y : X ⟶ Y.obj j₀) (hy : CategoryTheory.CategoryStruct.comp y (c.ι.app j₀) = 0) : ∃ j φ, CategoryTheory.CategoryStruct.comp y (Y.map φ) = 0 - 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
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