Documentation

Mathlib.Data.Nat.Cast.Order.Ring

Cast of natural numbers: lemmas about bundled ordered semirings #

source
@[simp]
theorem Nat.cast_nonneg {α : Type u_2} [OrderedSemiring α] (n : ℕ) :
0 ≤ ↑n

Specialisation of Nat.cast_nonneg', which seems to be easier for Lean to use.

source
@[simp]
theorem Nat.ofNat_nonneg {α : Type u_2} [OrderedSemiring α] (n : ℕ) [n.AtLeastTwo] :
0 ≤ OfNat.ofNat n

Specialisation of Nat.ofNat_nonneg', which seems to be easier for Lean to use.

source
@[simp]
theorem Nat.cast_min {α : Type u_2} [LinearOrderedSemiring α] {a : ℕ} {b : ℕ} :
↑(min a b) = min ↑a ↑b
source
@[simp]
theorem Nat.cast_max {α : Type u_2} [LinearOrderedSemiring α] {a : ℕ} {b : ℕ} :
↑(max a b) = max ↑a ↑b
source
@[simp]
theorem Nat.cast_pos {α : Type u_2} [OrderedSemiring α] [Nontrivial α] {n : ℕ} :
0 < ↑n ↔ 0 < n

Specialisation of Nat.cast_pos', which seems to be easier for Lean to use.

source
@[simp]
theorem Nat.ofNat_pos' {α : Type u_1} [AddMonoidWithOne α] [PartialOrder α] [AddLeftMono α] [ZeroLEOneClass α] [NeZero 1] {n : ℕ} [n.AtLeastTwo] :
0 < OfNat.ofNat n

See also Nat.ofNat_pos, specialised for an OrderedSemiring.

source
@[simp]
theorem Nat.ofNat_pos {α : Type u_2} [OrderedSemiring α] [Nontrivial α] {n : ℕ} [n.AtLeastTwo] :
0 < OfNat.ofNat n

Specialisation of Nat.ofNat_pos', which seems to be easier for Lean to use.

source
@[simp]
theorem Nat.cast_tsub {α : Type u_1} [CanonicallyOrderedCommSemiring α] [Sub α] [OrderedSub α] [AddLeftReflectLE α] (m : ℕ) (n : ℕ) :
↑(m - n) = ↑m - ↑n

A version of Nat.cast_sub that works for ℝ≥0 and ℚ≥0. Note that this proof doesn't work for ℕ∞ and ℝ≥0∞, so we use type-specific lemmas for these types.

source
@[simp]
theorem Nat.abs_cast {α : Type u_1} [LinearOrderedRing α] (a : ℕ) :
|↑a| = ↑a
source
@[simp]
theorem Nat.abs_ofNat {α : Type u_1} [LinearOrderedRing α] (n : ℕ) [n.AtLeastTwo] :
|OfNat.ofNat n| = OfNat.ofNat n
source
theorem Nat.mul_le_pow {a : ℕ} (ha : a ≠ 1) (b : ℕ) :
a * b ≤ a ^ b
source
theorem Nat.two_mul_sq_add_one_le_two_pow_two_mul (k : ℕ) :
2 * k ^ 2 + 1 ≤ 2 ^ (2 * k)