Metamath Proof Explorer


Theorem uzdisj

Description: The first N elements of an upper integer set are distinct from any later members. (Contributed by Mario Carneiro, 24-Apr-2014)

Ref Expression
Assertion uzdisj ⊢ M … N − 1 ∩ ℤ ≥ N = ∅

Proof

Step Hyp Ref Expression
1 elinel2 ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → k ∈ ℤ ≥ N
2 eluzle ⊢ k ∈ ℤ ≥ N → N ≤ k
3 1 2 syl ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → N ≤ k
4 eluzel2 ⊢ k ∈ ℤ ≥ N → N ∈ ℤ
5 1 4 syl ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → N ∈ ℤ
6 eluzelz ⊢ k ∈ ℤ ≥ N → k ∈ ℤ
7 1 6 syl ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → k ∈ ℤ
8 zlem1lt ⊢ N ∈ ℤ ∧ k ∈ ℤ → N ≤ k ↔ N − 1 < k
9 5 7 8 syl2anc ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → N ≤ k ↔ N − 1 < k
10 3 9 mpbid ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → N − 1 < k
11 7 zred ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → k ∈ ℝ
12 peano2zm ⊢ N ∈ ℤ → N − 1 ∈ ℤ
13 5 12 syl ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → N − 1 ∈ ℤ
14 13 zred ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → N − 1 ∈ ℝ
15 elinel1 ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → k ∈ M … N − 1
16 elfzle2 ⊢ k ∈ M … N − 1 → k ≤ N − 1
17 15 16 syl ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → k ≤ N − 1
18 11 14 17 lensymd ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → ¬ N − 1 < k
19 10 18 pm2.21dd ⊢ k ∈ M … N − 1 ∩ ℤ ≥ N → k ∈ ∅
20 19 ssriv ⊢ M … N − 1 ∩ ℤ ≥ N ⊆ ∅
21 ss0 ⊢ M … N − 1 ∩ ℤ ≥ N ⊆ ∅ → M … N − 1 ∩ ℤ ≥ N = ∅
22 20 21 ax-mp ⊢ M … N − 1 ∩ ℤ ≥ N = ∅