Metamath Proof Explorer


Theorem uzm1

Description: Choices for an element of an upper interval of integers. (Contributed by Jeff Madsen, 2-Sep-2009)

Ref Expression
Assertion uzm1 ⊢ N ∈ ℤ ≥ M → N = M ∨ N − 1 ∈ ℤ ≥ M

Proof

Step Hyp Ref Expression
1 eluzel2 ⊢ N ∈ ℤ ≥ M → M ∈ ℤ
2 1 a1d ⊢ N ∈ ℤ ≥ M → ¬ N = M → M ∈ ℤ
3 eluzelz ⊢ N ∈ ℤ ≥ M → N ∈ ℤ
4 peano2zm ⊢ N ∈ ℤ → N − 1 ∈ ℤ
5 3 4 syl ⊢ N ∈ ℤ ≥ M → N − 1 ∈ ℤ
6 5 a1d ⊢ N ∈ ℤ ≥ M → ¬ N = M → N − 1 ∈ ℤ
7 df-ne ⊢ N ≠ M ↔ ¬ N = M
8 eluzle ⊢ N ∈ ℤ ≥ M → M ≤ N
9 1 zred ⊢ N ∈ ℤ ≥ M → M ∈ ℝ
10 eluzelre ⊢ N ∈ ℤ ≥ M → N ∈ ℝ
11 9 10 ltlend ⊢ N ∈ ℤ ≥ M → M < N ↔ M ≤ N ∧ N ≠ M
12 11 biimprd ⊢ N ∈ ℤ ≥ M → M ≤ N ∧ N ≠ M → M < N
13 8 12 mpand ⊢ N ∈ ℤ ≥ M → N ≠ M → M < N
14 7 13 biimtrrid ⊢ N ∈ ℤ ≥ M → ¬ N = M → M < N
15 zltlem1 ⊢ M ∈ ℤ ∧ N ∈ ℤ → M < N ↔ M ≤ N − 1
16 1 3 15 syl2anc ⊢ N ∈ ℤ ≥ M → M < N ↔ M ≤ N − 1
17 14 16 sylibd ⊢ N ∈ ℤ ≥ M → ¬ N = M → M ≤ N − 1
18 2 6 17 3jcad ⊢ N ∈ ℤ ≥ M → ¬ N = M → M ∈ ℤ ∧ N − 1 ∈ ℤ ∧ M ≤ N − 1
19 eluz2 ⊢ N − 1 ∈ ℤ ≥ M ↔ M ∈ ℤ ∧ N − 1 ∈ ℤ ∧ M ≤ N − 1
20 18 19 imbitrrdi ⊢ N ∈ ℤ ≥ M → ¬ N = M → N − 1 ∈ ℤ ≥ M
21 20 orrd ⊢ N ∈ ℤ ≥ M → N = M ∨ N − 1 ∈ ℤ ≥ M