| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > seqp1 | Structured version Visualization version GIF version | ||
| Description: Value of the sequence builder function at a successor. (Contributed by Mario Carneiro, 24-Jun-2013.) (Revised by Mario Carneiro, 15-Sep-2013.) |
| Ref | Expression |
|---|---|
| seqp1 | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzel2 12963 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 2 | fveq2 6883 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
| 3 | 2 | eleq2d 2847 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
| 4 | seqeq1 14140 | . . . . . . 7 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → seq𝑀( + , 𝐹) = seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)) | |
| 5 | 4 | fveq1d 6885 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘(𝑁 + 1))) |
| 6 | 4 | fveq1d 6885 | . . . . . . 7 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (seq𝑀( + , 𝐹)‘𝑁) = (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁)) |
| 7 | 6 | oveq2d 7434 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁))) |
| 8 | 5, 7 | eqeq12d 2777 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) ↔ (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁)))) |
| 9 | 3, 8 | imbi12d 347 | . . . 4 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → ((𝑁 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁))) ↔ (𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) → (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁))))) |
| 10 | 0z 12697 | . . . . . 6 ⊢ 0 ∈ ℤ | |
| 11 | 10 | elimel 4552 | . . . . 5 ⊢ if(𝑀 ∈ ℤ, 𝑀, 0) ∈ ℤ |
| 12 | eqid 2761 | . . . . 5 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), if(𝑀 ∈ ℤ, 𝑀, 0)) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), if(𝑀 ∈ ℤ, 𝑀, 0)) ↾ ω) | |
| 13 | fvex 6896 | . . . . 5 ⊢ (𝐹‘if(𝑀 ∈ ℤ, 𝑀, 0)) ∈ V | |
| 14 | eqid 2761 | . . . . 5 ⊢ (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)〉), 〈if(𝑀 ∈ ℤ, 𝑀, 0), (𝐹‘if(𝑀 ∈ ℤ, 𝑀, 0))〉) ↾ ω) = (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)〉), 〈if(𝑀 ∈ ℤ, 𝑀, 0), (𝐹‘if(𝑀 ∈ ℤ, 𝑀, 0))〉) ↾ ω) | |
| 15 | 14 | seqval 14148 | . . . . 5 ⊢ seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹) = ran (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)〉), 〈if(𝑀 ∈ ℤ, 𝑀, 0), (𝐹‘if(𝑀 ∈ ℤ, 𝑀, 0))〉) ↾ ω) |
| 16 | 11, 12, 13, 14, 15 | uzrdgsuci 14096 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)) → (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁))) |
| 17 | 9, 16 | dedth 4541 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝑁 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)))) |
| 18 | 1, 17 | mpcom 39 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁))) |
| 19 | elex 3472 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ V) | |
| 20 | fvex 6896 | . . 3 ⊢ (seq𝑀( + , 𝐹)‘𝑁) ∈ V | |
| 21 | fvoveq1 7441 | . . . . 5 ⊢ (𝑧 = 𝑁 → (𝐹‘(𝑧 + 1)) = (𝐹‘(𝑁 + 1))) | |
| 22 | 21 | oveq2d 7434 | . . . 4 ⊢ (𝑧 = 𝑁 → (𝑤 + (𝐹‘(𝑧 + 1))) = (𝑤 + (𝐹‘(𝑁 + 1)))) |
| 23 | oveq1 7425 | . . . 4 ⊢ (𝑤 = (seq𝑀( + , 𝐹)‘𝑁) → (𝑤 + (𝐹‘(𝑁 + 1))) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) | |
| 24 | eqid 2761 | . . . 4 ⊢ (𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) = (𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) | |
| 25 | ovex 7451 | . . . 4 ⊢ ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1))) ∈ V | |
| 26 | 22, 23, 24, 25 | ovmpo 7578 | . . 3 ⊢ ((𝑁 ∈ V ∧ (seq𝑀( + , 𝐹)‘𝑁) ∈ V) → (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
| 27 | 19, 20, 26 | sylancl 598 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
| 28 | 18, 27 | eqtrd 2796 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ifcif 4482 〈cop 4590 ↦ cmpt 5186 ↾ cres 5653 ‘cfv 6537 (class class class)co 7418 ∈ cmpo 7420 ωcom 7875 reccrdg 8410 0cc0 11193 1c1 11194 + caddc 11196 ℤcz 12686 ℤ≥cuz 12958 seqcseq 14137 |
| 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 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| 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 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-n0 12600 df-z 12687 df-uz 12959 df-seq 14138 |
| This theorem is used by: seqexw 14153 seqp1d 14154 seqm1 14155 seqcl2 14156 seqfveq2 14160 seqshft2 14164 sermono 14170 seqsplit 14171 seqcaopr3 14173 seqf1olem2a 14176 seqf1olem2 14178 seqid2 14184 seqhomo 14185 ser1const 14194 expp1 14204 facp1 14415 seqcoll 14602 relexpsucnnr 15171 climserle 15823 iseraltlem2 15843 iseraltlem3 15844 climcndslem1 16011 climcndslem2 16012 clim2prod 16050 prodfn0 16056 prodfrec 16057 ntrivcvgfvn0 16061 ruclem7 16397 sadcp1 16618 smupp1 16643 seq1st 16739 algrp1 16742 eulerthlem2 16952 pcmpt 17063 gsumsplit1r 18869 gsumprval 18870 mulgfval 19272 mulgnnp1 19285 ovolunlem1a 25810 voliunlem1 25864 volsup 25870 dvnp1 26238 bposlem5 27608 opsqrlem5 32739 esumfzf 34694 esumpcvgval 34703 sseqp1 35020 rrvsum 35079 gsumnunsn 35166 iprodefisumlem 36484 faclimlem1 36487 heiborlem4 38728 heiborlem6 38730 fmul01 46561 fmuldfeqlem1 46563 stoweidlem3 46982 wallispilem4 47047 wallispi2lem1 47050 wallispi2lem2 47051 veroquadgsumlem 50952 |
| Copyright terms: Public domain | W3C validator |