| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plyaddlem | Structured version Visualization version GIF version | ||
| Description: Lemma for plyadd 26357. (Contributed by Mario Carneiro, 21-Jul-2014.) |
| Ref | Expression |
|---|---|
| plyadd.1 | ⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆)) |
| plyadd.2 | ⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆)) |
| plyadd.3 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) |
| plyadd.m | ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| plyadd.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| plyadd.a | ⊢ (𝜑 → 𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)) |
| plyadd.b | ⊢ (𝜑 → 𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)) |
| plyadd.a2 | ⊢ (𝜑 → (𝐴 “ (ℤ≥‘(𝑀 + 1))) = {0}) |
| plyadd.b2 | ⊢ (𝜑 → (𝐵 “ (ℤ≥‘(𝑁 + 1))) = {0}) |
| plyadd.f | ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)))) |
| plyadd.g | ⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))) |
| Ref | Expression |
|---|---|
| plyaddlem | ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | plyadd.1 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆)) | |
| 2 | plyadd.2 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆)) | |
| 3 | plyadd.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ0) | |
| 4 | plyadd.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 5 | plyadd.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)) | |
| 6 | plybss 26334 | . . . . . . . . . 10 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 7 | 1, 6 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 0cnd 11202 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 9 | 8 | snssd 4757 | . . . . . . . . 9 ⊢ (𝜑 → {0} ⊆ ℂ) |
| 10 | 7, 9 | unssd 4153 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ∪ {0}) ⊆ ℂ) |
| 11 | cnex 11184 | . . . . . . . 8 ⊢ ℂ ∈ V | |
| 12 | ssexg 5297 | . . . . . . . 8 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V) | |
| 13 | 10, 11, 12 | sylancl 597 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∪ {0}) ∈ V) |
| 14 | nn0ex 12513 | . . . . . . 7 ⊢ ℕ0 ∈ V | |
| 15 | elmapg 8839 | . . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0}))) | |
| 16 | 13, 14, 15 | sylancl 597 | . . . . . 6 ⊢ (𝜑 → (𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0}))) |
| 17 | 5, 16 | mpbid 235 | . . . . 5 ⊢ (𝜑 → 𝐴:ℕ0⟶(𝑆 ∪ {0})) |
| 18 | 17, 10 | fssd 6727 | . . . 4 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) |
| 19 | plyadd.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)) | |
| 20 | elmapg 8839 | . . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐵:ℕ0⟶(𝑆 ∪ {0}))) | |
| 21 | 13, 14, 20 | sylancl 597 | . . . . . 6 ⊢ (𝜑 → (𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐵:ℕ0⟶(𝑆 ∪ {0}))) |
| 22 | 19, 21 | mpbid 235 | . . . . 5 ⊢ (𝜑 → 𝐵:ℕ0⟶(𝑆 ∪ {0})) |
| 23 | 22, 10 | fssd 6727 | . . . 4 ⊢ (𝜑 → 𝐵:ℕ0⟶ℂ) |
| 24 | plyadd.a2 | . . . 4 ⊢ (𝜑 → (𝐴 “ (ℤ≥‘(𝑀 + 1))) = {0}) | |
| 25 | plyadd.b2 | . . . 4 ⊢ (𝜑 → (𝐵 “ (ℤ≥‘(𝑁 + 1))) = {0}) | |
| 26 | plyadd.f | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘)))) | |
| 27 | plyadd.g | . . . 4 ⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘)))) | |
| 28 | 1, 2, 3, 4, 18, 23, 24, 25, 26, 27 | plyaddlem1 26353 | . . 3 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘)))) |
| 29 | 4, 3 | ifcld 4539 | . . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ0) |
| 30 | eqid 2770 | . . . . . . 7 ⊢ (𝑆 ∪ {0}) = (𝑆 ∪ {0}) | |
| 31 | plyadd.3 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
| 32 | 7, 30, 31 | un0addcl 12540 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑆 ∪ {0}) ∧ 𝑦 ∈ (𝑆 ∪ {0}))) → (𝑥 + 𝑦) ∈ (𝑆 ∪ {0})) |
| 33 | 14 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℕ0 ∈ V) |
| 34 | inidm 4187 | . . . . . 6 ⊢ (ℕ0 ∩ ℕ0) = ℕ0 | |
| 35 | 32, 17, 22, 33, 33, 34 | off 7696 | . . . . 5 ⊢ (𝜑 → (𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0})) |
| 36 | elfznn0 13651 | . . . . 5 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ0) | |
| 37 | ffvelcdm 7080 | . . . . 5 ⊢ (((𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0}) ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) | |
| 38 | 35, 36, 37 | syl2an 607 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) |
| 39 | 10, 29, 38 | elplyd 26342 | . . 3 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 40 | 28, 39 | eqeltrd 2870 | . 2 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 41 | plyun0 26337 | . 2 ⊢ (Poly‘(𝑆 ∪ {0})) = (Poly‘𝑆) | |
| 42 | 40, 41 | eleqtrdi 2880 | 1 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2150 Vcvv 3462 ∪ cun 3911 ⊆ wss 3913 ifcif 4492 {csn 4594 class class class wbr 5114 ↦ cmpt 5197 “ cima 5668 ⟶wf 6536 ‘cfv 6540 (class class class)co 7414 ∘f cof 7676 ↑m cmap 8827 ℂcc 11101 0cc0 11103 1c1 11104 + caddc 11106 · cmul 11108 ≤ cle 11247 ℕ0cn0 12507 ℤ≥cuz 12865 ...cfz 13538 ↑cexp 14100 Σcsu 15740 Polycply 26324 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 ax-inf2 9613 ax-cnex 11159 ax-resscn 11160 ax-1cn 11161 ax-icn 11162 ax-addcl 11163 ax-addrcl 11164 ax-mulcl 11165 ax-mulrcl 11166 ax-mulcom 11167 ax-addass 11168 ax-mulass 11169 ax-distr 11170 ax-i2m1 11171 ax-1ne0 11172 ax-1rid 11173 ax-rnegex 11174 ax-rrecex 11175 ax-cnre 11176 ax-pre-lttri 11177 ax-pre-lttrn 11178 ax-pre-ltadd 11179 ax-pre-mulgt0 11180 ax-pre-sup 11181 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-nel 3072 df-ral 3087 df-rex 3097 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3464 df-sbc 3753 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5560 df-eprel 5565 df-po 5573 df-so 5574 df-fr 5618 df-se 5619 df-we 5620 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-of 7678 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-er 8697 df-map 8829 df-en 8947 df-dom 8948 df-sdom 8949 df-fin 8950 df-sup 9405 df-oi 9475 df-card 9928 df-pnf 11248 df-mnf 11249 df-xr 11250 df-ltxr 11251 df-le 11252 df-sub 11446 df-neg 11447 df-div 11875 df-nn 12237 df-2 12306 df-3 12307 df-n0 12508 df-z 12595 df-uz 12866 df-rp 13020 df-fz 13539 df-fzo 13686 df-seq 14041 df-exp 14101 df-hash 14370 df-cj 15153 df-re 15154 df-im 15155 df-sqrt 15289 df-abs 15290 df-clim 15542 df-sum 15741 df-ply 26328 |
| This theorem is referenced by: plyadd 26357 |
| Copyright terms: Public domain | W3C validator |