Metamath Proof Explorer


Theorem uzsplit

Description: Express an upper integer set as the disjoint (see uzdisj ) union of the first N values and the rest. (Contributed by Mario Carneiro, 24-Apr-2014)

Ref Expression
Assertion uzsplit ⊢ N ∈ ℤ ≥ M → ℤ ≥ M = M … N − 1 ∪ ℤ ≥ N

Proof

Step Hyp Ref Expression
1 eluzelre ⊢ N ∈ ℤ ≥ M → N ∈ ℝ
2 eluzelre ⊢ k ∈ ℤ ≥ M → k ∈ ℝ
3 lelttric ⊢ N ∈ ℝ ∧ k ∈ ℝ → N ≤ k ∨ k < N
4 1 2 3 syl2an ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → N ≤ k ∨ k < N
5 eluzelz ⊢ N ∈ ℤ ≥ M → N ∈ ℤ
6 eluzelz ⊢ k ∈ ℤ ≥ M → k ∈ ℤ
7 eluz ⊢ N ∈ ℤ ∧ k ∈ ℤ → k ∈ ℤ ≥ N ↔ N ≤ k
8 5 6 7 syl2an ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ ℤ ≥ N ↔ N ≤ k
9 eluzle ⊢ k ∈ ℤ ≥ M → M ≤ k
10 6 9 jca ⊢ k ∈ ℤ ≥ M → k ∈ ℤ ∧ M ≤ k
11 10 adantl ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ ℤ ∧ M ≤ k
12 eluzel2 ⊢ k ∈ ℤ ≥ M → M ∈ ℤ
13 elfzm11 ⊢ M ∈ ℤ ∧ N ∈ ℤ → k ∈ M … N − 1 ↔ k ∈ ℤ ∧ M ≤ k ∧ k < N
14 df-3an ⊢ k ∈ ℤ ∧ M ≤ k ∧ k < N ↔ k ∈ ℤ ∧ M ≤ k ∧ k < N
15 13 14 bitrdi ⊢ M ∈ ℤ ∧ N ∈ ℤ → k ∈ M … N − 1 ↔ k ∈ ℤ ∧ M ≤ k ∧ k < N
16 12 5 15 syl2anr ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ M … N − 1 ↔ k ∈ ℤ ∧ M ≤ k ∧ k < N
17 11 16 mpbirand ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ M … N − 1 ↔ k < N
18 8 17 orbi12d ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ ℤ ≥ N ∨ k ∈ M … N − 1 ↔ N ≤ k ∨ k < N
19 4 18 mpbird ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ ℤ ≥ N ∨ k ∈ M … N − 1
20 19 orcomd ⊢ N ∈ ℤ ≥ M ∧ k ∈ ℤ ≥ M → k ∈ M … N − 1 ∨ k ∈ ℤ ≥ N
21 20 ex ⊢ N ∈ ℤ ≥ M → k ∈ ℤ ≥ M → k ∈ M … N − 1 ∨ k ∈ ℤ ≥ N
22 elfzuz ⊢ k ∈ M … N − 1 → k ∈ ℤ ≥ M
23 22 a1i ⊢ N ∈ ℤ ≥ M → k ∈ M … N − 1 → k ∈ ℤ ≥ M
24 uztrn ⊢ k ∈ ℤ ≥ N ∧ N ∈ ℤ ≥ M → k ∈ ℤ ≥ M
25 24 expcom ⊢ N ∈ ℤ ≥ M → k ∈ ℤ ≥ N → k ∈ ℤ ≥ M
26 23 25 jaod ⊢ N ∈ ℤ ≥ M → k ∈ M … N − 1 ∨ k ∈ ℤ ≥ N → k ∈ ℤ ≥ M
27 21 26 impbid ⊢ N ∈ ℤ ≥ M → k ∈ ℤ ≥ M ↔ k ∈ M … N − 1 ∨ k ∈ ℤ ≥ N
28 elun ⊢ k ∈ M … N − 1 ∪ ℤ ≥ N ↔ k ∈ M … N − 1 ∨ k ∈ ℤ ≥ N
29 27 28 bitr4di ⊢ N ∈ ℤ ≥ M → k ∈ ℤ ≥ M ↔ k ∈ M … N − 1 ∪ ℤ ≥ N
30 29 eqrdv ⊢ N ∈ ℤ ≥ M → ℤ ≥ M = M … N − 1 ∪ ℤ ≥ N