Theorems · Theorem · logic and foundations
Ordinal.nfp_mul_opow_omega0_add
∀ {a c : Ordinal.{u_1}} (b : Ordinal.{u_1}),
0 < a →
0 < c →
c ≤ a ^ Ordinal.omega0 →
Ordinal.nfp (fun x => a * x) (a ^ Ordinal.omega0 * b + c) = a ^ Ordinal.omega0 * Order.succ b- Defined in
- Mathlib.SetTheory.Ordinal.FixedPoint
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 100 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites24
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- add_zeroproof · cited by 2,707
- le_antisymmproof · cited by 2,068
- le_reflproof · cited by 2,061
- Ordinalstatement and proof · cited by 1,688
- mul_assocproof · cited by 1,667
- LT.lt.trans_leproof · cited by 678
- add_le_addproof · cited by 666
- Order.succstatement and proof · cited by 633
- Ordinal.omega0statement and proof · cited by 197
- add_lt_add_rightproof · cited by 50
- mul_le_mul_rightproof · cited by 47
- Ordinal.nfpstatement and proof · cited by 41
Cited by1
Results whose statement or proof uses this declaration.
- Ordinal.deriv_mul_eq_opow_omega0_mulproof · cited by 0