Theorems · Theorem · logic and foundations
Ordinal.CNF.ne_zero
∀ {b o : Ordinal.{u_1}},
o ≠ 0 → Ordinal.CNF b o = (Ordinal.log b o, o / b ^ Ordinal.log b o) :: Ordinal.CNF b (o % b ^ Ordinal.log b o)Recursive definition for the Cantor normal form.
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 95 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Ordinalstatement and proof · cited by 1,688
- Ordinal.logstatement and proof · cited by 45
- Ordinal.CNFstatement · cited by 21
- Ordinal.CNF.rec_posproof · cited by 1
Cited by9
Results whose statement or proof uses this declaration.
- Ordinal.CNF.fst_le_logproof · cited by 2
- Ordinal.CNF.snd_posproof · cited by 2
- Ordinal.CNF.sortedGTproof · cited by 2
- Ordinal.CNF.foldrproof · cited by 1
- Ordinal.CNF.of_ltproof · cited by 1
- Ordinal.CNF.one_leftproof · cited by 1
- Ordinal.CNF.opow_mul_addproof · cited by 1
- Ordinal.CNF.zero_leftproof · cited by 1
- Ordinal.CNF.snd_ltproof · cited by 0