plyaddlem - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > plyaddlem		GIF version

Theorem plyaddlem 15743

Description: Lemma for plyadd 15745. (Contributed by Mario Carneiro, 21-Jul-2014.)

**Hypotheses**
Ref	Expression
plyadd.1	⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
plyadd.2	⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆))
plyadd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
plyadd.m	⊢ (𝜑 → 𝑀 ∈ ℕ₀)
plyadd.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
plyadd.a	⊢ (𝜑 → 𝐴 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀))
plyadd.b	⊢ (𝜑 → 𝐵 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀))
plyadd.a2	⊢ (𝜑 → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
plyadd.b2	⊢ (𝜑 → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
plyadd.f	⊢ (𝜑 → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
plyadd.g	⊢ (𝜑 → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))

**Assertion**
Ref	Expression
plyaddlem	⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺) ∈ (Poly‘𝑆))

Distinct variable groups: 𝑥,𝑘,𝑦,𝑧,𝐵 𝑥,𝐹,𝑦,𝑧 𝑆,𝑘,𝑥,𝑦,𝑧 𝑥,𝐴,𝑦,𝑧 𝑥,𝐺,𝑦,𝑧 𝜑,𝑘,𝑥,𝑦,𝑧 𝑘,𝑀,𝑧 𝑘,𝑁,𝑧 Allowed substitution hints: 𝐴(𝑘) 𝐹(𝑘) 𝐺(𝑘) 𝑀(𝑥,𝑦) 𝑁(𝑥,𝑦)

**Proof of Theorem plyaddlem**
Step	Hyp	Ref	Expression
1		plyadd.1	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
2		plyadd.2	. . . 4 ⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆))
3		plyadd.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
4		plyadd.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
5		plyadd.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀))
6		plybss 15727	. . . . . . . . . 10 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
7	1, 6	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ ℂ)
8		0cnd 8283	. . . . . . . . . 10 ⊢ (𝜑 → 0 ∈ ℂ)
9	8	snssd 3844	. . . . . . . . 9 ⊢ (𝜑 → {0} ⊆ ℂ)
10	7, 9	unssd 3399	. . . . . . . 8 ⊢ (𝜑 → (𝑆 ∪ {0}) ⊆ ℂ)
11		cnex 8267	. . . . . . . 8 ⊢ ℂ ∈ V
12		ssexg 4254	. . . . . . . 8 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V)
13	10, 11, 12	sylancl 413	. . . . . . 7 ⊢ (𝜑 → (𝑆 ∪ {0}) ∈ V)
14		nn0ex 9522	. . . . . . 7 ⊢ ℕ₀ ∈ V
15		elmapg 6908	. . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ₀ ∈ V) → (𝐴 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀) ↔ 𝐴:ℕ₀⟶(𝑆 ∪ {0})))
16	13, 14, 15	sylancl 413	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀) ↔ 𝐴:ℕ₀⟶(𝑆 ∪ {0})))
17	5, 16	mpbid 147	. . . . 5 ⊢ (𝜑 → 𝐴:ℕ₀⟶(𝑆 ∪ {0}))
18	17, 10	fssd 5527	. . . 4 ⊢ (𝜑 → 𝐴:ℕ₀⟶ℂ)
19		plyadd.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀))
20		elmapg 6908	. . . . . . 7 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ₀ ∈ V) → (𝐵 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀) ↔ 𝐵:ℕ₀⟶(𝑆 ∪ {0})))
21	13, 14, 20	sylancl 413	. . . . . 6 ⊢ (𝜑 → (𝐵 ∈ ((𝑆 ∪ {0}) ↑_𝑚 ℕ₀) ↔ 𝐵:ℕ₀⟶(𝑆 ∪ {0})))
22	19, 21	mpbid 147	. . . . 5 ⊢ (𝜑 → 𝐵:ℕ₀⟶(𝑆 ∪ {0}))
23	22, 10	fssd 5527	. . . 4 ⊢ (𝜑 → 𝐵:ℕ₀⟶ℂ)
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 15741	. . 3 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘_𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))))
29	3	nn0zd 9719	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
30	4	nn0zd 9719	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ)
31		zdcle 9674	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑀 ≤ 𝑁)
32	29, 30, 31	syl2anc 411	. . . . 5 ⊢ (𝜑 → DECID 𝑀 ≤ 𝑁)
33	4, 3, 32	ifcldcd 3664	. . . 4 ⊢ (𝜑 → if(𝑀 ≤ 𝑁, 𝑁, 𝑀) ∈ ℕ₀)
34		eqid 2234	. . . . . . 7 ⊢ (𝑆 ∪ {0}) = (𝑆 ∪ {0})
35		plyadd.3	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
36	7, 34, 35	un0addcl 9549	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (𝑆 ∪ {0}) ∧ 𝑦 ∈ (𝑆 ∪ {0}))) → (𝑥 + 𝑦) ∈ (𝑆 ∪ {0}))
37	14	a1i 9	. . . . . 6 ⊢ (𝜑 → ℕ₀ ∈ V)
38		inidm 3434	. . . . . 6 ⊢ (ℕ₀ ∩ ℕ₀) = ℕ₀
39	36, 17, 22, 37, 37, 38	off 6288	. . . . 5 ⊢ (𝜑 → (𝐴 ∘_𝑓 + 𝐵):ℕ₀⟶(𝑆 ∪ {0}))
40		elfznn0 10473	. . . . 5 ⊢ (𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) → 𝑘 ∈ ℕ₀)
41		ffvelcdm 5815	. . . . 5 ⊢ (((𝐴 ∘_𝑓 + 𝐵):ℕ₀⟶(𝑆 ∪ {0}) ∧ 𝑘 ∈ ℕ₀) → ((𝐴 ∘_𝑓 + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0}))
42	39, 40, 41	syl2an 289	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))) → ((𝐴 ∘_𝑓 + 𝐵)‘𝑘) ∈ (𝑆 ∪ {0}))
43	10, 33, 42	elplyd 15735	. . 3 ⊢ (𝜑 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...if(𝑀 ≤ 𝑁, 𝑁, 𝑀))(((𝐴 ∘_𝑓 + 𝐵)‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘(𝑆 ∪ {0})))
44	28, 43	eqeltrd 2311	. 2 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺) ∈ (Poly‘(𝑆 ∪ {0})))
45		plyun0 15730	. 2 ⊢ (Poly‘(𝑆 ∪ {0})) = (Poly‘𝑆)
46	44, 45	eleqtrdi 2327	1 ⊢ (𝜑 → (𝐹 ∘_𝑓 + 𝐺) ∈ (Poly‘𝑆))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 842 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ∪ cun 3212 ⊆ wss 3214 ifcif 3624 {csn 3694 class class class wbr 4114 ↦ cmpt 4176 “ cima 4757 ⟶wf 5353 ‘cfv 5357 (class class class)co 6058 ∘_𝑓 cof 6273 ↑_𝑚 cmap 6895 ℂcc 8141 0cc0 8143 1c1 8144 + caddc 8146 · cmul 8148 ≤ cle 8325 ℕ₀cn0 9516 ℤcz 9597 ℤ_≥cuz 9874 ...cfz 10364 ↑cexp 10927 Σcsu 12066 Polycply 15722

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 ax-arch 8262 ax-caucvg 8263

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-isom 5366 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-of 6275 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-frec 6635 df-1o 6660 df-oadd 6664 df-er 6780 df-map 6897 df-en 6989 df-dom 6990 df-fin 6991 df-sup 7288 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-reap 8867 df-ap 8874 df-div 8967 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-n0 9517 df-z 9598 df-uz 9875 df-q 9973 df-rp 10008 df-fz 10365 df-fzo 10502 df-seqfrec 10837 df-exp 10928 df-ihash 11167 df-cj 11555 df-re 11556 df-im 11557 df-rsqrt 11711 df-abs 11712 df-clim 11992 df-sumdc 12067 df-ply 15724

This theorem is referenced by: plyadd 15745

W3C validator