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

Theorem elply 15711
Description: Definition of a polynomial with coefficients in  S. (Contributed by Mario Carneiro, 17-Jul-2014.)
Assertion
Ref Expression
elply  |-  ( F  e.  (Poly `  S
)  <->  ( S  C_  CC  /\  E. n  e. 
NN0  E. a  e.  ( ( S  u.  {
0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
Distinct variable groups:    S, a, n   
k, a, z, n    F, a, n
Allowed substitution hints:    S( z, k)    F( z, k)

Proof of Theorem elply
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 plybss 15710 . 2  |-  ( F  e.  (Poly `  S
)  ->  S  C_  CC )
2 plyval 15709 . . . 4  |-  ( S 
C_  CC  ->  (Poly `  S )  =  {
f  |  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) } )
32eleq2d 2304 . . 3  |-  ( S 
C_  CC  ->  ( F  e.  (Poly `  S
)  <->  F  e.  { f  |  E. n  e. 
NN0  E. a  e.  ( ( S  u.  {
0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) } ) )
4 id 19 . . . . . . 7  |-  ( F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) )  ->  F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) ) )
5 cnex 8267 . . . . . . . 8  |-  CC  e.  _V
65mptex 5917 . . . . . . 7  |-  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  e. 
_V
74, 6eqeltrdi 2325 . . . . . 6  |-  ( F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) )  ->  F  e.  _V )
87a1i 9 . . . . 5  |-  ( ( n  e.  NN0  /\  a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )  ->  ( F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) )  ->  F  e.  _V ) )
98rexlimivv 2668 . . . 4  |-  ( E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) )  ->  F  e.  _V )
10 eqeq1 2241 . . . . 5  |-  ( f  =  F  ->  (
f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  <->  F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
11102rexbidv 2569 . . . 4  |-  ( f  =  F  ->  ( E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) )  <->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
129, 11elab3 2972 . . 3  |-  ( F  e.  { f  |  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) }  <->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) )
133, 12bitrdi 196 . 2  |-  ( S 
C_  CC  ->  ( F  e.  (Poly `  S
)  <->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
141, 13biadanii 617 1  |-  ( F  e.  (Poly `  S
)  <->  ( S  C_  CC  /\  E. n  e. 
NN0  E. a  e.  ( ( S  u.  {
0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   {cab 2220   E.wrex 2523   _Vcvv 2815    u. cun 3212    C_ wss 3214   {csn 3694    |-> cmpt 4176   ` cfv 5357  (class class class)co 6058    ^m cmap 6895   CCcc 8141   0cc0 8143    x. cmul 8148   NN0cn0 9513   ...cfz 10361   ^cexp 10924   sum_csu 12063  Polycply 15705
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-i2m1 8248
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-map 6897  df-inn 9255  df-n0 9514  df-ply 15707
This theorem is referenced by:  elply2  15712  plyun0  15713  plyf  15714  elplyr  15717  plycj  15738  plycn  15739  plyrecj  15740
  Copyright terms: Public domain W3C validator