| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nn0diffz0 | Structured version Visualization version GIF version | ||
| Description: Upper set of the nonnegative integers. (Contributed by Thierry Arnoux, 25-Jan-2026.) |
| Ref | Expression |
|---|---|
| nn0diffz0 | ⊢ (𝑁 ∈ ℕ0 → (ℕ0 ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0uz 12984 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | peano2nn0 12627 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 3 | 2, 1 | eleqtrdi 2871 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (ℤ≥‘0)) |
| 4 | fzouzsplit 13809 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) | |
| 5 | 3, 4 | syl 18 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (ℤ≥‘0) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 6 | 1, 5 | eqtrid 2808 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ℕ0 = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 7 | 6 | difeq1d 4073 | . 2 ⊢ (𝑁 ∈ ℕ0 → (ℕ0 ∖ (0...𝑁)) = (((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1))) ∖ (0...𝑁))) |
| 8 | uncom 4105 | . . . 4 ⊢ ((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) | |
| 9 | nn0z 12698 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 10 | fzval3 13849 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (0...𝑁) = (0..^(𝑁 + 1))) | |
| 11 | 9, 10 | syl 18 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = (0..^(𝑁 + 1))) |
| 12 | 11 | uneq1d 4114 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 13 | 8, 12 | eqtrid 2808 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 14 | 13 | difeq1d 4073 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) ∖ (0...𝑁)) = (((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1))) ∖ (0...𝑁))) |
| 15 | 11 | ineq2d 4166 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((ℤ≥‘(𝑁 + 1)) ∩ (0...𝑁)) = ((ℤ≥‘(𝑁 + 1)) ∩ (0..^(𝑁 + 1)))) |
| 16 | fzouzdisj 13810 | . . . . 5 ⊢ ((0..^(𝑁 + 1)) ∩ (ℤ≥‘(𝑁 + 1))) = ∅ | |
| 17 | 16 | ineqcomi 4157 | . . . 4 ⊢ ((ℤ≥‘(𝑁 + 1)) ∩ (0..^(𝑁 + 1))) = ∅ |
| 18 | 15, 17 | eqtrdi 2812 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((ℤ≥‘(𝑁 + 1)) ∩ (0...𝑁)) = ∅) |
| 19 | undif5 4440 | . . 3 ⊢ (((ℤ≥‘(𝑁 + 1)) ∩ (0...𝑁)) = ∅ → (((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) | |
| 20 | 18, 19 | syl 18 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) |
| 21 | 7, 14, 20 | 3eqtr2d 2802 | 1 ⊢ (𝑁 ∈ ℕ0 → (ℕ0 ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∖ cdif 3896 ∪ cun 3897 ∩ cin 3898 ∅c0 4279 ‘cfv 6531 (class class class)co 7412 0cc0 11181 1c1 11182 + caddc 11184 ℕ0cn0 12587 ℤcz 12674 ℤ≥cuz 12946 ...cfz 13620 ..^cfzo 13768 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-n0 12588 df-z 12675 df-uz 12947 df-fz 13621 df-fzo 13769 |
| This theorem is used by: ply1coedeg 34103 esplyfval2 34179 esplyfval3 34186 |
| Copyright terms: Public domain | W3C validator |