Theorem plybss 26157

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

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {cab 2713  ∃wrex 3059   ∪ cun 3898   ⊆ wss 3900  𝒫 cpw 4553  {csn 4579   ↦ cmpt 5178  ‘cfv 6491  (class class class)co 7358   ↑_m cmap 8765  ℂcc 11026  0cc0 11028   · cmul 11033  ℕ₀cn0 12403  ...cfz 13425  ↑cexp 13986  Σcsu 15611  Polycply 26147

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 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376

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 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-xp 5629  df-rel 5630  df-cnv 5631  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6447  df-fv 6499  df-ply 26151

This theorem is referenced by:  elply  26158  plyf  26161  plyssc  26163  plyaddlem  26178  plymullem  26179  plysub  26182  dgrlem  26192  coeidlem  26200  plyco  26204  plycj  26241  plycjOLD  26243  plyreres  26248  plydivlem3  26261  plydivlem4  26262  elmnc  43415