Theorem plybss 26172

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 26166	. . 3 ⊢ Poly = (𝑥 ∈ 𝒫 ℂ ↦ {𝑓 ∣ ∃𝑛 ∈ ℕ0 ∃𝑎 ∈ ((𝑥 ∪ {0}) ↑m ℕ0)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})
2	1	mptrcl 6961	. 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ∈ 𝒫 ℂ)
3	2	elpwid 4565	1 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {cab 2715  ∃wrex 3062   ∪ cun 3901   ⊆ wss 3903  𝒫 cpw 4556  {csn 4582   ↦ cmpt 5181  ‘cfv 6502  (class class class)co 7370   ↑_m cmap 8777  ℂcc 11038  0cc0 11040   · cmul 11045  ℕ₀cn0 12415  ...cfz 13437  ↑cexp 13998  Σcsu 15623  Polycply 26162

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pr 5381

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-xp 5640  df-rel 5641  df-cnv 5642  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fv 6510  df-ply 26166

This theorem is referenced by:  elply  26173  plyf  26176  plyssc  26178  plyaddlem  26193  plymullem  26194  plysub  26197  dgrlem  26207  coeidlem  26215  plyco  26219  plycj  26256  plycjOLD  26258  plyreres  26263  plydivlem3  26276  plydivlem4  26277  elmnc  43522