Theorem plybss 26181

Description: Reverse closure of the parameter 𝑆 of the polynomial set function. (Contributed by Mario Carneiro, 22-Jul-2014.)

Assertion

Ref	Expression
plybss	⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)

Proof of Theorem plybss

Dummy variables 𝑘 𝑎 𝑛 𝑧 𝑓 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ply 26175	. . 3 ⊢ Poly = (𝑥 ∈ 𝒫 ℂ ↦ {𝑓 ∣ ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑥 ∪ {0}) ↑m ℕ0)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})
2	1	mptrcl 6949	. 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ∈ 𝒫 ℂ)
3	2	elpwid 4541	1 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)

Syntax hints:   → wi 4   = wceq 1548   ∈ wcel 2121  {cab 2719  ∃wrex 3065   ∪ cun 3883   ⊆ wss 3885  𝒫 cpw 4532  {csn 4558   ↦ cmpt 5156  ‘cfv 6489  (class class class)co 7360   ↑_m cmap 8767  ℂcc 11031  0cc0 11033   · cmul 11038  ℕ₀cn0 12432  ...cfz 13456  ↑cexp 14018  Σcsu 15643  Polycply 26171

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-mpt 5157  df-xp 5627  df-rel 5628  df-cnv 5629  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fv 6497  df-ply 26175

This theorem is referenced by:  elply  26182  plyf  26185  plyssc  26187  plyaddlem  26202  plymullem  26203  plysub  26206  dgrlem  26216  coeidlem  26224  plyco  26228  plycj  26264  plycjOLD  26266  plyreres  26271  plydivlem3  26283  plydivlem4  26284  elmnc  43596