Bounds for nimber arithmetic #
We prove that the sum of two nimbers is bounded by their natural sum, and likewise for the product.
As a corollary of these bounds, ∗(ω ^ ω ^ x) is always a ring.
Addition #
A version of add_le_nadd stated in terms of Ordinal.
Multiplication #
A version of mul_le_nmul stated in terms of Ordinal.
theorem Nimber.IsRing.omega0_omega0_opow (x : Ordinal.{u_1}) :
(of (Ordinal.omega0 ^ Ordinal.omega0 ^ x)).IsRing
theorem Nimber.IsRing.opow_omega0 {x : Ordinal.{u_1}} (hx : 1 < x) :
(of (x ^ Ordinal.omega0)).IsRing