Theorem elplyd 15844

Description: Sufficient condition for elementhood in the set of polynomials. (Contributed by Mario Carneiro, 17-Jul-2014.)

Hypotheses

Ref	Expression
elplyd.1	|- ( ph -> S C_ CC )
elplyd.2	|- ( ph -> N e. NN0 )
elplyd.3	|- ( ( ph /\ k e. ( 0 ... N ) ) -> A e. S )

Assertion

Ref	Expression
elplyd	|- ( ph -> ( z e. CC |-> sum_ k e. ( 0 ... N ) ( A x. ( z ^ k ) ) ) e. (Poly ` S ) )

Distinct variable groups:   z, A   z, k, N   ph, k, z   S, k, z

Allowed substitution hint:   A( k)

Proof of Theorem elplyd

Dummy variable j is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nffvmpt1 5706	. . . . . . 7 |- F/_ k ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j )
2		nfcv 2392	. . . . . . 7 |- F/_ k x.
3		nfcv 2392	. . . . . . 7 |- F/_ k ( z ^ j )
4	1, 2, 3	nfov 6115	. . . . . 6 |- F/_ k ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) )
5		nfcv 2392	. . . . . 6 |- F/_ j ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) x. ( z ^ k ) )
6		fveq2 5695	. . . . . . 7 |- ( j = k -> ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) = ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) )
7		oveq2 6093	. . . . . . 7 |- ( j = k -> ( z ^ j ) = ( z ^ k ) )
8	6, 7	oveq12d 6103	. . . . . 6 |- ( j = k -> ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) ) = ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) x. ( z ^ k ) ) )
9	4, 5, 8	cbvsumi 12130	. . . . 5 |- sum_ j e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) ) = sum_ k e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) x. ( z ^ k ) )
10		elfznn0 10523	. . . . . . . . 9 |- ( k e. ( 0 ... N ) -> k e. NN0 )
11		iftrue 3645	. . . . . . . . . . 11 |- ( k e. ( 0 ... N ) -> if ( k e. ( 0 ... N ) , A , 0 ) = A )
12	11	adantl 277	. . . . . . . . . 10 |- ( ( ph /\ k e. ( 0 ... N ) ) -> if ( k e. ( 0 ... N ) , A , 0 ) = A )
13		elplyd.3	. . . . . . . . . 10 |- ( ( ph /\ k e. ( 0 ... N ) ) -> A e. S )
14	12, 13	eqeltrd 2315	. . . . . . . . 9 |- ( ( ph /\ k e. ( 0 ... N ) ) -> if ( k e. ( 0 ... N ) , A , 0 ) e. S )
15		eqid 2238	. . . . . . . . . 10 |- ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) = ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) )
16	15	fvmpt2 5789	. . . . . . . . 9 |- ( ( k e. NN0 /\ if ( k e. ( 0 ... N ) , A , 0 ) e. S ) -> ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) = if ( k e. ( 0 ... N ) , A , 0 ) )
17	10, 14, 16	syl2an2 602	. . . . . . . 8 |- ( ( ph /\ k e. ( 0 ... N ) ) -> ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) = if ( k e. ( 0 ... N ) , A , 0 ) )
18	17, 12	eqtrd 2271	. . . . . . 7 |- ( ( ph /\ k e. ( 0 ... N ) ) -> ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) = A )
19	18	oveq1d 6100	. . . . . 6 |- ( ( ph /\ k e. ( 0 ... N ) ) -> ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) x. ( z ^ k ) ) = ( A x. ( z ^ k ) ) )
20	19	sumeq2dv 12136	. . . . 5 |- ( ph -> sum_ k e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` k ) x. ( z ^ k ) ) = sum_ k e. ( 0 ... N ) ( A x. ( z ^ k ) ) )
21	9, 20	eqtrid 2283	. . . 4 |- ( ph -> sum_ j e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) ) = sum_ k e. ( 0 ... N ) ( A x. ( z ^ k ) ) )
22	21	mpteq2dv 4222	. . 3 |- ( ph -> ( z e. CC |-> sum_ j e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) ) ) = ( z e. CC |-> sum_ k e. ( 0 ... N ) ( A x. ( z ^ k ) ) ) )
23		elplyd.1	. . . . 5 |- ( ph -> S C_ CC )
24		0cnd 8319	. . . . . 6 |- ( ph -> 0 e. CC )
25	24	snssd 3860	. . . . 5 |- ( ph -> { 0 } C_ CC )
26	23, 25	unssd 3405	. . . 4 |- ( ph -> ( S u. { 0 } ) C_ CC )
27		elplyd.2	. . . 4 |- ( ph -> N e. NN0 )
28		elun1 3396	. . . . . . . 8 |- ( A e. S -> A e. ( S u. { 0 } ) )
29	13, 28	syl 14	. . . . . . 7 |- ( ( ph /\ k e. ( 0 ... N ) ) -> A e. ( S u. { 0 } ) )
30	29	adantlr 481	. . . . . 6 |- ( ( ( ph /\ k e. NN0 ) /\ k e. ( 0 ... N ) ) -> A e. ( S u. { 0 } ) )
31		ssun2 3393	. . . . . . . 8 |- { 0 } C_ ( S u. { 0 } )
32		c0ex 8320	. . . . . . . . 9 |- 0 e. _V
33	32	snss 3850	. . . . . . . 8 |- ( 0 e. ( S u. { 0 } ) <-> { 0 } C_ ( S u. { 0 } ) )
34	31, 33	mpbir 146	. . . . . . 7 |- 0 e. ( S u. { 0 } )
35	34	a1i 9	. . . . . 6 |- ( ( ( ph /\ k e. NN0 ) /\ -. k e. ( 0 ... N ) ) -> 0 e. ( S u. { 0 } ) )
36		nn0z 9666	. . . . . . . 8 |- ( k e. NN0 -> k e. ZZ )
37	36	adantl 277	. . . . . . 7 |- ( ( ph /\ k e. NN0 ) -> k e. ZZ )
38		0zd 9658	. . . . . . 7 |- ( ( ph /\ k e. NN0 ) -> 0 e. ZZ )
39	27	nn0zd 9768	. . . . . . . 8 |- ( ph -> N e. ZZ )
40	39	adantr 276	. . . . . . 7 |- ( ( ph /\ k e. NN0 ) -> N e. ZZ )
41		fzdcel 10446	. . . . . . 7 |- ( ( k e. ZZ /\ 0 e. ZZ /\ N e. ZZ ) -> DECID k e. ( 0 ... N ) )
42	37, 38, 40, 41	syl3anc 1278	. . . . . 6 |- ( ( ph /\ k e. NN0 ) -> DECID k e. ( 0 ... N ) )
43	30, 35, 42	ifcldadc 3670	. . . . 5 |- ( ( ph /\ k e. NN0 ) -> if ( k e. ( 0 ... N ) , A , 0 ) e. ( S u. { 0 } ) )
44	43	fmpttd 5863	. . . 4 |- ( ph -> ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) : NN0 --> ( S u. { 0 } ) )
45		elplyr 15843	. . . 4 |- ( ( ( S u. { 0 } ) C_ CC /\ N e. NN0 /\ ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) : NN0 --> ( S u. { 0 } ) ) -> ( z e. CC |-> sum_ j e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) ) ) e. (Poly ` ( S u. { 0 } ) ) )
46	26, 27, 44, 45	syl3anc 1278	. . 3 |- ( ph -> ( z e. CC |-> sum_ j e. ( 0 ... N ) ( ( ( k e. NN0 |-> if ( k e. ( 0 ... N ) , A , 0 ) ) ` j ) x. ( z ^ j ) ) ) e. (Poly ` ( S u. { 0 } ) ) )
47	22, 46	eqeltrrd 2316	. 2 |- ( ph -> ( z e. CC |-> sum_ k e. ( 0 ... N ) ( A x. ( z ^ k ) ) ) e. (Poly ` ( S u. { 0 } ) ) )
48		plyun0 15839	. 2 |- (Poly ` ( S u. { 0 } ) ) = (Poly ` S )
49	47, 48	eleqtrdi 2331	1 |- ( ph -> ( z e. CC |-> sum_ k e. ( 0 ... N ) ( A x. ( z ^ k ) ) ) e. (Poly ` S ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104  DECID wdc 846   = wceq 1402   e. wcel 2209   u. cun 3218   C_ wss 3220   ifcif 3638   {csn 3709   |-> cmpt 4192   -->wf 5373   ` cfv 5377  (class class class)co 6085   CCcc 8177   0cc0 8179   x. cmul 8184   NN0cn0 9565   ZZcz 9646   ...cfz 10413   ^cexp 10977   sum_csu 12121  Polycply 15831

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-map 6924  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9306  df-n0 9566  df-z 9647  df-uz 9924  df-fz 10414  df-seqfrec 10887  df-sumdc 12122  df-ply 15833

This theorem is used by:  ply1term  15846  plyaddlem  15852  plymullem  15853  plycj  15864  dvply2g  15869