ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elplyd Unicode version

Theorem elplyd 15494
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.
StepHypRef Expression
1 nffvmpt1 5653 . . . . . . 7  |-  F/_ k
( ( k  e. 
NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) `
 j )
2 nfcv 2373 . . . . . . 7  |-  F/_ k  x.
3 nfcv 2373 . . . . . . 7  |-  F/_ k
( z ^ j
)
41, 2, 3nfov 6053 . . . . . 6  |-  F/_ k
( ( ( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) `  j )  x.  ( z ^
j ) )
5 nfcv 2373 . . . . . 6  |-  F/_ j
( ( ( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) `  k )  x.  ( z ^
k ) )
6 fveq2 5642 . . . . . . 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 6031 . . . . . . 7  |-  ( j  =  k  ->  (
z ^ j )  =  ( z ^
k ) )
86, 7oveq12d 6041 . . . . . 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
) ) )
94, 5, 8cbvsumi 11945 . . . . 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 10354 . . . . . . . . 9  |-  ( k  e.  ( 0 ... N )  ->  k  e.  NN0 )
11 iftrue 3611 . . . . . . . . . . 11  |-  ( k  e.  ( 0 ... N )  ->  if ( k  e.  ( 0 ... N ) ,  A ,  0 )  =  A )
1211adantl 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 )
1412, 13eqeltrd 2307 . . . . . . . . 9  |-  ( (
ph  /\  k  e.  ( 0 ... N
) )  ->  if ( k  e.  ( 0 ... N ) ,  A ,  0 )  e.  S )
15 eqid 2230 . . . . . . . . . 10  |-  ( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) )  =  ( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) )
1615fvmpt2 5733 . . . . . . . . 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 ) )
1710, 14, 16syl2an2 598 . . . . . . . 8  |-  ( (
ph  /\  k  e.  ( 0 ... N
) )  ->  (
( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) `  k
)  =  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) )
1817, 12eqtrd 2263 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( 0 ... N
) )  ->  (
( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) `  k
)  =  A )
1918oveq1d 6038 . . . . . 6  |-  ( (
ph  /\  k  e.  ( 0 ... N
) )  ->  (
( ( k  e. 
NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) `
 k )  x.  ( z ^ k
) )  =  ( A  x.  ( z ^ k ) ) )
2019sumeq2dv 11951 . . . . 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 ) ) )
219, 20eqtrid 2275 . . . 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 ) ) )
2221mpteq2dv 4181 . . 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 8177 . . . . . 6  |-  ( ph  ->  0  e.  CC )
2524snssd 3819 . . . . 5  |-  ( ph  ->  { 0 }  C_  CC )
2623, 25unssd 3382 . . . 4  |-  ( ph  ->  ( S  u.  {
0 } )  C_  CC )
27 elplyd.2 . . . 4  |-  ( ph  ->  N  e.  NN0 )
28 elun1 3373 . . . . . . . 8  |-  ( A  e.  S  ->  A  e.  ( S  u.  {
0 } ) )
2913, 28syl 14 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( 0 ... N
) )  ->  A  e.  ( S  u.  {
0 } ) )
3029adantlr 477 . . . . . 6  |-  ( ( ( ph  /\  k  e.  NN0 )  /\  k  e.  ( 0 ... N
) )  ->  A  e.  ( S  u.  {
0 } ) )
31 ssun2 3370 . . . . . . . 8  |-  { 0 }  C_  ( S  u.  { 0 } )
32 c0ex 8178 . . . . . . . . 9  |-  0  e.  _V
3332snss 3809 . . . . . . . 8  |-  ( 0  e.  ( S  u.  { 0 } )  <->  { 0 }  C_  ( S  u.  { 0 } ) )
3431, 33mpbir 146 . . . . . . 7  |-  0  e.  ( S  u.  {
0 } )
3534a1i 9 . . . . . 6  |-  ( ( ( ph  /\  k  e.  NN0 )  /\  -.  k  e.  ( 0 ... N ) )  ->  0  e.  ( S  u.  { 0 } ) )
36 nn0z 9504 . . . . . . . 8  |-  ( k  e.  NN0  ->  k  e.  ZZ )
3736adantl 277 . . . . . . 7  |-  ( (
ph  /\  k  e.  NN0 )  ->  k  e.  ZZ )
38 0zd 9496 . . . . . . 7  |-  ( (
ph  /\  k  e.  NN0 )  ->  0  e.  ZZ )
3927nn0zd 9605 . . . . . . . 8  |-  ( ph  ->  N  e.  ZZ )
4039adantr 276 . . . . . . 7  |-  ( (
ph  /\  k  e.  NN0 )  ->  N  e.  ZZ )
41 fzdcel 10280 . . . . . . 7  |-  ( ( k  e.  ZZ  /\  0  e.  ZZ  /\  N  e.  ZZ )  -> DECID  k  e.  (
0 ... N ) )
4237, 38, 40, 41syl3anc 1273 . . . . . 6  |-  ( (
ph  /\  k  e.  NN0 )  -> DECID  k  e.  (
0 ... N ) )
4330, 35, 42ifcldadc 3636 . . . . 5  |-  ( (
ph  /\  k  e.  NN0 )  ->  if (
k  e.  ( 0 ... N ) ,  A ,  0 )  e.  ( S  u.  { 0 } ) )
4443fmpttd 5805 . . . 4  |-  ( ph  ->  ( k  e.  NN0  |->  if ( k  e.  ( 0 ... N ) ,  A ,  0 ) ) : NN0 --> ( S  u.  { 0 } ) )
45 elplyr 15493 . . . 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 } ) ) )
4626, 27, 44, 45syl3anc 1273 . . 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 } ) ) )
4722, 46eqeltrrd 2308 . 2  |-  ( ph  ->  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( A  x.  ( z ^ k ) ) )  e.  (Poly `  ( S  u.  { 0 } ) ) )
48 plyun0 15489 . 2  |-  (Poly `  ( S  u.  { 0 } ) )  =  (Poly `  S )
4947, 48eleqtrdi 2323 1  |-  ( ph  ->  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( A  x.  ( z ^ k ) ) )  e.  (Poly `  S ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104  DECID wdc 841    = wceq 1397    e. wcel 2201    u. cun 3197    C_ wss 3199   ifcif 3604   {csn 3670    |-> cmpt 4151   -->wf 5324   ` cfv 5328  (class class class)co 6023   CCcc 8035   0cc0 8037    x. cmul 8042   NN0cn0 9407   ZZcz 9484   ...cfz 10248   ^cexp 10806   sum_csu 11936  Polycply 15481
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-addass 8139  ax-distr 8141  ax-i2m1 8142  ax-0lt1 8143  ax-0id 8145  ax-rnegex 8146  ax-cnre 8148  ax-pre-ltirr 8149  ax-pre-ltwlin 8150  ax-pre-lttrn 8151  ax-pre-ltadd 8153
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-nel 2497  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-recs 6476  df-frec 6562  df-map 6824  df-pnf 8221  df-mnf 8222  df-xr 8223  df-ltxr 8224  df-le 8225  df-sub 8357  df-neg 8358  df-inn 9149  df-n0 9408  df-z 9485  df-uz 9761  df-fz 10249  df-seqfrec 10716  df-sumdc 11937  df-ply 15483
This theorem is referenced by:  ply1term  15496  plyaddlem  15502  plymullem  15503  plycj  15514  dvply2g  15519
  Copyright terms: Public domain W3C validator