| 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 12789 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | peano2nn0 12441 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 3 | 2, 1 | eleqtrdi 2846 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (ℤ≥‘0)) |
| 4 | fzouzsplit 13610 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘0) → (ℤ≥‘0) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) | |
| 5 | 3, 4 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (ℤ≥‘0) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 6 | 1, 5 | eqtrid 2783 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ℕ0 = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 7 | 6 | difeq1d 4077 | . 2 ⊢ (𝑁 ∈ ℕ0 → (ℕ0 ∖ (0...𝑁)) = (((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1))) ∖ (0...𝑁))) |
| 8 | uncom 4110 | . . . 4 ⊢ ((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) = ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) | |
| 9 | nn0z 12512 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 10 | fzval3 13650 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (0...𝑁) = (0..^(𝑁 + 1))) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = (0..^(𝑁 + 1))) |
| 12 | 11 | uneq1d 4119 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((0...𝑁) ∪ (ℤ≥‘(𝑁 + 1))) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 13 | 8, 12 | eqtrid 2783 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) = ((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1)))) |
| 14 | 13 | difeq1d 4077 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) ∖ (0...𝑁)) = (((0..^(𝑁 + 1)) ∪ (ℤ≥‘(𝑁 + 1))) ∖ (0...𝑁))) |
| 15 | 11 | ineq2d 4172 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((ℤ≥‘(𝑁 + 1)) ∩ (0...𝑁)) = ((ℤ≥‘(𝑁 + 1)) ∩ (0..^(𝑁 + 1)))) |
| 16 | fzouzdisj 13611 | . . . . 5 ⊢ ((0..^(𝑁 + 1)) ∩ (ℤ≥‘(𝑁 + 1))) = ∅ | |
| 17 | 16 | ineqcomi 4163 | . . . 4 ⊢ ((ℤ≥‘(𝑁 + 1)) ∩ (0..^(𝑁 + 1))) = ∅ |
| 18 | 15, 17 | eqtrdi 2787 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((ℤ≥‘(𝑁 + 1)) ∩ (0...𝑁)) = ∅) |
| 19 | undif5 4437 | . . 3 ⊢ (((ℤ≥‘(𝑁 + 1)) ∩ (0...𝑁)) = ∅ → (((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) | |
| 20 | 18, 19 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((ℤ≥‘(𝑁 + 1)) ∪ (0...𝑁)) ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) |
| 21 | 7, 14, 20 | 3eqtr2d 2777 | 1 ⊢ (𝑁 ∈ ℕ0 → (ℕ0 ∖ (0...𝑁)) = (ℤ≥‘(𝑁 + 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ∖ cdif 3898 ∪ cun 3899 ∩ cin 3900 ∅c0 4285 ‘cfv 6492 (class class class)co 7358 0cc0 11026 1c1 11027 + caddc 11029 ℕ0cn0 12401 ℤcz 12488 ℤ≥cuz 12751 ...cfz 13423 ..^cfzo 13570 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-fzo 13571 |
| This theorem is referenced by: ply1coedeg 33670 esplyfval2 33723 esplyfval3 33730 |
| Copyright terms: Public domain | W3C validator |