![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fzsuc | Structured version Visualization version GIF version |
Description: Join a successor to the end of a finite set of sequential integers. (Contributed by NM, 19-Jul-2008.) (Revised by Mario Carneiro, 28-Apr-2015.) |
Ref | Expression |
---|---|
fzsuc | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...(𝑁 + 1)) = ((𝑀...𝑁) ∪ {(𝑁 + 1)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | peano2uz 12923 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) | |
2 | eluzfz2 13549 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (𝑀...(𝑁 + 1))) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (𝑀...(𝑁 + 1))) |
4 | peano2fzr 13554 | . . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘𝑀) ∧ (𝑁 + 1) ∈ (𝑀...(𝑁 + 1))) → 𝑁 ∈ (𝑀...(𝑁 + 1))) | |
5 | 3, 4 | mpdan 685 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (𝑀...(𝑁 + 1))) |
6 | fzsplit 13567 | . . 3 ⊢ (𝑁 ∈ (𝑀...(𝑁 + 1)) → (𝑀...(𝑁 + 1)) = ((𝑀...𝑁) ∪ ((𝑁 + 1)...(𝑁 + 1)))) | |
7 | 5, 6 | syl 17 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...(𝑁 + 1)) = ((𝑀...𝑁) ∪ ((𝑁 + 1)...(𝑁 + 1)))) |
8 | eluzelz 12870 | . . . 4 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ ℤ) | |
9 | fzsn 13583 | . . . 4 ⊢ ((𝑁 + 1) ∈ ℤ → ((𝑁 + 1)...(𝑁 + 1)) = {(𝑁 + 1)}) | |
10 | 1, 8, 9 | 3syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 + 1)...(𝑁 + 1)) = {(𝑁 + 1)}) |
11 | 10 | uneq2d 4160 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑀...𝑁) ∪ ((𝑁 + 1)...(𝑁 + 1))) = ((𝑀...𝑁) ∪ {(𝑁 + 1)})) |
12 | 7, 11 | eqtrd 2765 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑀...(𝑁 + 1)) = ((𝑀...𝑁) ∪ {(𝑁 + 1)})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 ∪ cun 3942 {csn 4630 ‘cfv 6549 (class class class)co 7419 1c1 11146 + caddc 11148 ℤcz 12596 ℤ≥cuz 12860 ...cfz 13524 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11201 ax-resscn 11202 ax-1cn 11203 ax-icn 11204 ax-addcl 11205 ax-addrcl 11206 ax-mulcl 11207 ax-mulrcl 11208 ax-mulcom 11209 ax-addass 11210 ax-mulass 11211 ax-distr 11212 ax-i2m1 11213 ax-1ne0 11214 ax-1rid 11215 ax-rnegex 11216 ax-rrecex 11217 ax-cnre 11218 ax-pre-lttri 11219 ax-pre-lttrn 11220 ax-pre-ltadd 11221 ax-pre-mulgt0 11222 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11287 df-mnf 11288 df-xr 11289 df-ltxr 11290 df-le 11291 df-sub 11483 df-neg 11484 df-nn 12251 df-n0 12511 df-z 12597 df-uz 12861 df-fz 13525 |
This theorem is referenced by: elfzp1 13591 fztp 13597 fzsuc2 13599 fzdifsuc 13601 bpoly3 16046 prmind2 16672 vdwlem6 16974 gsummptfzsplit 19916 telgsumfzslem 19972 imasdsf1olem 24340 voliunlem1 25540 chtub 27210 2sqlem10 27426 dchrisum0flb 27508 pntpbnd1 27584 wlkp1 29587 iuninc 32450 esumfzf 33839 cvmliftlem10 35055 poimirlem2 37246 iunp1 44577 sge0p1 45945 |
Copyright terms: Public domain | W3C validator |