Theorems · Theorem · logic and foundations
Ordinal.CNF.foldr
∀ (b o : Ordinal.{u_1}), List.foldr (fun p r => b ^ p.1 * p.2 + r) 0 (Ordinal.CNF b o) = oEvaluating the Cantor normal form of an ordinal returns the ordinal.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 96 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.logproof · cited by 45
- Ordinal.CNFstatement and proof · cited by 21
- Ordinal.div_add_modproof · cited by 10
- Ordinal.CNF.zero_rightproof · cited by 10
- Ordinal.CNF.ne_zeroproof · cited by 9
- Ordinal.CNF.recproof · cited by 7
Cited by1
Results whose statement or proof uses this declaration.
- Ordinal.CNF.eval_coeffproof · cited by 1