![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > nnsplit | Structured version Visualization version GIF version |
Description: Express the set of positive integers as the disjoint (see nnuzdisj 40479) union of the first 𝑁 values and the rest. (Contributed by Glauco Siliprandi, 21-Nov-2020.) |
Ref | Expression |
---|---|
nnsplit | ⊢ (𝑁 ∈ ℕ → ℕ = ((1...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnuz 12029 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
2 | 1 | a1i 11 | . 2 ⊢ (𝑁 ∈ ℕ → ℕ = (ℤ≥‘1)) |
3 | peano2nn 11388 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
4 | 3, 1 | syl6eleq 2869 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ (ℤ≥‘1)) |
5 | uzsplit 12730 | . . 3 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘1) → (ℤ≥‘1) = ((1...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1)))) | |
6 | 4, 5 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ → (ℤ≥‘1) = ((1...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
7 | nncn 11383 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
8 | 1cnd 10371 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℂ) | |
9 | 7, 8 | pncand 10735 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) − 1) = 𝑁) |
10 | 9 | oveq2d 6938 | . . 3 ⊢ (𝑁 ∈ ℕ → (1...((𝑁 + 1) − 1)) = (1...𝑁)) |
11 | 10 | uneq1d 3989 | . 2 ⊢ (𝑁 ∈ ℕ → ((1...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))) = ((1...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
12 | 2, 6, 11 | 3eqtrd 2818 | 1 ⊢ (𝑁 ∈ ℕ → ℕ = ((1...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1601 ∈ wcel 2107 ∪ cun 3790 ‘cfv 6135 (class class class)co 6922 1c1 10273 + caddc 10275 − cmin 10606 ℕcn 11374 ℤ≥cuz 11992 ...cfz 12643 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 ax-cnex 10328 ax-resscn 10329 ax-1cn 10330 ax-icn 10331 ax-addcl 10332 ax-addrcl 10333 ax-mulcl 10334 ax-mulrcl 10335 ax-mulcom 10336 ax-addass 10337 ax-mulass 10338 ax-distr 10339 ax-i2m1 10340 ax-1ne0 10341 ax-1rid 10342 ax-rnegex 10343 ax-rrecex 10344 ax-cnre 10345 ax-pre-lttri 10346 ax-pre-lttrn 10347 ax-pre-ltadd 10348 ax-pre-mulgt0 10349 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4672 df-iun 4755 df-br 4887 df-opab 4949 df-mpt 4966 df-tr 4988 df-id 5261 df-eprel 5266 df-po 5274 df-so 5275 df-fr 5314 df-we 5316 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-pred 5933 df-ord 5979 df-on 5980 df-lim 5981 df-suc 5982 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-riota 6883 df-ov 6925 df-oprab 6926 df-mpt2 6927 df-om 7344 df-1st 7445 df-2nd 7446 df-wrecs 7689 df-recs 7751 df-rdg 7789 df-er 8026 df-en 8242 df-dom 8243 df-sdom 8244 df-pnf 10413 df-mnf 10414 df-xr 10415 df-ltxr 10416 df-le 10417 df-sub 10608 df-neg 10609 df-nn 11375 df-n0 11643 df-z 11729 df-uz 11993 df-fz 12644 |
This theorem is referenced by: hoidmvlelem2 41737 |
Copyright terms: Public domain | W3C validator |