Loogle!
Result
Found 274 declarations mentioning Cardinal.ord. Of these, only the first 200 are shown.
- Cardinal.ord 📋 Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{u}) : Ordinal.{u} - Cardinal.ord_injective 📋 Mathlib.SetTheory.Ordinal.Basic
: Function.Injective Cardinal.ord - Cardinal.ord_aleph0 📋 Mathlib.SetTheory.Ordinal.Basic
: Cardinal.aleph0.ord = Ordinal.omega0 - Cardinal.isNormal_ord 📋 Mathlib.SetTheory.Ordinal.Basic
: Order.IsNormal Cardinal.ord - Cardinal.card_ord 📋 Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{u_1}) : c.ord.card = c - Cardinal.mk_ord_toType 📋 Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{u_1}) : Cardinal.mk c.ord.ToType = c - Cardinal.lift_ord 📋 Mathlib.SetTheory.Ordinal.Basic
(c : Cardinal.{v}) : Ordinal.lift.{u, v} c.ord = (Cardinal.lift.{u, v} c).ord - Cardinal.ord_mono 📋 Mathlib.SetTheory.Ordinal.Basic
: Monotone Cardinal.ord - Cardinal.ord_strictMono 📋 Mathlib.SetTheory.Ordinal.Basic
: StrictMono Cardinal.ord - Cardinal.gc_ord_card 📋 Mathlib.SetTheory.Ordinal.Basic
: GaloisConnection Cardinal.ord Ordinal.card - Cardinal.gciOrdCard 📋 Mathlib.SetTheory.Ordinal.Basic
: GaloisCoinsertion Cardinal.ord Ordinal.card - Cardinal.ord_eq_omega0 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : a.ord = Ordinal.omega0 ↔ a = Cardinal.aleph0 - Cardinal.ord_card_le 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : o.card.ord ≤ o - Cardinal.ord_inj 📋 Mathlib.SetTheory.Ordinal.Basic
{c₁ c₂ : Cardinal.{u_1}} : c₁.ord = c₂.ord ↔ c₁ = c₂ - Cardinal.nonempty_ord_toType 📋 Mathlib.SetTheory.Ordinal.Basic
{c : Cardinal.{u_1}} (h : c ≠ 0) : Nonempty c.ord.ToType - Cardinal.ord_natCast 📋 Mathlib.SetTheory.Ordinal.Basic
(n : ℕ) : (↑n).ord = ↑n - Cardinal.ord_one 📋 Mathlib.SetTheory.Ordinal.Basic
: Cardinal.ord 1 = 1 - Cardinal.ord_zero 📋 Mathlib.SetTheory.Ordinal.Basic
: Cardinal.ord 0 = 0 - Cardinal.omega0_le_ord 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : Ordinal.omega0 ≤ a.ord ↔ Cardinal.aleph0 ≤ a - Cardinal.ord_le_omega0 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : a.ord ≤ Ordinal.omega0 ↔ a ≤ Cardinal.aleph0 - Cardinal.card_le_of_le_ord 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} {c : Cardinal.{u_1}} (ho : o ≤ c.ord) : o.card ≤ c - Cardinal.lt_ord_succ_card 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) : o < (Order.succ o.card).ord - Cardinal.bddAbove_ord_image_iff 📋 Mathlib.SetTheory.Ordinal.Basic
{s : Set Cardinal.{u_1}} : BddAbove (Cardinal.ord '' s) ↔ BddAbove s - Cardinal.ord_le 📋 Mathlib.SetTheory.Ordinal.Basic
{c : Cardinal.{u_1}} {o : Ordinal.{u_1}} : c.ord ≤ o ↔ c ≤ o.card - Cardinal.ord_le_ord 📋 Mathlib.SetTheory.Ordinal.Basic
{c₁ c₂ : Cardinal.{u_1}} : c₁.ord ≤ c₂.ord ↔ c₁ ≤ c₂ - Cardinal.omega0_lt_ord 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : Ordinal.omega0 < a.ord ↔ Cardinal.aleph0 < a - Cardinal.ord_eq_one 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : a.ord = 1 ↔ a = 1 - Cardinal.ord_eq_zero 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : a.ord = 0 ↔ a = 0 - Cardinal.ord_le_type 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} (r : α → α → Prop) [h : IsWellOrder α r] : (Cardinal.mk α).ord ≤ Ordinal.type r - Cardinal.ord_lt_omega0 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : a.ord < Ordinal.omega0 ↔ a < Cardinal.aleph0 - Cardinal.lt_ord 📋 Mathlib.SetTheory.Ordinal.Basic
{c : Cardinal.{u_1}} {o : Ordinal.{u_1}} : o < c.ord ↔ o.card < c - Cardinal.ord_lt_ord 📋 Mathlib.SetTheory.Ordinal.Basic
{c₁ c₂ : Cardinal.{u_1}} : c₁.ord < c₂.ord ↔ c₁ < c₂ - Cardinal.exists_ord_eq 📋 Mathlib.SetTheory.Ordinal.Basic
(α : Type u_1) : ∃ r, ∃ (x : IsWellOrder α r), (Cardinal.mk α).ord = Ordinal.type r - Cardinal.ord_eq 📋 Mathlib.SetTheory.Ordinal.Basic
(α : Type u_1) : ∃ r, ∃ (x : IsWellOrder α r), (Cardinal.mk α).ord = Ordinal.type r - Cardinal.ord_ofNat 📋 Mathlib.SetTheory.Ordinal.Basic
(n : ℕ) [n.AtLeastTwo] : (OfNat.ofNat n).ord = OfNat.ofNat n - Cardinal.card_le_iff 📋 Mathlib.SetTheory.Ordinal.Basic
{o : Ordinal.{u_1}} {c : Cardinal.{u_1}} : o.card ≤ c ↔ o < (Order.succ c).ord - Ordinal.ord_mk_le_type 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} (r : α → α → Prop) [IsWellOrder α r] (s : Set α) : (Cardinal.mk ↑s).ord ≤ Ordinal.type r - Cardinal.le_ord_iff_card_le_of_lt_aleph0 📋 Mathlib.SetTheory.Ordinal.Basic
(o : Ordinal.{u_1}) {c : Cardinal.{u_1}} (hc : c < Cardinal.aleph0) : o ≤ c.ord ↔ o.card ≤ c - Cardinal.ord_pos 📋 Mathlib.SetTheory.Ordinal.Basic
{a : Cardinal.{u_1}} : 0 < a.ord ↔ 0 < a - Ordinal.ord_mk_lt_type 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} (r : α → α → Prop) [IsWellOrder α r] {s : Set α} (hfin : s.Finite) (h : sᶜ.Nonempty) : (Cardinal.mk ↑s).ord < Ordinal.type r - 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 - Cardinal.ord_eq_Inf 📋 Mathlib.SetTheory.Ordinal.Basic
(α : Type u) : (Cardinal.mk α).ord = ⨅ r, Ordinal.type ↑r - Cardinal.ord_eq_iInf 📋 Mathlib.SetTheory.Ordinal.Basic
(α : Type u) : (Cardinal.mk α).ord = ⨅ r, Ordinal.type ↑r - Cardinal.card_typein_lt 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} {r : α → α → Prop} [IsWellOrder α r] (x : α) (h : (Cardinal.mk α).ord = Ordinal.type r) : ((Ordinal.typein r).toRelEmbedding x).card < Cardinal.mk α - Cardinal.exists_ord_eq_type_lt 📋 Mathlib.SetTheory.Ordinal.Basic
(α : Type u_1) : ∃ x, ∃ (x_1 : WellFoundedLT α), (Cardinal.mk α).ord = Ordinal.type fun x1 x2 => x1 < x2 - Cardinal.mk_Iio_lt 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} [LinearOrder α] [WellFoundedLT α] (i : α) (h : (Cardinal.mk α).ord = Ordinal.type fun x1 x2 => x1 < x2) : Cardinal.mk ↑(Set.Iio i) < Cardinal.mk α - Cardinal.mk_Ioi_lt 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u_1} [LinearOrder α] [WellFoundedGT α] (i : α) (h : (Cardinal.mk α).ord = Ordinal.type fun x1 x2 => x1 < x2) : Cardinal.mk ↑(Set.Ioi i) < Cardinal.mk α - Ordinal.not_lt_enum_ord_mk_min_compl 📋 Mathlib.SetTheory.Ordinal.Basic
{α : Type u} (r : α → α → Prop) [IsWellOrder α r] {s : Set α} (hfin : s.Finite) (h : sᶜ.Nonempty) : ¬r ((Ordinal.enum r) ⟨(Cardinal.mk ↑s).ord, ⋯⟩) (⋯.min sᶜ h) - 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 - Cardinal.instNonemptyToTypeOrdAleph0 📋 Mathlib.SetTheory.Ordinal.Arithmetic
: Nonempty Cardinal.aleph0.ord.ToType - Cardinal.isSuccLimit_ord 📋 Mathlib.SetTheory.Ordinal.Arithmetic
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Order.IsSuccLimit c.ord - 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.sSup_ord 📋 Mathlib.SetTheory.Ordinal.Family
(s : Set Cardinal.{u_3}) : (sSup s).ord = sSup (Cardinal.ord '' s) - Ordinal.iSup_ord 📋 Mathlib.SetTheory.Ordinal.Family
{ι : Sort u_3} (f : ι → Cardinal.{u_4}) : (⨆ i, f i).ord = ⨆ i, (f i).ord - Ordinal.sInf_compl_lt_ord_succ 📋 Mathlib.SetTheory.Ordinal.Family
{ι : Type u} (f : ι → Ordinal.{u}) : sInf (Set.range f)ᶜ < (Order.succ (Cardinal.mk ι)).ord - Ordinal.sInf_compl_lt_lift_ord_succ 📋 Mathlib.SetTheory.Ordinal.Family
{ι : Type u} (f : ι → Ordinal.{max u v}) : sInf (Set.range f)ᶜ < Ordinal.lift.{v, u} (Order.succ (Cardinal.mk ι)).ord - Cardinal.ord_univ 📋 Mathlib.SetTheory.Ordinal.Univ
: Cardinal.univ.{u, v}.ord = Ordinal.univ.{u, v} - Cardinal.ord_cardinalMk 📋 Mathlib.SetTheory.Cardinal.Cofinality.Enum
{α : Type u_1} [LinearOrder α] [WellFoundedLT α] [IsRegularCardinalOrder α] : (Cardinal.mk α).ord = Ordinal.type fun x1 x2 => x1 < x2 - Order.ord_cof_eq_type_lt 📋 Mathlib.SetTheory.Cardinal.Cofinality.Enum
{α : Type u_1} [LinearOrder α] [WellFoundedLT α] [IsRegularCardinalOrder α] : (Order.cof α).ord = Ordinal.type fun x1 x2 => x1 < x2 - IsRegularCardinalOrder.mk 📋 Mathlib.SetTheory.Cardinal.Cofinality.Enum
{α : Type u_2} [LinearOrder α] [WellFoundedLT α] (type_lt_le_ord_cof : (Ordinal.type fun x1 x2 => x1 < x2) ≤ (Order.cof α).ord) : IsRegularCardinalOrder α - IsRegularCardinalOrder.type_lt_le_ord_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Enum
{α : Type u_2} {inst✝ : LinearOrder α} {inst✝¹ : WellFoundedLT α} [self : IsRegularCardinalOrder α] : (Ordinal.type fun x1 x2 => x1 < x2) ≤ (Order.cof α).ord - Ordinal.isInitial_ord 📋 Mathlib.SetTheory.Cardinal.Aleph
(c : Cardinal.{u_1}) : c.ord.IsInitial - Cardinal.le_beth_ord 📋 Mathlib.SetTheory.Cardinal.Aleph
(c : Cardinal.{u_1}) : c ≤ Cardinal.beth c.ord - Cardinal.le_preBeth_ord 📋 Mathlib.SetTheory.Cardinal.Aleph
(c : Cardinal.{u_1}) : c ≤ Cardinal.preBeth c.ord - Ordinal.IsInitial.ord_card 📋 Mathlib.SetTheory.Cardinal.Aleph
{o : Ordinal.{u_1}} (h : o.IsInitial) : o.card.ord = o - Ordinal.IsInitial.le_ord_iff_card_le 📋 Mathlib.SetTheory.Cardinal.Aleph
{o : Ordinal.{u_1}} (ho : o.IsInitial) (c : Cardinal.{u_1}) : o ≤ c.ord ↔ o.card ≤ c - Cardinal.le_aleph_ord 📋 Mathlib.SetTheory.Cardinal.Aleph
(c : Cardinal.{u_1}) : c ≤ Cardinal.aleph c.ord - Cardinal.le_preAleph_ord 📋 Mathlib.SetTheory.Cardinal.Aleph
(c : Cardinal.{u_1}) : c ≤ Cardinal.preAleph c.ord - Cardinal.ord_aleph 📋 Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : (Cardinal.aleph o).ord = Ordinal.omega o - Cardinal.ord_preAleph 📋 Mathlib.SetTheory.Cardinal.Aleph
(o : Ordinal.{u_1}) : (Cardinal.preAleph o).ord = Ordinal.preOmega o - Ordinal.isInitialIso_symm_apply_coe 📋 Mathlib.SetTheory.Cardinal.Aleph
(x : Cardinal.{u_1}) : ↑((RelIso.symm Ordinal.isInitialIso) x) = x.ord - Cardinal.mk_Iic_lt 📋 Mathlib.SetTheory.Cardinal.Arithmetic
{α : Type u_1} [LinearOrder α] [WellFoundedLT α] (i : α) (h : (Cardinal.mk α).ord = Ordinal.type fun x1 x2 => x1 < x2) (hα : Cardinal.aleph0 ≤ Cardinal.mk α) : Cardinal.mk ↑(Set.Iic i) < Cardinal.mk α - Cardinal.mk_Ici_lt 📋 Mathlib.SetTheory.Cardinal.Arithmetic
{α : Type u_1} [LinearOrder α] [WellFoundedGT α] (i : α) (h : (Cardinal.mk α).ord = Ordinal.type fun x1 x2 => x1 < x2) (hα : Cardinal.aleph0 ≤ Cardinal.mk α) : Cardinal.mk ↑(Set.Ici i) < Cardinal.mk α - Ordinal.cof_ord_le 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(c : Cardinal.{u_1}) : c.ord.cof ≤ c - Ordinal.cof_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : o.cof.ord.cof = o.cof - Ordinal.cof_ord_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : o.cof.ord.cof = o.cof - Ordinal.ord_cof_le 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : o.cof.ord ≤ o - Cardinal.lt_power_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : c < c ^ c.ord.cof - Cardinal.lt_power_cof_ord 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : c < c ^ c.ord.cof - Cardinal.mk_subset_mk_lt_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{α : Type u_1} (h : (Cardinal.mk α).IsStrongPrelimit) : Cardinal.mk { s // Cardinal.mk ↑s < (Cardinal.mk α).ord.cof } = Cardinal.mk α - Cardinal.mk_bounded_subset 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{α : Type u_1} (h : (Cardinal.mk α).IsStrongPrelimit) {r : α → α → Prop} [IsWellOrder α r] (hr : (Cardinal.mk α).ord = Ordinal.type r) : Cardinal.mk { s // Set.Bounded r s } = Cardinal.mk α - Ordinal.exists_blsub_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : ∃ f, o.cof.ord.blsub f = o - Cardinal.lt_cof_ord_power 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{a b : Cardinal.{u_1}} (ha : Cardinal.aleph0 ≤ a) (hb : 1 < b) : a < (b ^ a).ord.cof - Cardinal.lt_cof_power 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{a b : Cardinal.{u_1}} (ha : Cardinal.aleph0 ≤ a) (hb : 1 < b) : a < (b ^ a).ord.cof - Order.cof_ord_cof 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(α : Type u_1) [LinearOrder α] [WellFoundedLT α] : (Order.cof α).ord.cof = Order.cof α - Ordinal.iSup_lt_lift 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ι : Type u} {f : ι → Cardinal.{max u v}} {c : Cardinal.{max u v}} (hι : Cardinal.lift.{v, u} (Cardinal.mk ι) < c.ord.cof) (hf : ∀ (i : ι), f i < c) : iSup f < c - Cardinal.iSup_lt_of_lt_cof_ord 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{α : Type u} {f : α → Cardinal.{u}} {a : Cardinal.{u}} (ha : Cardinal.mk α < a.ord.cof) (hf : ∀ (i : α), f i < a) : ⨆ i, f i < a - Ordinal.iSup_lt 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{α : Type u} {f : α → Cardinal.{u}} {a : Cardinal.{u}} (ha : Cardinal.mk α < a.ord.cof) (hf : ∀ (i : α), f i < a) : ⨆ i, f i < a - Cardinal.lift_iSup_lt_of_lt_cof_ord 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{β : Type v} {f : β → Cardinal.{u}} {a : Cardinal.{u}} (ha : Cardinal.lift.{u, v} (Cardinal.mk β) < (Cardinal.lift.{v, u} a).ord.cof) (hf : ∀ (i : β), f i < a) : ⨆ i, f i < a - Cardinal.sSup_lt_of_lt_cof_ord 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{s : Set Cardinal.{u}} {a : Cardinal.{u}} (ha : Cardinal.mk ↑s < (Cardinal.lift.{u + 1, u} a).ord.cof) (hs : ∀ i ∈ s, i < a) : sSup s < a - Ordinal.exists_ord_cof_eq 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(α : Type u) [LinearOrder α] [WellFoundedLT α] : ∃ s, IsCofinal s ∧ (Ordinal.type fun x1 x2 => x1 < x2) = (Order.cof α).ord - Ordinal.ord_cof_eq 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(α : Type u) [LinearOrder α] [WellFoundedLT α] : ∃ s, IsCofinal s ∧ (Ordinal.type fun x1 x2 => x1 < x2) = (Order.cof α).ord - Ordinal.exists_ord_cof_eq_of_isCofinal 📋 Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{α : Type u} [LinearOrder α] [WellFoundedLT α] {s : Set α} (hs : IsCofinal s) : ∃ t ⊆ s, IsCofinal t ∧ (Ordinal.type fun x1 x2 => x1 < x2) = (Order.cof α).ord - Ordinal.isPrincipal_add_ord 📋 Mathlib.SetTheory.Cardinal.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Ordinal.IsPrincipal (fun x1 x2 => x1 + x2) c.ord - Ordinal.principal_add_ord 📋 Mathlib.SetTheory.Cardinal.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Ordinal.IsPrincipal (fun x1 x2 => x1 + x2) c.ord - Ordinal.isPrincipal_opow_ord 📋 Mathlib.SetTheory.Cardinal.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Ordinal.IsPrincipal (fun x1 x2 => x1 ^ x2) c.ord - Ordinal.principal_opow_ord 📋 Mathlib.SetTheory.Cardinal.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Ordinal.IsPrincipal (fun x1 x2 => x1 ^ x2) c.ord - Ordinal.isPrincipal_mul_ord 📋 Mathlib.SetTheory.Cardinal.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Ordinal.IsPrincipal (fun x1 x2 => x1 * x2) c.ord - Ordinal.principal_mul_ord 📋 Mathlib.SetTheory.Cardinal.Ordinal
{c : Cardinal.{u_1}} (hc : Cardinal.aleph0 ≤ c) : Ordinal.IsPrincipal (fun x1 x2 => x1 * x2) c.ord - Ordinal.IsFundamentalSequence.cof_eq 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{a o : Ordinal.{u}} {f : (b : Ordinal.{u}) → b < o → Ordinal.{u}} (hf : a.IsFundamentalSequence o f) : a.cof.ord = o - Ordinal.IsFundamentalSeq.id 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{o : Ordinal.{u_1}} (ho : o ≤ o.cof.ord) : Ordinal.IsFundamentalSeq id - Ordinal.IsFundamentalSequence.id_of_le_cof 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{o : Ordinal.{u}} (h : o ≤ o.cof.ord) : o.IsFundamentalSequence o fun a x => a - Ordinal.IsFundamentalSeq.ord_cof 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{a o : Ordinal.{u_1}} {f : ↑(Set.Iio a) → ↑(Set.Iio o)} (hf : Ordinal.IsFundamentalSeq f) : o.cof.ord = a - Ordinal.IsFundamentalSeq.le_ord_cof 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{a o : Ordinal.{u_1}} {f : ↑(Set.Iio a) → ↑(Set.Iio o)} (self : Ordinal.IsFundamentalSeq f) : a ≤ o.cof.ord - Ordinal.exists_fundamental_sequence 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
(a : Ordinal.{u}) : ∃ f, a.IsFundamentalSequence a.cof.ord f - Ordinal.exists_isFundamentalSeq 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{a o : Ordinal.{u_1}} (ha : o.cof.ord = a) : ∃ f, Ordinal.IsFundamentalSeq f - Ordinal.IsFundamentalSequence.ord_cof 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{a o : Ordinal.{u}} {f : (b : Ordinal.{u}) → b < o → Ordinal.{u}} (hf : a.IsFundamentalSequence o f) : a.IsFundamentalSequence a.cof.ord fun i hi => f i ⋯ - Ordinal.IsFundamentalSeq.mk 📋 Mathlib.SetTheory.Ordinal.FundamentalSequence
{a o : Ordinal.{u_1}} {f : ↑(Set.Iio a) → ↑(Set.Iio o)} (le_ord_cof : a ≤ o.cof.ord) (strictMono : StrictMono f) (isCofinal_range : IsCofinal (Set.range f)) : Ordinal.IsFundamentalSeq f - Cardinal.IsInaccessible.beth_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Cardinal.beth c.ord = c - Cardinal.IsInaccessible.preBeth_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Cardinal.preBeth c.ord = 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.IsSingular.cof_ord_ne 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (self : c.IsSingular) : c.ord.cof ≠ c - Cardinal.IsInaccessible.le_cof_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (self : c.IsInaccessible) : c ≤ c.ord.cof - Cardinal.IsRegular.le_cof_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (self : c.IsRegular) : c ≤ c.ord.cof - Cardinal.IsSingular.cof_ord_lt 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsSingular) : c.ord.cof < c - Cardinal.IsSingular.mk 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (aleph0_le : Cardinal.aleph0 ≤ c) (cof_ord_ne : c.ord.cof ≠ c) : c.IsSingular - 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.isSingular_iff 📋 Mathlib.SetTheory.Cardinal.Regular
(c : Cardinal.{u_1}) : c.IsSingular ↔ Cardinal.aleph0 ≤ c ∧ c.ord.cof ≠ c - Cardinal.isRegular_iff 📋 Mathlib.SetTheory.Cardinal.Regular
(c : Cardinal.{u_1}) : c.IsRegular ↔ Cardinal.aleph0 ≤ c ∧ c ≤ c.ord.cof - Cardinal.IsRegular.ord_pos 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (H : c.IsRegular) : 0 < c.ord - Cardinal.IsInaccessible.mk 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (aleph0_lt : Cardinal.aleph0 < c) (le_cof_ord : c ≤ c.ord.cof) (isStrongPrelimit : c.IsStrongPrelimit) : c.IsInaccessible - Cardinal.IsInaccessible.aleph_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Cardinal.aleph c.ord = c - Cardinal.IsInaccessible.preAleph_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Cardinal.preAleph c.ord = 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.IsInaccessible.omega_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Ordinal.omega c.ord = c.ord - Cardinal.IsInaccessible.preAleph_symm_eq_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Cardinal.preAleph.symm c = c.ord - Cardinal.IsInaccessible.preOmega_ord 📋 Mathlib.SetTheory.Cardinal.Regular
{c : Cardinal.{u_1}} (hc : c.IsInaccessible) : Ordinal.preOmega c.ord = c.ord - 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.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.infinite_pigeonhole 📋 Mathlib.SetTheory.Cardinal.Pigeonhole
{β α : Type u} (f : β → α) (h₁ : Cardinal.aleph0 ≤ Cardinal.mk β) (h₂ : Cardinal.mk α < (Cardinal.mk β).ord.cof) : ∃ a, Cardinal.mk ↑(f ⁻¹' {a}) = Cardinal.mk β - Cardinal.infinite_pigeonhole_card 📋 Mathlib.SetTheory.Cardinal.Pigeonhole
{β α : Type u} (f : β → α) (θ : Cardinal.{u}) (hθ : θ ≤ Cardinal.mk β) (h₁ : Cardinal.aleph0 ≤ θ) (h₂ : Cardinal.mk α < θ.ord.cof) : ∃ a, θ ≤ Cardinal.mk ↑(f ⁻¹' {a}) - Cardinal.infinite_pigeonhole_set 📋 Mathlib.SetTheory.Cardinal.Pigeonhole
{β α : Type u} {s : Set β} (f : ↑s → α) (θ : Cardinal.{u}) (hθ : θ ≤ Cardinal.mk ↑s) (h₁ : Cardinal.aleph0 ≤ θ) (h₂ : Cardinal.mk α < θ.ord.cof) : ∃ a t, ∃ (h : t ⊆ s), θ ≤ Cardinal.mk ↑t ∧ ∀ ⦃x : β⦄ (hx : x ∈ t), f ⟨x, ⋯⟩ = a - 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.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))
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 69fae59