Loogle!
Result
Found 112 declarations mentioning Ordinal.cof.
- Ordinal.cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : Cardinal.{u} - Ordinal.cof_omega0 ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
: Ordinal.omega0.cof = Cardinal.aleph0 - Ordinal.cof_univ ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
: Ordinal.univ.{u, v}.cof = Cardinal.univ.{u, v} - Ordinal.cof_le_card ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : o.cof โค o.card - 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.lift_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : Cardinal.lift.{v, u} o.cof = (Ordinal.lift.{v, u} o).cof - Ordinal.cof_lsub_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} (f : ฮน โ Ordinal.{u}) : (Ordinal.lsub f).cof โค Cardinal.mk ฮน - Ordinal.ord_cof_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : o.cof.ord โค o - Ordinal.cof_lsub_le_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} (f : ฮน โ Ordinal.{max u v}) : (Ordinal.lsub f).cof โค Cardinal.lift.{v, u} (Cardinal.mk ฮน) - Ordinal.aleph0_le_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : Cardinal.aleph0 โค o.cof โ Order.IsSuccLimit o - Ordinal.cof_one ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
: Ordinal.cof 1 = 1 - Ordinal.cof_zero ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
: Ordinal.cof 0 = 0 - Ordinal.cof_le_of_isNormal ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{f : Ordinal.{u_1} โ Ordinal.{u_1}} (hf : Order.IsNormal f) (a : Ordinal.{u_1}) : a.cof โค (f a).cof - Ordinal.cof_succ ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : (Order.succ o).cof = 1 - Ordinal.le_cof_map_of_isNormal ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{f : Ordinal.{u_1} โ Ordinal.{u_1}} (hf : Order.IsNormal f) (a : Ordinal.{u_1}) : a.cof โค (f a).cof - Ordinal.cof_blsub_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} (f : (a : Ordinal.{u}) โ a < o โ Ordinal.{u}) : (o.blsub f).cof โค o.card - Ordinal.cof_eq_zero ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : o.cof = 0 โ o = 0 - Ordinal.cof_blsub_le_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} (f : (a : Ordinal.{u}) โ a < o โ Ordinal.{max u v}) : (o.blsub f).cof โค Cardinal.lift.{v, u} o.card - Ordinal.cof_eq_of_isNormal ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{f : Ordinal.{u_1} โ Ordinal.{u_1}} (hf : Order.IsNormal f) {a : Ordinal.{u_1}} (ha : Order.IsSuccLimit a) : (f a).cof = a.cof - Ordinal.cof_map_of_isNormal ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{f : Ordinal.{u_1} โ Ordinal.{u_1}} (hf : Order.IsNormal f) {a : Ordinal.{u_1}} (ha : Order.IsSuccLimit a) : (f a).cof = a.cof - Ordinal.exists_lsub_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : โ ฮน f, Ordinal.lsub f = o โง Cardinal.mk ฮน = o.cof - Ordinal.aleph0_le_cof_iff ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : Cardinal.aleph0 โค o.cof โ 1 < o.cof - Ordinal.cof_lt_aleph0_iff ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : o.cof < Cardinal.aleph0 โ o.cof โค 1 - Ordinal.one_lt_cof_iff ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : 1 < o.cof โ Order.IsSuccLimit o - Ordinal.cof_add_one ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : (o + 1).cof = 1 - Ordinal.le_cof_iff_lsub ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {a : Cardinal.{u}} : a โค o.cof โ โ {ฮน : Type u} (f : ฮน โ Ordinal.{u}), Ordinal.lsub f = o โ a โค Cardinal.mk ฮน - Ordinal.cof_add ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(a : Ordinal.{u_1}) {b : Ordinal.{u_1}} (hb : b โ 0) : (a + b).cof = b.cof - 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 - Ordinal.cof_eq_one_iff ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : o.cof = 1 โ o โ Set.range Order.succ - 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 ฮฑ - Ordinal.cof_pos ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} : 0 < o.cof โ 0 < o - Ordinal.le_cof_iff_blsub ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{b : Ordinal.{u}} {a : Cardinal.{u}} : a โค b.cof โ โ {o : Ordinal.{u}} (f : (a : Ordinal.{u}) โ a < o โ Ordinal.{u}), o.blsub f = b โ a โค o.card - Ordinal.cof_Iio ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : Order.cof โ(Set.Iio o) = (Ordinal.lift.{u + 1, u} o).cof - Ordinal.exists_blsub_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : โ f, o.cof.ord.blsub f = o - Ordinal.lsub_lt_ord ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} {f : ฮน โ Ordinal.{u}} {c : Ordinal.{u}} (hฮน : Cardinal.mk ฮน < c.cof) : (โ (i : ฮน), f i < c) โ Ordinal.lsub f < c - Ordinal.cof_toType ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u_1}) : Order.cof o.ToType = o.cof - Ordinal.lsub_lt_ord_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} {f : ฮน โ Ordinal.{max u v}} {c : Ordinal.{max u v}} (hฮน : Cardinal.lift.{v, u} (Cardinal.mk ฮน) < c.cof) (hf : โ (i : ฮน), f i < c) : Ordinal.lsub f < c - Ordinal.cof_iSup_add_one_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฑ : Type u} (f : ฮฑ โ Ordinal.{u}) : (โจ i, f i + 1).cof โค Cardinal.mk ฮฑ - Ordinal.cof_mul ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{a b : Ordinal.{u_1}} (ha : a โ 0) (hb : Order.IsSuccPrelimit b) : (a * b).cof = b.cof - 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 - Ordinal.cof_eq_sInf_lsub ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(o : Ordinal.{u}) : o.cof = sInf {a | โ ฮน f, Ordinal.lsub f = o โง Cardinal.mk ฮน = a} - Ordinal.cof_lift_iSup_add_one_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฒ : Type v} [Small.{u, v} ฮฒ] (f : ฮฒ โ Ordinal.{u}) : (Ordinal.lift.{v, u} (โจ i, f i + 1)).cof โค Cardinal.lift.{u, v} (Cardinal.mk ฮฒ) - Ordinal.cof_bsup_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) โ a < o โ Ordinal.{u}} : (โ (i : Ordinal.{u}) (h : i < o), f i h < o.bsup f) โ (o.bsup f).cof โค o.card - Ordinal.cof_omega ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} (ho : Order.IsSuccLimit o) : (Ordinal.omega o).cof = o.cof - Ordinal.cof_bsup_le_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) โ a < o โ Ordinal.{max u v}} (H : โ (i : Ordinal.{u}) (h : i < o), f i h < o.bsup f) : (o.bsup f).cof โค Cardinal.lift.{v, u} o.card - Ordinal.cof_preOmega ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} (ho : Order.IsSuccPrelimit o) : (Ordinal.preOmega o).cof = o.cof - Order.cof_ord_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(ฮฑ : Type u_1) [LinearOrder ฮฑ] [WellFoundedLT ฮฑ] : (Order.cof ฮฑ).ord.cof = Order.cof ฮฑ - Ordinal.cof_eq' ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฑ : Type u} (r : ฮฑ โ ฮฑ โ Prop) [H : IsWellOrder ฮฑ r] (h : Order.IsSuccLimit (Ordinal.type r)) : โ S, (โ (a : ฮฑ), โ b โ S, r a b) โง Cardinal.mk โS = (Ordinal.type r).cof - Ordinal.cof_iSup_le ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u_1} {f : ฮน โ Ordinal.{u_1}} (H : โ (i : ฮน), f i < iSup f) : (iSup f).cof โค Cardinal.mk ฮน - Ordinal.cof_iSup_le_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} {f : ฮน โ Ordinal.{max u v}} (H : โ (i : ฮน), f i < iSup f) : (iSup f).cof โค Cardinal.lift.{v, u} (Cardinal.mk ฮน) - Ordinal.iSup_lt_ord_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} {f : ฮน โ Ordinal.{max u v}} {c : Ordinal.{max u v}} (hฮน : Cardinal.lift.{v, u} (Cardinal.mk ฮน) < c.cof) (hf : โ (i : ฮน), f i < c) : iSup f < c - 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 - Ordinal.iSup_lt_of_lt_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฑ : Type u} {f : ฮฑ โ Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.mk ฮฑ < a.cof) (hf : โ (i : ฮฑ), f i < a) : โจ i, f i < a - Ordinal.iSup_lt_ord ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฑ : Type u} {f : ฮฑ โ Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.mk ฮฑ < a.cof) (hf : โ (i : ฮฑ), f i < a) : โจ i, f i < a - 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 - Ordinal.lift_iSup_lt_of_lt_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฒ : Type v} {f : ฮฒ โ Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.lift.{u, v} (Cardinal.mk ฮฒ) < (Ordinal.lift.{v, u} a).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 - Ordinal.nfp_lt_ord ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{f : Ordinal.{u_1} โ Ordinal.{u_1}} {c : Ordinal.{u_1}} (hc : Cardinal.aleph0 < c.cof) (hf : โ i < c, f i < c) {a : Ordinal.{u_1}} : a < c โ Ordinal.nfp f a < c - Ordinal.blsub_lt_ord ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) โ a < o โ Ordinal.{u}} {c : Ordinal.{u}} (ho : o.card < c.cof) (hf : โ (i : Ordinal.{u}) (hi : i < o), f i hi < c) : o.blsub f < c - Ordinal.bsup_lt_ord ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) โ a < o โ Ordinal.{u}} {c : Ordinal.{u}} (ho : o.card < c.cof) : (โ (i : Ordinal.{u}) (hi : i < o), f i hi < c) โ o.bsup f < c - Ordinal.blsub_lt_ord_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) โ a < o โ Ordinal.{max u v}} {c : Ordinal.{max u v}} (ho : Cardinal.lift.{v, u} o.card < c.cof) (hf : โ (i : Ordinal.{u}) (hi : i < o), f i hi < c) : o.blsub f < c - Ordinal.bsup_lt_ord_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u}} {f : (a : Ordinal.{u}) โ a < o โ Ordinal.{max u v}} {c : Ordinal.{max u v}} (ho : Cardinal.lift.{v, u} o.card < c.cof) (hf : โ (i : Ordinal.{u}) (hi : i < o), f i hi < c) : o.bsup f < c - Ordinal.cof_eq_aleph0_of_isSuccLimit ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{o : Ordinal.{u_1}} (ho : Order.IsSuccLimit o) (ho' : o < Ordinal.omega 1) : o.cof = Cardinal.aleph0 - Ordinal.sSup_lt_of_lt_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{s : Set Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.mk โs < (Ordinal.lift.{u + 1, u} a).cof) (hs : โ i โ s, i < a) : sSup s < 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.iSup_add_one_lt_of_lt_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฑ : Type u} {f : ฮฑ โ Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.mk ฮฑ < a.cof) (hf : โ (i : ฮฑ), f i < a) : โจ i, f i + 1 < a - Ordinal.lift_iSup_add_one_lt_of_lt_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฒ : Type v} {f : ฮฒ โ Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.lift.{u, v} (Cardinal.mk ฮฒ) < (Ordinal.lift.{v, u} a).cof) (hf : โ (i : ฮฒ), f i < a) : โจ i, f i + 1 < a - Ordinal.cof_iSup_add_one ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮณ : Type u} [LinearOrder ฮณ] {f : ฮณ โ Ordinal.{u}} (hf : StrictMono f) : (โจ i, f i + 1).cof = Order.cof ฮณ - Ordinal.nfpFamily_lt_ord ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} {f : ฮน โ Ordinal.{u} โ Ordinal.{u}} {c : Ordinal.{u}} (hc : Cardinal.aleph0 < c.cof) (hc' : Cardinal.mk ฮน < c.cof) (hf : โ (i : ฮน), โ b < c, f i b < c) {a : Ordinal.{u}} : a < c โ Ordinal.nfpFamily f a < c - Ordinal.cof_iSup ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮณ : Type u} [LinearOrder ฮณ] [NoMaxOrder ฮณ] {f : ฮณ โ Ordinal.{u}} (hf : StrictMono f) : (โจ i, f i).cof = Order.cof ฮณ - Ordinal.nfpFamily_lt_ord_lift ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮน : Type u} {f : ฮน โ Ordinal.{max u v} โ Ordinal.{max u v}} {c : Ordinal.{max u v}} (hc : Cardinal.aleph0 < c.cof) (hc' : Cardinal.lift.{v, u} (Cardinal.mk ฮน) < c.cof) (hf : โ (i : ฮน), โ b < c, f i b < c) {a : Ordinal.{max u v}} (ha : a < c) : Ordinal.nfpFamily f a < c - Ordinal.lift_cof_iSup_add_one ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฒ : Type v} [LinearOrder ฮฒ] [Small.{u, v} ฮฒ] {f : ฮฒ โ Ordinal.{u}} (hf : StrictMono f) : Cardinal.lift.{v, u} (โจ i, f i + 1).cof = Cardinal.lift.{u, v} (Order.cof ฮฒ) - Ordinal.lift_cof_iSup ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฒ : Type v} [LinearOrder ฮฒ] [Small.{u, v} ฮฒ] [NoMaxOrder ฮฒ] {f : ฮฒ โ Ordinal.{u}} (hf : StrictMono f) : Cardinal.lift.{v, u} (โจ i, f i).cof = Cardinal.lift.{u, v} (Order.cof ฮฒ) - Ordinal.sSup_add_one_lt_of_lt_cof ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{s : Set Ordinal.{u}} {a : Ordinal.{u}} (ha : Cardinal.mk โs < (Ordinal.lift.{u + 1, u} a).cof) (hs : โ i โ s, i < a) : sSup ((fun x => x + 1) '' s) < a - Ordinal.cof_type ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
(ฮฑ : Type u_1) [LinearOrder ฮฑ] [WellFoundedLT ฮฑ] : (Ordinal.type fun x1 x2 => x1 < x2).cof = Order.cof ฮฑ - Ordinal.cof_iSup_Iio ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{a : Ordinal.{u_1}} {f : โ(Set.Iio a) โ Ordinal.{u_1}} (hf : StrictMono f) (ha : Order.IsSuccPrelimit a) : (โจ i, f i).cof = a.cof - Ordinal.cof_iSup_Iio_add_one ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{a : Ordinal.{u_1}} {f : โ(Set.Iio a) โ Ordinal.{u_1}} (hf : StrictMono f) : (โจ i, f i + 1).cof = a.cof - Order.cof_Iio ๐ Mathlib.SetTheory.Cardinal.Cofinality.Ordinal
{ฮฑ : Type u} [LinearOrder ฮฑ] [WellFoundedLT ฮฑ] (x : ฮฑ) : Order.cof โ(Set.Iio x) = ((Ordinal.typein fun x1 x2 => x1 < x2).toRelEmbedding x).cof - 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.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.isRegular_cof ๐ Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} (h : Order.IsSuccLimit o) : o.cof.IsRegular - 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.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.isSingular_aleph_iff ๐ Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} : (Cardinal.aleph o).IsSingular โ Order.IsSuccLimit o โง o.cof < Cardinal.aleph o - Cardinal.cof_omega_one ๐ Mathlib.SetTheory.Cardinal.Regular
: (Ordinal.omega 1).cof = Cardinal.aleph 1 - 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.cof_omega_add_one ๐ Mathlib.SetTheory.Cardinal.Regular
(o : Ordinal.{u_1}) : (Ordinal.omega (o + 1)).cof = Cardinal.aleph (o + 1) - Cardinal.cof_preOmega_add_one ๐ Mathlib.SetTheory.Cardinal.Regular
{o : Ordinal.{u_1}} (h : Ordinal.omega0 โค o) : (Ordinal.preOmega (o + 1)).cof = Cardinal.preAleph (o + 1) - 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
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