Theorems · Theorem · logic and foundations
Ordinal.CNF.opow_mul_add
∀ {b e x y : Ordinal.{u_1}},
1 < b → x ≠ 0 → x < b → y < b ^ e → Ordinal.CNF b (b ^ e * x + y) = (e, x) :: Ordinal.CNF b y- 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.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botproof · cited by 4,720
- add_zeroproof · cited by 2,707
- Ordinalstatement and proof · cited by 1,688
- bot_eq_zero'proof · cited by 92
- LT.lt.ne_botproof · cited by 26
- Ordinal.CNFstatement and proof · cited by 21
- Ordinal.opow_ne_zeroproof · cited by 10
- Ordinal.CNF.ne_zeroproof · cited by 9
- Ordinal.mul_add_divproof · cited by 4
- Ordinal.mul_add_mod_selfproof · cited by 3
- Ordinal.log_eq_zeroproof · cited by 3
- Ordinal.mod_eq_of_ltproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Ordinal.CNF.coeff_opow_mul_addproof · cited by 1