Theorems · Definition · logic and foundations
Cardinal.preBeth
Ordinal.{u} → Cardinal.{u}The "pre-beth" function is defined so that preBeth o is the supremum of 2 ^ preBeth a for
a < o. This implies beth 0 = 0, beth (succ o) = 2 ^ beth o, and that for a limit ordinal o,
beth o is the supremum of beth a for a < o.
For the usual function starting at ℵ₀, see Cardinal.beth.
- Defined in
- Mathlib.SetTheory.Cardinal.Aleph
- Cited by
- 31 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by32
Results whose statement or proof uses this declaration.
- Cardinal.bethproof · cited by 35
- Cardinal.preBeth_strictMonostatement and proof · cited by 9
- Cardinal.preBeth_add_onestatement and proof · cited by 6
- Cardinal.preBeth_limitstatement and proof · cited by 5
- Cardinal.lift_bethproof · cited by 5
- Cardinal.preAleph_le_preBethstatement · cited by 4
- Cardinal.preBeth_zerostatement and proof · cited by 3
- Cardinal.IsInaccessible.preBeth_ordstatement and proof · cited by 3
- Cardinal.isNormal_preBethstatement and proof · cited by 2
- Cardinal.preBeth_lt_preBethstatement · cited by 2
- Cardinal.preBeth_natstatement · cited by 2
- Cardinal.beth_eq_preBethstatement · cited by 2