Metamath Proof Explorer


Theorem nn0ltlem1

Description: Nonnegative integer ordering relation. (Contributed by NM, 10-May-2004) (Proof shortened by Mario Carneiro, 16-May-2014)

Ref Expression
Assertion nn0ltlem1 ⊢ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M < N ↔ M ≤ N − 1

Proof

Step Hyp Ref Expression
1 nn0z ⊢ M ∈ ℕ 0 → M ∈ ℤ
2 nn0z ⊢ N ∈ ℕ 0 → N ∈ ℤ
3 zltlem1 ⊢ M ∈ ℤ ∧ N ∈ ℤ → M < N ↔ M ≤ N − 1
4 1 2 3 syl2an ⊢ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M < N ↔ M ≤ N − 1