| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn0split | Structured version Visualization version GIF version | ||
| Description: Express the set of nonnegative integers as the disjoint (see nn0disj 13659) union of the first 𝑁 + 1 values and the rest. (Contributed by AV, 8-Nov-2019.) |
| Ref | Expression |
|---|---|
| nn0split | ⊢ (𝑁 ∈ ℕ0 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0uz 12887 | . . 3 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝑁 ∈ ℕ0 → ℕ0 = (ℤ≥‘0)) |
| 3 | peano2nn0 12531 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 4 | 3, 1 | eleqtrdi 2873 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (ℤ≥‘0)) |
| 5 | uzsplit 13611 | . . 3 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1)))) | |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ0 → (ℤ≥‘0) = ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 7 | nn0cn 12501 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 8 | pncan1 11622 | . . . . 5 ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) − 1) = 𝑁) | |
| 9 | 7, 8 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 1) − 1) = 𝑁) |
| 10 | 9 | oveq2d 7412 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
| 11 | 10 | uneq1d 4121 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((0...((𝑁 + 1) − 1)) ∪ (ℤ≥‘(𝑁 + 1))) = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 12 | 2, 6, 11 | 3eqtrd 2802 | 1 ⊢ (𝑁 ∈ ℕ0 → ℕ0 = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1561 ∈ wcel 2143 ∪ cun 3903 ‘cfv 6521 (class class class)co 7396 ℂcc 11082 0cc0 11084 1c1 11085 + caddc 11087 − cmin 11425 ℕ0cn0 12491 ℤ≥cuz 12849 ...cfz 13522 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-nn 12221 df-n0 12492 df-z 12579 df-uz 12850 df-fz 13523 |
| This theorem is referenced by: chfacfscmulgsum 22927 chfacfpmmulgsum 22931 bccbc 44912 |
| Copyright terms: Public domain | W3C validator |