| 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 12892 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 2 | fveq2 6878 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (ℤ≥‘𝑀) = (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0))) | |
| 3 | 2 | eleq2d 2846 | . . . . 5 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑁 ∈ (ℤ≥‘if(𝑀 ∈ ℤ, 𝑀, 0)))) |
| 4 | seqeq1 14068 | . . . . . . 7 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → seq𝑀( + , 𝐹) = seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)) | |
| 5 | 4 | fveq1d 6880 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘(𝑁 + 1))) |
| 6 | 4 | fveq1d 6880 | . . . . . . 7 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (seq𝑀( + , 𝐹)‘𝑁) = (seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁)) |
| 7 | 6 | oveq2d 7429 | . . . . . 6 ⊢ (𝑀 = if(𝑀 ∈ ℤ, 𝑀, 0) → (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seq𝑀( + , 𝐹)‘𝑁)) = (𝑁(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))(seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹)‘𝑁))) |
| 8 | 5, 7 | eqeq12d 2776 | . . . . 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 12626 | . . . . . 6 ⊢ 0 ∈ ℤ | |
| 11 | 10 | elimel 4552 | . . . . 5 ⊢ if(𝑀 ∈ ℤ, 𝑀, 0) ∈ ℤ |
| 12 | eqid 2760 | . . . . 5 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 + 1)), if(𝑀 ∈ ℤ, 𝑀, 0)) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 + 1)), if(𝑀 ∈ ℤ, 𝑀, 0)) ↾ ω) | |
| 13 | fvex 6891 | . . . . 5 ⊢ (𝐹‘if(𝑀 ∈ ℤ, 𝑀, 0)) ∈ V | |
| 14 | eqid 2760 | . . . . 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 14076 | . . . . 5 ⊢ seqif(𝑀 ∈ ℤ, 𝑀, 0)( + , 𝐹) = ran (rec((𝑥 ∈ V, 𝑦 ∈ V ↦ 〈(𝑥 + 1), (𝑥(𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1))))𝑦)〉), 〈if(𝑀 ∈ ℤ, 𝑀, 0), (𝐹‘if(𝑀 ∈ ℤ, 𝑀, 0))〉) ↾ ω) |
| 16 | 11, 12, 13, 14, 15 | uzrdgsuci 14024 | . . . 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 3471 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ V) | |
| 20 | fvex 6891 | . . 3 ⊢ (seq𝑀( + , 𝐹)‘𝑁) ∈ V | |
| 21 | fvoveq1 7436 | . . . . 5 ⊢ (𝑧 = 𝑁 → (𝐹‘(𝑧 + 1)) = (𝐹‘(𝑁 + 1))) | |
| 22 | 21 | oveq2d 7429 | . . . 4 ⊢ (𝑧 = 𝑁 → (𝑤 + (𝐹‘(𝑧 + 1))) = (𝑤 + (𝐹‘(𝑁 + 1)))) |
| 23 | oveq1 7420 | . . . 4 ⊢ (𝑤 = (seq𝑀( + , 𝐹)‘𝑁) → (𝑤 + (𝐹‘(𝑁 + 1))) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) | |
| 24 | eqid 2760 | . . . 4 ⊢ (𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) = (𝑧 ∈ V, 𝑤 ∈ V ↦ (𝑤 + (𝐹‘(𝑧 + 1)))) | |
| 25 | ovex 7446 | . . . 4 ⊢ ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1))) ∈ V | |
| 26 | 22, 23, 24, 25 | ovmpo 7573 | . . 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 2795 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (seq𝑀( + , 𝐹)‘(𝑁 + 1)) = ((seq𝑀( + , 𝐹)‘𝑁) + (𝐹‘(𝑁 + 1)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ifcif 4482 〈cop 4590 ↦ cmpt 5186 ↾ cres 5657 ‘cfv 6533 (class class class)co 7413 ∈ cmpo 7415 ωcom 7862 reccrdg 8398 0cc0 11124 1c1 11125 + caddc 11127 ℤcz 12615 ℤ≥cuz 12887 seqcseq 14065 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-n0 12529 df-z 12616 df-uz 12888 df-seq 14066 |
| This theorem is used by: seqexw 14081 seqp1d 14082 seqm1 14083 seqcl2 14084 seqfveq2 14088 seqshft2 14092 sermono 14098 seqsplit 14099 seqcaopr3 14101 seqf1olem2a 14104 seqf1olem2 14106 seqid2 14112 seqhomo 14113 ser1const 14122 expp1 14132 facp1 14342 seqcoll 14529 relexpsucnnr 15098 climserle 15750 iseraltlem2 15770 iseraltlem3 15771 climcndslem1 15938 climcndslem2 15939 clim2prod 15977 prodfn0 15983 prodfrec 15984 ntrivcvgfvn0 15988 ruclem7 16324 sadcp1 16545 smupp1 16570 seq1st 16661 algrp1 16664 eulerthlem2 16873 pcmpt 16984 gsumsplit1r 18789 gsumprval 18790 mulgfval 19192 mulgnnp1 19205 ovolunlem1a 25724 voliunlem1 25778 volsup 25784 dvnp1 26152 bposlem5 27524 opsqrlem5 32625 esumfzf 34579 esumpcvgval 34588 sseqp1 34906 rrvsum 34965 gsumnunsn 35052 iprodefisumlem 36319 faclimlem1 36322 heiborlem4 38564 heiborlem6 38566 fmul01 46410 fmuldfeqlem1 46412 stoweidlem3 46831 wallispilem4 46896 wallispi2lem1 46899 wallispi2lem2 46900 veroquadgsumlem 50816 |
| Copyright terms: Public domain | W3C validator |