| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plyaddlem | Structured version Visualization version GIF version | ||
| Description: Lemma for plyadd 26536. (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 26512 | . . . . . . . . . 10 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 7 | 1, 6 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 0cnd 11299 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 9 | 8 | snssd 4746 | . . . . . . . . 9 ⊢ (𝜑 → {0} ⊆ ℂ) |
| 10 | 7, 9 | unssd 4190 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ∪ {0}) ⊆ ℂ) |
| 11 | cnex 11281 | . . . . . . . 8 ⊢ ℂ ∈ V | |
| 12 | ssexg 5280 | . . . . . . . 8 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V) | |
| 13 | 10, 11, 12 | sylancl 598 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∪ {0}) ∈ V) |
| 14 | nn0ex 12612 | . . . . . . 7 ⊢ ℕ0 ∈ V | |
| 15 | elmapg 8859 | . . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐴 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0}))) | |
| 16 | 13, 14, 15 | sylancl 598 | . . . . . 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 8859 | . . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0) ↔ 𝐵:ℕ0⟶(𝑆 ∪ {0}))) | |
| 21 | 13, 14, 20 | sylancl 598 | . . . . . 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 26532 | . . 3 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘)))) |
| 29 | 4, 3 | ifcld 4528 | . . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ0) |
| 30 | eqid 2760 | . . . . . . 7 ⊢ (𝑆 ∪ {0}) = (𝑆 ∪ {0}) | |
| 31 | plyadd.3 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
| 32 | 7, 30, 31 | un0addcl 12639 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑆 ∪ {0}) ∧ 𝑦 ∈ (𝑆 ∪ {0}))) → (𝑥 + 𝑦) ∈ (𝑆 ∪ {0})) |
| 33 | 14 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℕ0 ∈ V) |
| 34 | inidm 4123 | . . . . . 6 ⊢ (ℕ0 ∩ ℕ0) = ℕ0 | |
| 35 | 32, 17, 22, 33, 33, 34 | off 7711 | . . . . 5 ⊢ (𝜑 → (𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0})) |
| 36 | elfznn0 13754 | . . . . 5 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ0) | |
| 37 | ffvelcdm 7081 | . . . . 5 ⊢ (((𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0}) ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) | |
| 38 | 35, 36, 37 | syl2an 608 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) |
| 39 | 10, 29, 38 | elplyd 26520 | . . 3 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 40 | 28, 39 | eqeltrd 2860 | . 2 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 41 | plyun0 26515 | . 2 ⊢ (Poly‘(𝑆 ∪ {0})) = (Poly‘𝑆) | |
| 42 | 40, 41 | eleqtrdi 2870 | 1 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ⊆ wss 3895 ∪ cun 4149 ifcif 4481 {csn 4583 class class class wbr 5102 ↦ cmpt 5185 “ cima 5653 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ∘f cof 7691 ↑m cmap 8847 ℂcc 11198 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 ≤ cle 11344 ℕ0cn0 12606 ℤ≥cuz 12965 ...cfz 13639 ↑cexp 14204 Σcsu 15853 Polycply 26502 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9642 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-of 7693 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-oi 9504 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-fz 13640 df-fzo 13789 df-seq 14145 df-exp 14205 df-hash 14475 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-clim 15655 df-sum 15854 df-ply 26506 |
| This theorem is used by: plyadd 26536 |
| Copyright terms: Public domain | W3C validator |