plyval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > plyval		Structured version Visualization version GIF version

Theorem plyval 24786

Description: Value of the polynomial set function. (Contributed by Mario Carneiro, 17-Jul-2014.)

**Assertion**
Ref	Expression
plyval	⊢ (𝑆 ⊆ ℂ → (Poly‘𝑆) = {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})

Distinct variable group: 𝑘,𝑎,𝑛,𝑧,𝑓,𝑆

Proof of Theorem plyval Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnex 10621	. . 3 ⊢ ℂ ∈ V
2	1	elpw2 5251	. 2 ⊢ (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
3		uneq1 4135	. . . . . . 7 ⊢ (𝑥 = 𝑆 → (𝑥 ∪ {0}) = (𝑆 ∪ {0}))
4	3	oveq1d 7174	. . . . . 6 ⊢ (𝑥 = 𝑆 → ((𝑥 ∪ {0}) ↑_m ℕ₀) = ((𝑆 ∪ {0}) ↑_m ℕ₀))
5	4	rexeqdv 3419	. . . . 5 ⊢ (𝑥 = 𝑆 → (∃𝑎 ∈ ((𝑥 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))) ↔ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))))
6	5	rexbidv 3300	. . . 4 ⊢ (𝑥 = 𝑆 → (∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑥 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘))) ↔ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))))
7	6	abbidv 2888	. . 3 ⊢ (𝑥 = 𝑆 → {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑥 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))} = {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})
8		df-ply 24781	. . 3 ⊢ Poly = (𝑥 ∈ 𝒫 ℂ ↦ {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑥 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})
9		nn0ex 11906	. . . 4 ⊢ ℕ₀ ∈ V
10		ovex 7192	. . . 4 ⊢ ((𝑆 ∪ {0}) ↑_m ℕ₀) ∈ V
11	9, 10	ab2rexex 7683	. . 3 ⊢ {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))} ∈ V
12	7, 8, 11	fvmpt 6771	. 2 ⊢ (𝑆 ∈ 𝒫 ℂ → (Poly‘𝑆) = {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})
13	2, 12	sylbir 237	1 ⊢ (𝑆 ⊆ ℂ → (Poly‘𝑆) = {𝑓 ∣ ∃𝑛 ∈ ℕ₀ ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑_m ℕ₀)𝑓 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑎‘𝑘) · (𝑧↑𝑘)))})

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 {cab 2802 ∃wrex 3142 ∪ cun 3937 ⊆ wss 3939 𝒫 cpw 4542 {csn 4570 ↦ cmpt 5149 ‘cfv 6358 (class class class)co 7159 ↑_m cmap 8409 ℂcc 10538 0cc0 10540 · cmul 10545 ℕ₀cn0 11900 ...cfz 12895 ↑cexp 13432 Σcsu 15045 Polycply 24777

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-1cn 10598 ax-addcl 10600

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-om 7584 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-nn 11642 df-n0 11901 df-ply 24781

This theorem is referenced by: elply 24788 plyss 24792

W3C validator