WithBot ℕ

Lemmas about the type of natural numbers with a bottom element adjoined.

instance Nat.WithBot.instWellFoundedRelationWithBotNat : WellFoundedRelation (WithBot ℕ)

Equations

• Nat.WithBot.instWellFoundedRelationWithBotNat = { rel := fun x x_1 => x < x_1, wf := Nat.WithBot.instWellFoundedRelationWithBotNat.proof_1 }

theorem Nat.WithBot.add_eq_zero_iff {n : WithBot ℕ} {m : WithBot ℕ} : n + m = 0 ↔ n = 0 ∧ m = 0

theorem Nat.WithBot.add_eq_one_iff {n : WithBot ℕ} {m : WithBot ℕ} : n + m = 1 ↔ n = 0 ∧ m = 1 ∨ n = 1 ∧ m = 0

theorem Nat.WithBot.add_eq_two_iff {n : WithBot ℕ} {m : WithBot ℕ} : n + m = 2 ↔ n = 0 ∧ m = 2 ∨ n = 1 ∧ m = 1 ∨ n = 2 ∧ m = 0

theorem Nat.WithBot.add_eq_three_iff {n : WithBot ℕ} {m : WithBot ℕ} : n + m = 3 ↔ n = 0 ∧ m = 3 ∨ n = 1 ∧ m = 2 ∨ n = 2 ∧ m = 1 ∨ n = 3 ∧ m = 0

theorem Nat.WithBot.coe_nonneg {n : ℕ} : 0 ≤ ↑n

@[simp]

theorem Nat.WithBot.lt_zero_iff (n : WithBot ℕ) : n < 0 ↔ n = ⊥

theorem Nat.WithBot.one_le_iff_zero_lt {x : WithBot ℕ} : 1 ≤ x ↔ 0 < x

theorem Nat.WithBot.lt_one_iff_le_zero {x : WithBot ℕ} : x < 1 ↔ x ≤ 0

theorem Nat.WithBot.add_one_le_of_lt {n : WithBot ℕ} {m : WithBot ℕ} (h : n < m) : n + 1 ≤ m