Theorem elplyr 15824

Description: Sufficient condition for elementhood in the set of polynomials. (Contributed by Mario Carneiro, 17-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)

Assertion

Ref	Expression
elplyr	⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘𝑆))

Distinct variable groups:   𝑧,𝑘,𝑆   𝐴,𝑘,𝑧   𝑘,𝑁,𝑧

Proof of Theorem elplyr

Dummy variables 𝑎 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1028	. 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → 𝑆 ⊆ ℂ)
2		simp2 1029	. . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → 𝑁 ∈ ℕ0)
3		simp3 1030	. . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → 𝐴:ℕ0⟶𝑆)
4		ssun1 3392	. . . . 5 ⊢ 𝑆 ⊆ (𝑆 ∪ {0})
5		fss 5544	. . . . 5 ⊢ ((𝐴:ℕ0⟶𝑆 ∧ 𝑆 ⊆ (𝑆 ∪ {0})) → 𝐴:ℕ0⟶(𝑆 ∪ {0}))
6	3, 4, 5	sylancl 417	. . . 4 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → 𝐴:ℕ0⟶(𝑆 ∪ {0}))
7		0cnd 8313	. . . . . . . 8 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → 0 ∈ ℂ)
8	7	snssd 3858	. . . . . . 7 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → {0} ⊆ ℂ)
9	1, 8	unssd 3405	. . . . . 6 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → (𝑆 ∪ {0}) ⊆ ℂ)
10		cnex 8297	. . . . . 6 ⊢ ℂ ∈ V
11		ssexg 4270	. . . . . 6 ⊢ (((𝑆 ∪ {0}) ⊆ ℂ ∧ ℂ ∈ V) → (𝑆 ∪ {0}) ∈ V)
12	9, 10, 11	sylancl 417	. . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → (𝑆 ∪ {0}) ∈ V)
13		nn0ex 9552	. . . . 5 ⊢ ℕ0 ∈ V
14		elmapg 6929	. . . . 5 ⊢ (((𝑆 ∪ {0}) ∈ V ∧ ℕ0 ∈ V) → (𝐴 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0})))
15	12, 13, 14	sylancl 417	. . . 4 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → (𝐴 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ↔ 𝐴:ℕ0⟶(𝑆 ∪ {0})))
16	6, 15	mpbird 167	. . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → 𝐴 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0))
17		eqidd 2239	. . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))))
18		oveq2 6087	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (0...𝑛) = (0...𝑁))
19	18	sumeq1d 12115	. . . . . 6 ⊢ (𝑛 = 𝑁 → Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...𝑁)((𝑎‘𝑘) · (𝑧↑𝑘)))
20	19	mpteq2dv 4220	. . . . 5 ⊢ (𝑛 = 𝑁 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝑎‘𝑘) · (𝑧↑𝑘))))
21	20	eqeq2d 2250	. . . 4 ⊢ (𝑛 = 𝑁 → ((𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))) ↔ (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝑎‘𝑘) · (𝑧↑𝑘)))))
22		fveq1 5692	. . . . . . . 8 ⊢ (𝑎 = 𝐴 → (𝑎‘𝑘) = (𝐴‘𝑘))
23	22	oveq1d 6094	. . . . . . 7 ⊢ (𝑎 = 𝐴 → ((𝑎‘𝑘) · (𝑧↑𝑘)) = ((𝐴‘𝑘) · (𝑧↑𝑘)))
24	23	sumeq2sdv 12119	. . . . . 6 ⊢ (𝑎 = 𝐴 → Σ𝑘 ∈ (0...𝑁)((𝑎‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘)))
25	24	mpteq2dv 4220	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝑎‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))))
26	25	eqeq2d 2250	. . . 4 ⊢ (𝑎 = 𝐴 → ((𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝑎‘𝑘) · (𝑧↑𝑘))) ↔ (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘)))))
27	21, 26	rspc2ev 2945	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘)))) → ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)(𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))
28	2, 16, 17, 27	syl3anc 1278	. 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)(𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))))
29		elply 15818	. 2 ⊢ ((𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘𝑆) ↔ (𝑆 ⊆ ℂ ∧ ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)(𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))))
30	1, 28, 29	sylanbrc 421	1 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶𝑆) → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐴‘𝑘) · (𝑧↑𝑘))) ∈ (Poly‘𝑆))

Syntax hints:   → wi 4   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  Vcvv 2821   ∪ cun 3218   ⊆ wss 3220  {csn 3708   ↦ cmpt 4190  ⟶wf 5371  ‘cfv 5375  (class class class)co 6079   ↑_𝑚 cmap 6916  ℂcc 8171  0cc0 8173   · cmul 8178  ℕ₀cn0 9546  ...cfz 10394  ↑cexp 10958  Σcsu 12102  Polycply 15812

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-addass 8275  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-0id 8281  ax-rnegex 8282  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-ltadd 8289

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-frec 6656  df-map 6918  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-inn 9288  df-n0 9547  df-z 9628  df-uz 9905  df-fz 10395  df-seqfrec 10868  df-sumdc 12103  df-ply 15814

This theorem is referenced by:  elplyd  15825