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

Theorem elplyr 15734
Description: Sufficient condition for elementhood in the set of polynomials. (Contributed by Mario Carneiro, 17-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
Assertion
Ref Expression
elplyr  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  e.  (Poly `  S ) )
Distinct variable groups:    z, k, S    A, k, z    k, N, z

Proof of Theorem elplyr
Dummy variables  a  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1024 . 2  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  S  C_  CC )
2 simp2 1025 . . 3  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  N  e.  NN0 )
3 simp3 1026 . . . . 5  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  A : NN0 --> S )
4 ssun1 3386 . . . . 5  |-  S  C_  ( S  u.  { 0 } )
5 fss 5526 . . . . 5  |-  ( ( A : NN0 --> S  /\  S  C_  ( S  u.  { 0 } ) )  ->  A : NN0 --> ( S  u.  { 0 } ) )
63, 4, 5sylancl 413 . . . 4  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  A : NN0 --> ( S  u.  { 0 } ) )
7 0cnd 8283 . . . . . . . 8  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  0  e.  CC )
87snssd 3844 . . . . . . 7  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  { 0 }  C_  CC )
91, 8unssd 3399 . . . . . 6  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  ( S  u.  { 0 } )  C_  CC )
10 cnex 8267 . . . . . 6  |-  CC  e.  _V
11 ssexg 4254 . . . . . 6  |-  ( ( ( S  u.  {
0 } )  C_  CC  /\  CC  e.  _V )  ->  ( S  u.  { 0 } )  e. 
_V )
129, 10, 11sylancl 413 . . . . 5  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  ( S  u.  { 0 } )  e.  _V )
13 nn0ex 9522 . . . . 5  |-  NN0  e.  _V
14 elmapg 6908 . . . . 5  |-  ( ( ( S  u.  {
0 } )  e. 
_V  /\  NN0  e.  _V )  ->  ( A  e.  ( ( S  u.  { 0 } )  ^m  NN0 )  <->  A : NN0 --> ( S  u.  { 0 } ) ) )
1512, 13, 14sylancl 413 . . . 4  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  ( A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) 
<->  A : NN0 --> ( S  u.  { 0 } ) ) )
166, 15mpbird 167 . . 3  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )
17 eqidd 2235 . . 3  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( A `
 k )  x.  ( z ^ k
) ) ) )
18 oveq2 6066 . . . . . . 7  |-  ( n  =  N  ->  (
0 ... n )  =  ( 0 ... N
) )
1918sumeq1d 12079 . . . . . 6  |-  ( n  =  N  ->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) )  =  sum_ k  e.  ( 0 ... N ) ( ( a `  k
)  x.  ( z ^ k ) ) )
2019mpteq2dv 4206 . . . . 5  |-  ( n  =  N  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( a `
 k )  x.  ( z ^ k
) ) ) )
2120eqeq2d 2246 . . . 4  |-  ( n  =  N  ->  (
( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  <->  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
22 fveq1 5674 . . . . . . . 8  |-  ( a  =  A  ->  (
a `  k )  =  ( A `  k ) )
2322oveq1d 6073 . . . . . . 7  |-  ( a  =  A  ->  (
( a `  k
)  x.  ( z ^ k ) )  =  ( ( A `
 k )  x.  ( z ^ k
) ) )
2423sumeq2sdv 12083 . . . . . 6  |-  ( a  =  A  ->  sum_ k  e.  ( 0 ... N
) ( ( a `
 k )  x.  ( z ^ k
) )  =  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )
2524mpteq2dv 4206 . . . . 5  |-  ( a  =  A  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( a `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( A `
 k )  x.  ( z ^ k
) ) ) )
2625eqeq2d 2246 . . . 4  |-  ( a  =  A  ->  (
( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( a `
 k )  x.  ( z ^ k
) ) )  <->  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) ) ) )
2721, 26rspc2ev 2939 . . 3  |-  ( ( N  e.  NN0  /\  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 )  /\  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( 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 ) ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) )
282, 16, 17, 27syl3anc 1274 . 2  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) )
29 elply 15728 . 2  |-  ( ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  e.  (Poly `  S )  <->  ( S  C_  CC  /\  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
301, 28, 29sylanbrc 417 1  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  e.  (Poly `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2205   E.wrex 2523   _Vcvv 2815    u. cun 3212    C_ wss 3214   {csn 3694    |-> cmpt 4176   -->wf 5353   ` cfv 5357  (class class class)co 6058    ^m cmap 6895   CCcc 8141   0cc0 8143    x. cmul 8148   NN0cn0 9516   ...cfz 10364   ^cexp 10927   sum_csu 12066  Polycply 15722
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 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-setind 4664  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-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-if 3625  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-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-map 6897  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8463  df-neg 8464  df-inn 9258  df-n0 9517  df-z 9598  df-uz 9875  df-fz 10365  df-seqfrec 10837  df-sumdc 12067  df-ply 15724
This theorem is referenced by:  elplyd  15735
  Copyright terms: Public domain W3C validator