| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fz0sn0fz1 | Structured version Visualization version GIF version | ||
| Description: A finite set of sequential nonnegative integers is the union of the singleton containing 0 and a finite set of sequential positive integers. (Contributed by AV, 20-Mar-2021.) |
| Ref | Expression |
|---|---|
| fz0sn0fz1 | ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = ({0} ∪ (1...𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0elfz 13738 | . . 3 ⊢ (𝑁 ∈ ℕ0 → 0 ∈ (0...𝑁)) | |
| 2 | fzsplit 13664 | . . . 4 ⊢ (0 ∈ (0...𝑁) → (0...𝑁) = ((0...0) ∪ ((0 + 1)...𝑁))) | |
| 3 | 0p1e1 12444 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 4 | 3 | oveq1i 7422 | . . . . 5 ⊢ ((0 + 1)...𝑁) = (1...𝑁) |
| 5 | 4 | uneq2i 4112 | . . . 4 ⊢ ((0...0) ∪ ((0 + 1)...𝑁)) = ((0...0) ∪ (1...𝑁)) |
| 6 | 2, 5 | eqtrdi 2812 | . . 3 ⊢ (0 ∈ (0...𝑁) → (0...𝑁) = ((0...0) ∪ (1...𝑁))) |
| 7 | 1, 6 | syl 18 | . 2 ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = ((0...0) ∪ (1...𝑁))) |
| 8 | 0z 12685 | . . . 4 ⊢ 0 ∈ ℤ | |
| 9 | fzsn 13680 | . . . 4 ⊢ (0 ∈ ℤ → (0...0) = {0}) | |
| 10 | 8, 9 | mp1i 14 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (0...0) = {0}) |
| 11 | 10 | uneq1d 4114 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((0...0) ∪ (1...𝑁)) = ({0} ∪ (1...𝑁))) |
| 12 | 7, 11 | eqtrd 2796 | 1 ⊢ (𝑁 ∈ ℕ0 → (0...𝑁) = ({0} ∪ (1...𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∪ cun 3897 {csn 4584 (class class class)co 7412 0cc0 11181 1c1 11182 + caddc 11184 ℕ0cn0 12587 ℤcz 12674 ...cfz 13620 |
| 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 |
| This theorem is used by: f1resfz0f1d 13907 cyclnumvtx 30370 eucrct2eupth 30828 gsummulsubdishift1 33611 isubgr3stgrlem4 49011 |
| Copyright terms: Public domain | W3C validator |