| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plyaddlem | Structured version Visualization version GIF version | ||
| Description: Lemma for plyadd 26182. (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 26159 | . . . . . . . . . 10 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 7 | 1, 6 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 0cnd 11129 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 9 | 8 | snssd 4766 | . . . . . . . . 9 ⊢ (𝜑 → {0} ⊆ ℂ) |
| 10 | 7, 9 | unssd 4145 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ∪ {0}) ⊆ ℂ) |
| 11 | cnex 11111 | . . . . . . . 8 ⊢ ℂ ∈ V | |
| 12 | ssexg 5269 | . . . . . . . 8 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V) | |
| 13 | 10, 11, 12 | sylancl 587 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∪ {0}) ∈ V) |
| 14 | nn0ex 12411 | . . . . . . 7 ⊢ ℕ0 ∈ V | |
| 15 | elmapg 8780 | . . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0}))) | |
| 16 | 13, 14, 15 | sylancl 587 | . . . . . 6 ⊢ (𝜑 → (𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0}))) |
| 17 | 5, 16 | mpbid 232 | . . . . 5 ⊢ (𝜑 → 𝐴:ℕ0⟶(𝑆 ∪ {0})) |
| 18 | 17, 10 | fssd 6680 | . . . 4 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) |
| 19 | plyadd.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)) | |
| 20 | elmapg 8780 | . . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐵:ℕ0⟶(𝑆 ∪ {0}))) | |
| 21 | 13, 14, 20 | sylancl 587 | . . . . . 6 ⊢ (𝜑 → (𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐵:ℕ0⟶(𝑆 ∪ {0}))) |
| 22 | 19, 21 | mpbid 232 | . . . . 5 ⊢ (𝜑 → 𝐵:ℕ0⟶(𝑆 ∪ {0})) |
| 23 | 22, 10 | fssd 6680 | . . . 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 26178 | . . 3 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘)))) |
| 29 | 4, 3 | ifcld 4527 | . . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ0) |
| 30 | eqid 2737 | . . . . . . 7 ⊢ (𝑆 ∪ {0}) = (𝑆 ∪ {0}) | |
| 31 | plyadd.3 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
| 32 | 7, 30, 31 | un0addcl 12438 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑆 ∪ {0}) ∧ 𝑦 ∈ (𝑆 ∪ {0}))) → (𝑥 + 𝑦) ∈ (𝑆 ∪ {0})) |
| 33 | 14 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℕ0 ∈ V) |
| 34 | inidm 4180 | . . . . . 6 ⊢ (ℕ0 ∩ ℕ0) = ℕ0 | |
| 35 | 32, 17, 22, 33, 33, 34 | off 7642 | . . . . 5 ⊢ (𝜑 → (𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0})) |
| 36 | elfznn0 13540 | . . . . 5 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ0) | |
| 37 | ffvelcdm 7028 | . . . . 5 ⊢ (((𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0}) ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) | |
| 38 | 35, 36, 37 | syl2an 597 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) |
| 39 | 10, 29, 38 | elplyd 26167 | . . 3 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 40 | 28, 39 | eqeltrd 2837 | . 2 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 41 | plyun0 26162 | . 2 ⊢ (Poly‘(𝑆 ∪ {0})) = (Poly‘𝑆) | |
| 42 | 40, 41 | eleqtrdi 2847 | 1 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3441 ∪ cun 3900 ⊆ wss 3902 ifcif 4480 {csn 4581 class class class wbr 5099 ↦ cmpt 5180 “ cima 5628 ⟶wf 6489 ‘cfv 6493 (class class class)co 7360 ∘f cof 7622 ↑m cmap 8767 ℂcc 11028 0cc0 11030 1c1 11031 + caddc 11033 · cmul 11035 ≤ cle 11171 ℕ0cn0 12405 ℤ≥cuz 12755 ...cfz 13427 ↑cexp 13988 Σcsu 15613 Polycply 26149 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-inf2 9554 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-of 7624 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-oi 9419 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12150 df-2 12212 df-3 12213 df-n0 12406 df-z 12493 df-uz 12756 df-rp 12910 df-fz 13428 df-fzo 13575 df-seq 13929 df-exp 13989 df-hash 14258 df-cj 15026 df-re 15027 df-im 15028 df-sqrt 15162 df-abs 15163 df-clim 15415 df-sum 15614 df-ply 26153 |
| This theorem is referenced by: plyadd 26182 |
| Copyright terms: Public domain | W3C validator |