Theorem plybss 26256

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

Syntax hints:   → wi 4   = wceq 1562   ∈ wcel 2144  {cab 2742  ∃wrex 3088   ∪ cun 3904   ⊆ wss 3906  𝒫 cpw 4557  {csn 4584   ↦ cmpt 5183  ‘cfv 6523  (class class class)co 7398   ↑_m cmap 8810  ℂcc 11073  0cc0 11075   · cmul 11080  ℕ₀cn0 12483  ...cfz 13514  ↑cexp 14076  Σcsu 15715  Polycply 26246

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-xp 5655  df-rel 5656  df-cnv 5657  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fv 6531  df-ply 26250

This theorem is referenced by:  elply  26257  plyf  26260  plyssc  26262  plyaddlem  26277  plymullem  26278  plysub  26281  dgrlem  26291  coeidlem  26299  plyco  26303  plycj  26339  plycjOLD  26341  plyreres  26349  plydivlem3  26361  plydivlem4  26362  elmnc  43718