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

Theorem mplvalcoe 14733
Description: Value of the set of multivariate polynomials. (Contributed by Mario Carneiro, 7-Jan-2015.) (Revised by AV, 25-Jun-2019.) (Revised by Jim Kingdon, 4-Nov-2025.)
Hypotheses
Ref Expression
mplval.p  |-  P  =  ( I mPoly  R )
mplval.s  |-  S  =  ( I mPwSer  R )
mplval.b  |-  B  =  ( Base `  S
)
mplval.z  |-  .0.  =  ( 0g `  R )
mplvalcoe.u  |-  U  =  { f  e.  B  |  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  .0.  ) }
Assertion
Ref Expression
mplvalcoe  |-  ( ( I  e.  V  /\  R  e.  W )  ->  P  =  ( Ss  U ) )
Distinct variable groups:    B, f    f,
a, b, k, I    R, f, a, b, k    .0. , f
Allowed substitution hints:    B( k, a, b)    P( f, k, a, b)    S( f, k, a, b)    U( f, k, a, b)    V( f, k, a, b)    W( f, k, a, b)    .0. ( k, a, b)

Proof of Theorem mplvalcoe
Dummy variables  i  r  s are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mplval.p . 2  |-  P  =  ( I mPoly  R )
2 elex 2813 . . . 4  |-  ( I  e.  V  ->  I  e.  _V )
32adantr 276 . . 3  |-  ( ( I  e.  V  /\  R  e.  W )  ->  I  e.  _V )
4 elex 2813 . . . 4  |-  ( R  e.  W  ->  R  e.  _V )
54adantl 277 . . 3  |-  ( ( I  e.  V  /\  R  e.  W )  ->  R  e.  _V )
6 mplval.s . . . . 5  |-  S  =  ( I mPwSer  R )
7 fnpsr 14705 . . . . . . 7  |- mPwSer  Fn  ( _V  X.  _V )
87a1i 9 . . . . . 6  |-  ( ( I  e.  V  /\  R  e.  W )  -> mPwSer 
Fn  ( _V  X.  _V ) )
9 fnovex 6056 . . . . . 6  |-  ( ( mPwSer  Fn  ( _V  X.  _V )  /\  I  e.  _V  /\  R  e.  _V )  ->  ( I mPwSer  R )  e.  _V )
108, 3, 5, 9syl3anc 1273 . . . . 5  |-  ( ( I  e.  V  /\  R  e.  W )  ->  ( I mPwSer  R )  e.  _V )
116, 10eqeltrid 2317 . . . 4  |-  ( ( I  e.  V  /\  R  e.  W )  ->  S  e.  _V )
12 mplvalcoe.u . . . . 5  |-  U  =  { f  e.  B  |  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  .0.  ) }
13 mplval.b . . . . . 6  |-  B  =  ( Base `  S
)
14 basfn 13164 . . . . . . 7  |-  Base  Fn  _V
15 funfvex 5659 . . . . . . . 8  |-  ( ( Fun  Base  /\  S  e. 
dom  Base )  ->  ( Base `  S )  e. 
_V )
1615funfni 5434 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  S  e.  _V )  ->  ( Base `  S )  e. 
_V )
1714, 11, 16sylancr 414 . . . . . 6  |-  ( ( I  e.  V  /\  R  e.  W )  ->  ( Base `  S
)  e.  _V )
1813, 17eqeltrid 2317 . . . . 5  |-  ( ( I  e.  V  /\  R  e.  W )  ->  B  e.  _V )
1912, 18rabexd 4236 . . . 4  |-  ( ( I  e.  V  /\  R  e.  W )  ->  U  e.  _V )
20 ressex 13171 . . . 4  |-  ( ( S  e.  _V  /\  U  e.  _V )  ->  ( Ss  U )  e.  _V )
2111, 19, 20syl2anc 411 . . 3  |-  ( ( I  e.  V  /\  R  e.  W )  ->  ( Ss  U )  e.  _V )
22 vex 2804 . . . . . . 7  |-  i  e. 
_V
23 vex 2804 . . . . . . 7  |-  r  e. 
_V
24 fnovex 6056 . . . . . . 7  |-  ( ( mPwSer  Fn  ( _V  X.  _V )  /\  i  e.  _V  /\  r  e.  _V )  ->  ( i mPwSer  r )  e.  _V )
257, 22, 23, 24mp3an 1373 . . . . . 6  |-  ( i mPwSer 
r )  e.  _V
2625a1i 9 . . . . 5  |-  ( ( i  =  I  /\  r  =  R )  ->  ( i mPwSer  r )  e.  _V )
27 id 19 . . . . . . . 8  |-  ( s  =  ( i mPwSer  r
)  ->  s  =  ( i mPwSer  r )
)
28 oveq12 6032 . . . . . . . 8  |-  ( ( i  =  I  /\  r  =  R )  ->  ( i mPwSer  r )  =  ( I mPwSer  R
) )
2927, 28sylan9eqr 2285 . . . . . . 7  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  s  =  ( I mPwSer  R ) )
3029, 6eqtr4di 2281 . . . . . 6  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  s  =  S )
3130fveq2d 5646 . . . . . . . . 9  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( Base `  s )  =  (
Base `  S )
)
3231, 13eqtr4di 2281 . . . . . . . 8  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( Base `  s )  =  B )
33 simpll 527 . . . . . . . . . 10  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  i  =  I )
3433oveq2d 6039 . . . . . . . . 9  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( NN0  ^m  i )  =  ( NN0  ^m  I ) )
3533raleqdv 2735 . . . . . . . . . . 11  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( A. k  e.  i  (
a `  k )  <  ( b `  k
)  <->  A. k  e.  I 
( a `  k
)  <  ( b `  k ) ) )
36 simplr 529 . . . . . . . . . . . . . 14  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  r  =  R )
3736fveq2d 5646 . . . . . . . . . . . . 13  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( 0g `  r )  =  ( 0g `  R ) )
38 mplval.z . . . . . . . . . . . . 13  |-  .0.  =  ( 0g `  R )
3937, 38eqtr4di 2281 . . . . . . . . . . . 12  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( 0g `  r )  =  .0.  )
4039eqeq2d 2242 . . . . . . . . . . 11  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( (
f `  b )  =  ( 0g `  r )  <->  ( f `  b )  =  .0.  ) )
4135, 40imbi12d 234 . . . . . . . . . 10  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( ( A. k  e.  i 
( a `  k
)  <  ( b `  k )  ->  (
f `  b )  =  ( 0g `  r ) )  <->  ( A. k  e.  I  (
a `  k )  <  ( b `  k
)  ->  ( f `  b )  =  .0.  ) ) )
4234, 41raleqbidv 2745 . . . . . . . . 9  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( A. b  e.  ( NN0  ^m  i ) ( A. k  e.  i  (
a `  k )  <  ( b `  k
)  ->  ( f `  b )  =  ( 0g `  r ) )  <->  A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  .0.  )
) )
4334, 42rexeqbidv 2746 . . . . . . . 8  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( E. a  e.  ( NN0  ^m  i ) A. b  e.  ( NN0  ^m  i
) ( A. k  e.  i  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  ( 0g
`  r ) )  <->  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  (
a `  k )  <  ( b `  k
)  ->  ( f `  b )  =  .0.  ) ) )
4432, 43rabeqbidv 2796 . . . . . . 7  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  { f  e.  ( Base `  s
)  |  E. a  e.  ( NN0  ^m  i
) A. b  e.  ( NN0  ^m  i
) ( A. k  e.  i  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  ( 0g
`  r ) ) }  =  { f  e.  B  |  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  .0.  ) } )
4544, 12eqtr4di 2281 . . . . . 6  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  { f  e.  ( Base `  s
)  |  E. a  e.  ( NN0  ^m  i
) A. b  e.  ( NN0  ^m  i
) ( A. k  e.  i  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  ( 0g
`  r ) ) }  =  U )
4630, 45oveq12d 6041 . . . . 5  |-  ( ( ( i  =  I  /\  r  =  R )  /\  s  =  ( i mPwSer  r ) )  ->  ( ss  {
f  e.  ( Base `  s )  |  E. a  e.  ( NN0  ^m  i ) A. b  e.  ( NN0  ^m  i
) ( A. k  e.  i  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  ( 0g
`  r ) ) } )  =  ( Ss  U ) )
4726, 46csbied 3173 . . . 4  |-  ( ( i  =  I  /\  r  =  R )  ->  [_ ( i mPwSer  r
)  /  s ]_ ( ss  { f  e.  (
Base `  s )  |  E. a  e.  ( NN0  ^m  i ) A. b  e.  ( NN0  ^m  i ) ( A. k  e.  i  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  ( 0g
`  r ) ) } )  =  ( Ss  U ) )
48 df-mplcoe 14702 . . . 4  |- mPoly  =  ( i  e.  _V , 
r  e.  _V  |->  [_ ( i mPwSer  r )  /  s ]_ (
ss 
{ f  e.  (
Base `  s )  |  E. a  e.  ( NN0  ^m  i ) A. b  e.  ( NN0  ^m  i ) ( A. k  e.  i  ( a `  k )  <  (
b `  k )  ->  ( f `  b
)  =  ( 0g
`  r ) ) } ) )
4947, 48ovmpoga 6156 . . 3  |-  ( ( I  e.  _V  /\  R  e.  _V  /\  ( Ss  U )  e.  _V )  ->  ( I mPoly  R
)  =  ( Ss  U ) )
503, 5, 21, 49syl3anc 1273 . 2  |-  ( ( I  e.  V  /\  R  e.  W )  ->  ( I mPoly  R )  =  ( Ss  U ) )
511, 50eqtrid 2275 1  |-  ( ( I  e.  V  /\  R  e.  W )  ->  P  =  ( Ss  U ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2201   A.wral 2509   E.wrex 2510   {crab 2513   _Vcvv 2801   [_csb 3126   class class class wbr 4089    X. cxp 4725    Fn wfn 5323   ` cfv 5328  (class class class)co 6023    ^m cmap 6822    < clt 8219   NN0cn0 9407   Basecbs 13105   ↾s cress 13106   0gc0g 13362   mPwSer cmps 14699   mPoly cmpl 14700
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-i2m1 8142
This theorem depends on definitions:  df-bi 117  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-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-pw 3655  df-sn 3676  df-pr 3677  df-tp 3678  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-ov 6026  df-oprab 6027  df-mpo 6028  df-of 6240  df-1st 6308  df-2nd 6309  df-map 6824  df-ixp 6873  df-inn 9149  df-2 9207  df-3 9208  df-4 9209  df-5 9210  df-6 9211  df-7 9212  df-8 9213  df-9 9214  df-n0 9408  df-ndx 13108  df-slot 13109  df-base 13111  df-sets 13112  df-iress 13113  df-plusg 13196  df-mulr 13197  df-sca 13199  df-vsca 13200  df-tset 13202  df-rest 13347  df-topn 13348  df-topgen 13366  df-pt 13367  df-psr 14701  df-mplcoe 14702
This theorem is referenced by:  mplbascoe  14734  mplval2g  14738
  Copyright terms: Public domain W3C validator