Theorem ply1termlem 15459

Description: Lemma for ply1term 15460. (Contributed by Mario Carneiro, 26-Jul-2014.)

Hypothesis

Ref	Expression
ply1term.1	|- F = ( z e. CC |-> ( A x. ( z ^ N ) ) )

Assertion

Ref	Expression
ply1termlem	|- ( ( A e. CC /\ N e. NN0 ) -> F = ( z e. CC |-> sum_ k e. ( 0 ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) ) )

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

Allowed substitution hints:   F( z, k)

Proof of Theorem ply1termlem

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ply1term.1	. 2 |- F = ( z e. CC |-> ( A x. ( z ^ N ) ) )
2		simplr 528	. . . . . . 7 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> N e. NN0 )
3		nn0uz 9784	. . . . . . 7 |- NN0 = ( ZZ>= ` 0 )
4	2, 3	eleqtrdi 2322	. . . . . 6 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> N e. ( ZZ>= ` 0 ) )
5		fzss1 10291	. . . . . 6 |- ( N e. ( ZZ>= ` 0 ) -> ( N ... N ) C_ ( 0 ... N ) )
6	4, 5	syl 14	. . . . 5 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> ( N ... N ) C_ ( 0 ... N ) )
7		elfz1eq 10263	. . . . . . . . 9 |- ( k e. ( N ... N ) -> k = N )
8	7	adantl 277	. . . . . . . 8 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> k = N )
9		iftrue 3608	. . . . . . . 8 |- ( k = N -> if ( k = N , A , 0 ) = A )
10	8, 9	syl 14	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> if ( k = N , A , 0 ) = A )
11		simpll 527	. . . . . . . 8 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> A e. CC )
12	11	adantr 276	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> A e. CC )
13	10, 12	eqeltrd 2306	. . . . . 6 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> if ( k = N , A , 0 ) e. CC )
14		simplr 528	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> z e. CC )
15	2	adantr 276	. . . . . . . 8 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> N e. NN0 )
16	8, 15	eqeltrd 2306	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> k e. NN0 )
17	14, 16	expcld 10928	. . . . . 6 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> ( z ^ k ) e. CC )
18	13, 17	mulcld 8193	. . . . 5 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( N ... N ) ) -> ( if ( k = N , A , 0 ) x. ( z ^ k ) ) e. CC )
19		eldifn 3328	. . . . . . . . . 10 |- ( k e. ( ( 0 ... N ) \ ( N ... N ) ) -> -. k e. ( N ... N ) )
20	19	adantl 277	. . . . . . . . 9 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> -. k e. ( N ... N ) )
21	2	adantr 276	. . . . . . . . . . 11 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> N e. NN0 )
22	21	nn0zd 9593	. . . . . . . . . 10 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> N e. ZZ )
23		fzsn 10294	. . . . . . . . . . . 12 |- ( N e. ZZ -> ( N ... N ) = { N } )
24	23	eleq2d 2299	. . . . . . . . . . 11 |- ( N e. ZZ -> ( k e. ( N ... N ) <-> k e. { N } ) )
25		elsn2g 3700	. . . . . . . . . . 11 |- ( N e. ZZ -> ( k e. { N } <-> k = N ) )
26	24, 25	bitrd 188	. . . . . . . . . 10 |- ( N e. ZZ -> ( k e. ( N ... N ) <-> k = N ) )
27	22, 26	syl 14	. . . . . . . . 9 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> ( k e. ( N ... N ) <-> k = N ) )
28	20, 27	mtbid 676	. . . . . . . 8 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> -. k = N )
29	28	iffalsed 3613	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> if ( k = N , A , 0 ) = 0 )
30	29	oveq1d 6028	. . . . . 6 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = ( 0 x. ( z ^ k ) ) )
31		simpr 110	. . . . . . . 8 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> z e. CC )
32		eldifi 3327	. . . . . . . . 9 |- ( k e. ( ( 0 ... N ) \ ( N ... N ) ) -> k e. ( 0 ... N ) )
33		elfznn0 10342	. . . . . . . . 9 |- ( k e. ( 0 ... N ) -> k e. NN0 )
34	32, 33	syl 14	. . . . . . . 8 |- ( k e. ( ( 0 ... N ) \ ( N ... N ) ) -> k e. NN0 )
35		expcl 10812	. . . . . . . 8 |- ( ( z e. CC /\ k e. NN0 ) -> ( z ^ k ) e. CC )
36	31, 34, 35	syl2an 289	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> ( z ^ k ) e. CC )
37	36	mul02d 8564	. . . . . 6 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> ( 0 x. ( z ^ k ) ) = 0 )
38	30, 37	eqtrd 2262	. . . . 5 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ k e. ( ( 0 ... N ) \ ( N ... N ) ) ) -> ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = 0 )
39		elfzelz 10253	. . . . . . . 8 |- ( w e. ( 0 ... N ) -> w e. ZZ )
40	39	adantl 277	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ w e. ( 0 ... N ) ) -> w e. ZZ )
41	2	nn0zd 9593	. . . . . . . 8 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> N e. ZZ )
42	41	adantr 276	. . . . . . 7 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ w e. ( 0 ... N ) ) -> N e. ZZ )
43		fzdcel 10268	. . . . . . 7 |- ( ( w e. ZZ /\ N e. ZZ /\ N e. ZZ ) -> DECID w e. ( N ... N ) )
44	40, 42, 42, 43	syl3anc 1271	. . . . . 6 |- ( ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) /\ w e. ( 0 ... N ) ) -> DECID w e. ( N ... N ) )
45	44	ralrimiva 2603	. . . . 5 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> A. w e. ( 0 ... N )DECID w e. ( N ... N ) )
46		0zd 9484	. . . . . 6 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> 0 e. ZZ )
47	46, 41	fzfigd 10686	. . . . 5 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> ( 0 ... N ) e. Fin )
48	6, 18, 38, 45, 47	fisumss 11946	. . . 4 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> sum_ k e. ( N ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = sum_ k e. ( 0 ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) )
49	31, 2	expcld 10928	. . . . . 6 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> ( z ^ N ) e. CC )
50	11, 49	mulcld 8193	. . . . 5 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> ( A x. ( z ^ N ) ) e. CC )
51		oveq2 6021	. . . . . . 7 |- ( k = N -> ( z ^ k ) = ( z ^ N ) )
52	9, 51	oveq12d 6031	. . . . . 6 |- ( k = N -> ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = ( A x. ( z ^ N ) ) )
53	52	fsum1 11966	. . . . 5 |- ( ( N e. ZZ /\ ( A x. ( z ^ N ) ) e. CC ) -> sum_ k e. ( N ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = ( A x. ( z ^ N ) ) )
54	41, 50, 53	syl2anc 411	. . . 4 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> sum_ k e. ( N ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = ( A x. ( z ^ N ) ) )
55	48, 54	eqtr3d 2264	. . 3 |- ( ( ( A e. CC /\ N e. NN0 ) /\ z e. CC ) -> sum_ k e. ( 0 ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) = ( A x. ( z ^ N ) ) )
56	55	mpteq2dva 4177	. 2 |- ( ( A e. CC /\ N e. NN0 ) -> ( z e. CC |-> sum_ k e. ( 0 ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) ) = ( z e. CC |-> ( A x. ( z ^ N ) ) ) )
57	1, 56	eqtr4id 2281	1 |- ( ( A e. CC /\ N e. NN0 ) -> F = ( z e. CC |-> sum_ k e. ( 0 ... N ) ( if ( k = N , A , 0 ) x. ( z ^ k ) ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 839   = wceq 1395   e. wcel 2200   \ cdif 3195   C_ wss 3198   ifcif 3603   {csn 3667   |-> cmpt 4148   ` cfv 5324  (class class class)co 6013   CCcc 8023   0cc0 8025   x. cmul 8030   NN0cn0 9395   ZZcz 9472   ZZ>=cuz 9748   ...cfz 10236   ^cexp 10793   sum_csu 11907

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8116  ax-resscn 8117  ax-1cn 8118  ax-1re 8119  ax-icn 8120  ax-addcl 8121  ax-addrcl 8122  ax-mulcl 8123  ax-mulrcl 8124  ax-addcom 8125  ax-mulcom 8126  ax-addass 8127  ax-mulass 8128  ax-distr 8129  ax-i2m1 8130  ax-0lt1 8131  ax-1rid 8132  ax-0id 8133  ax-rnegex 8134  ax-precex 8135  ax-cnre 8136  ax-pre-ltirr 8137  ax-pre-ltwlin 8138  ax-pre-lttrn 8139  ax-pre-apti 8140  ax-pre-ltadd 8141  ax-pre-mulgt0 8142  ax-pre-mulext 8143  ax-arch 8144  ax-caucvg 8145

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-isom 5333  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-frec 6552  df-1o 6577  df-oadd 6581  df-er 6697  df-en 6905  df-dom 6906  df-fin 6907  df-pnf 8209  df-mnf 8210  df-xr 8211  df-ltxr 8212  df-le 8213  df-sub 8345  df-neg 8346  df-reap 8748  df-ap 8755  df-div 8846  df-inn 9137  df-2 9195  df-3 9196  df-4 9197  df-n0 9396  df-z 9473  df-uz 9749  df-q 9847  df-rp 9882  df-fz 10237  df-fzo 10371  df-seqfrec 10703  df-exp 10794  df-ihash 11031  df-cj 11396  df-re 11397  df-im 11398  df-rsqrt 11552  df-abs 11553  df-clim 11833  df-sumdc 11908

This theorem is referenced by:  ply1term  15460