| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plyaddlem | Structured version Visualization version GIF version | ||
| Description: Lemma for plyadd 26483. (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 26459 | . . . . . . . . . 10 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ) | |
| 7 | 1, 6 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
| 8 | 0cnd 11256 | . . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℂ) | |
| 9 | 8 | snssd 4747 | . . . . . . . . 9 ⊢ (𝜑 → {0} ⊆ ℂ) |
| 10 | 7, 9 | unssd 4138 | . . . . . . . 8 ⊢ (𝜑 → (𝑆 ∪ {0}) ⊆ ℂ) |
| 11 | cnex 11238 | . . . . . . . 8 ⊢ ℂ ∈ V | |
| 12 | ssexg 5281 | . . . . . . . 8 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V) | |
| 13 | 10, 11, 12 | sylancl 598 | . . . . . . 7 ⊢ (𝜑 → (𝑆 ∪ {0}) ∈ V) |
| 14 | nn0ex 12567 | . . . . . . 7 ⊢ ℕ0 ∈ V | |
| 15 | elmapg 8838 | . . . . . . 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 6716 | . . . 4 ⊢ (𝜑 → 𝐴:ℕ0⟶ℂ) |
| 19 | plyadd.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ((𝑆 ∪ {0}) ↑m ℕ0)) | |
| 20 | elmapg 8838 | . . . . . . 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 6716 | . . . 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 26479 | . . 3 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘)))) |
| 29 | 4, 3 | ifcld 4529 | . . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ0) |
| 30 | eqid 2760 | . . . . . . 7 ⊢ (𝑆 ∪ {0}) = (𝑆 ∪ {0}) | |
| 31 | plyadd.3 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆) | |
| 32 | 7, 30, 31 | un0addcl 12594 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑆 ∪ {0}) ∧ 𝑦 ∈ (𝑆 ∪ {0}))) → (𝑥 + 𝑦) ∈ (𝑆 ∪ {0})) |
| 33 | 14 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ℕ0 ∈ V) |
| 34 | inidm 4172 | . . . . . 6 ⊢ (ℕ0 ∩ ℕ0) = ℕ0 | |
| 35 | 32, 17, 22, 33, 33, 34 | off 7695 | . . . . 5 ⊢ (𝜑 → (𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0})) |
| 36 | elfznn0 13708 | . . . . 5 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ0) | |
| 37 | ffvelcdm 7070 | . . . . 5 ⊢ (((𝐴 ∘f + 𝐵):ℕ0⟶(𝑆 ∪ {0}) ∧ 𝑘 ∈ ℕ0) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) | |
| 38 | 35, 36, 37 | syl2an 608 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴 ∘f + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0})) |
| 39 | 10, 29, 38 | elplyd 26467 | . . 3 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘f + 𝐵)‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 40 | 28, 39 | eqeltrd 2860 | . 2 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) ∈ (Poly‘(𝑆 ∪ {0}))) |
| 41 | plyun0 26462 | . 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 1570 ∈ wcel 2145 Vcvv 3450 ∪ cun 3897 ⊆ wss 3899 ifcif 4482 {csn 4584 class class class wbr 5103 ↦ cmpt 5186 “ cima 5651 ⟶wf 6524 ‘cfv 6528 (class class class)co 7409 ∘f cof 7675 ↑m cmap 8826 ℂcc 11155 0cc0 11157 1c1 11158 + caddc 11160 · cmul 11162 ≤ cle 11301 ℕ0cn0 12561 ℤ≥cuz 12920 ...cfz 13594 ↑cexp 14158 Σcsu 15806 Polycply 26449 |
| 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-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-inf2 9620 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 ax-pre-sup 11235 |
| 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-rmo 3365 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-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-se 5602 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-isom 6537 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7677 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-er 8696 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-oi 9482 df-card 9977 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-div 11929 df-nn 12291 df-2 12360 df-3 12361 df-n0 12562 df-z 12649 df-uz 12921 df-rp 13076 df-fz 13595 df-fzo 13743 df-seq 14099 df-exp 14159 df-hash 14428 df-cj 15219 df-re 15220 df-im 15221 df-sqrt 15355 df-abs 15356 df-clim 15608 df-sum 15807 df-ply 26453 |
| This theorem is used by: plyadd 26483 |
| Copyright terms: Public domain | W3C validator |