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

Theorem mplsubgfileminv 14847
Description: Lemma for mplsubgfi 14848. The additive inverse of a polynomial is a polynomial. (Contributed by Jim Kingdon, 26-Nov-2025.)
Hypotheses
Ref Expression
mplsubg.s  |-  S  =  ( I mPwSer  R )
mplsubg.p  |-  P  =  ( I mPoly  R )
mplsubg.u  |-  U  =  ( Base `  P
)
mplsubg.i  |-  ( ph  ->  I  e.  Fin )
mplsubg.r  |-  ( ph  ->  R  e.  Grp )
mplsubgfileminv.x  |-  ( ph  ->  X  e.  U )
mplsubgfileminv.inv  |-  N  =  ( invg `  S )
Assertion
Ref Expression
mplsubgfileminv  |-  ( ph  ->  ( N `  X
)  e.  U )

Proof of Theorem mplsubgfileminv
Dummy variables  a  b  k  f are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mplsubg.s . . . 4  |-  S  =  ( I mPwSer  R )
2 mplsubg.i . . . 4  |-  ( ph  ->  I  e.  Fin )
3 mplsubg.r . . . 4  |-  ( ph  ->  R  e.  Grp )
4 eqid 2232 . . . 4  |-  { f  e.  ( NN0  ^m  I )  |  ( `' f " NN )  e.  Fin }  =  { f  e.  ( NN0  ^m  I )  |  ( `' f
" NN )  e. 
Fin }
5 eqid 2232 . . . 4  |-  ( invg `  R )  =  ( invg `  R )
6 eqid 2232 . . . 4  |-  ( Base `  S )  =  (
Base `  S )
7 mplsubgfileminv.inv . . . 4  |-  N  =  ( invg `  S )
8 mplsubg.p . . . . . 6  |-  P  =  ( I mPoly  R )
9 mplsubg.u . . . . . 6  |-  U  =  ( Base `  P
)
108, 1, 9, 6mplbasss 14843 . . . . 5  |-  U  C_  ( Base `  S )
11 mplsubgfileminv.x . . . . 5  |-  ( ph  ->  X  e.  U )
1210, 11sselid 3235 . . . 4  |-  ( ph  ->  X  e.  ( Base `  S ) )
131, 2, 3, 4, 5, 6, 7, 12psrneg 14834 . . 3  |-  ( ph  ->  ( N `  X
)  =  ( ( invg `  R
)  o.  X ) )
141, 2, 3, 4, 5, 6, 12psrnegcl 14830 . . 3  |-  ( ph  ->  ( ( invg `  R )  o.  X
)  e.  ( Base `  S ) )
1513, 14eqeltrd 2309 . 2  |-  ( ph  ->  ( N `  X
)  e.  ( Base `  S ) )
16 eqid 2232 . . . . . . 7  |-  ( 0g
`  R )  =  ( 0g `  R
)
178, 1, 6, 16, 9mplelbascoe 14839 . . . . . 6  |-  ( ( I  e.  Fin  /\  R  e.  Grp )  ->  ( X  e.  U  <->  ( X  e.  ( Base `  S )  /\  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( X `  b
)  =  ( 0g
`  R ) ) ) ) )
182, 3, 17syl2anc 411 . . . . 5  |-  ( ph  ->  ( X  e.  U  <->  ( X  e.  ( Base `  S )  /\  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( X `  b
)  =  ( 0g
`  R ) ) ) ) )
1911, 18mpbid 147 . . . 4  |-  ( ph  ->  ( X  e.  (
Base `  S )  /\  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( X `  b
)  =  ( 0g
`  R ) ) ) )
2019simprd 114 . . 3  |-  ( ph  ->  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( X `  b
)  =  ( 0g
`  R ) ) )
2113fveq1d 5671 . . . . . . . . 9  |-  ( ph  ->  ( ( N `  X ) `  b
)  =  ( ( ( invg `  R )  o.  X
) `  b )
)
2221ad2antrr 488 . . . . . . . 8  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( N `  X ) `  b
)  =  ( ( ( invg `  R )  o.  X
) `  b )
)
23 eqid 2232 . . . . . . . . . . 11  |-  ( Base `  R )  =  (
Base `  R )
241, 23, 2, 6, 12psrelbasfi 14823 . . . . . . . . . 10  |-  ( ph  ->  X : ( NN0 
^m  I ) --> (
Base `  R )
)
2524ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  ->  X : ( NN0  ^m  I ) --> ( Base `  R ) )
26 simplr 529 . . . . . . . . 9  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
b  e.  ( NN0 
^m  I ) )
27 fvco3 5747 . . . . . . . . 9  |-  ( ( X : ( NN0 
^m  I ) --> (
Base `  R )  /\  b  e.  ( NN0  ^m  I ) )  ->  ( ( ( invg `  R
)  o.  X ) `
 b )  =  ( ( invg `  R ) `  ( X `  b )
) )
2825, 26, 27syl2anc 411 . . . . . . . 8  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( ( invg `  R )  o.  X ) `  b )  =  ( ( invg `  R ) `  ( X `  b )
) )
29 simpr 110 . . . . . . . . . 10  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( X `  b
)  =  ( 0g
`  R ) )
3029fveq2d 5673 . . . . . . . . 9  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( invg `  R ) `  ( X `  b )
)  =  ( ( invg `  R
) `  ( 0g `  R ) ) )
3116, 5grpinvid 13765 . . . . . . . . . . 11  |-  ( R  e.  Grp  ->  (
( invg `  R ) `  ( 0g `  R ) )  =  ( 0g `  R ) )
323, 31syl 14 . . . . . . . . . 10  |-  ( ph  ->  ( ( invg `  R ) `  ( 0g `  R ) )  =  ( 0g `  R ) )
3332ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( invg `  R ) `  ( 0g `  R ) )  =  ( 0g `  R ) )
3430, 33eqtrd 2265 . . . . . . . 8  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( invg `  R ) `  ( X `  b )
)  =  ( 0g
`  R ) )
3522, 28, 343eqtrd 2269 . . . . . . 7  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( N `  X ) `  b
)  =  ( 0g
`  R ) )
3635ex 115 . . . . . 6  |-  ( (
ph  /\  b  e.  ( NN0  ^m  I ) )  ->  ( ( X `  b )  =  ( 0g `  R )  ->  (
( N `  X
) `  b )  =  ( 0g `  R ) ) )
3736imim2d 54 . . . . 5  |-  ( (
ph  /\  b  e.  ( NN0  ^m  I ) )  ->  ( ( A. k  e.  I 
( a `  k
)  <  ( b `  k )  ->  ( X `  b )  =  ( 0g `  R ) )  -> 
( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( ( N `  X ) `  b
)  =  ( 0g
`  R ) ) ) )
3837ralimdva 2609 . . . 4  |-  ( ph  ->  ( A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( X `  b
)  =  ( 0g
`  R ) )  ->  A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( ( N `  X ) `  b
)  =  ( 0g
`  R ) ) ) )
3938reximdv 2643 . . 3  |-  ( ph  ->  ( E. a  e.  ( NN0  ^m  I
) A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( X `  b
)  =  ( 0g
`  R ) )  ->  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( ( N `  X ) `  b
)  =  ( 0g
`  R ) ) ) )
4020, 39mpd 13 . 2  |-  ( ph  ->  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I ) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( ( N `  X ) `  b
)  =  ( 0g
`  R ) ) )
418, 1, 6, 16, 9mplelbascoe 14839 . . 3  |-  ( ( I  e.  Fin  /\  R  e.  Grp )  ->  ( ( N `  X )  e.  U  <->  ( ( N `  X
)  e.  ( Base `  S )  /\  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( ( N `  X ) `  b
)  =  ( 0g
`  R ) ) ) ) )
422, 3, 41syl2anc 411 . 2  |-  ( ph  ->  ( ( N `  X )  e.  U  <->  ( ( N `  X
)  e.  ( Base `  S )  /\  E. a  e.  ( NN0  ^m  I ) A. b  e.  ( NN0  ^m  I
) ( A. k  e.  I  ( a `  k )  <  (
b `  k )  ->  ( ( N `  X ) `  b
)  =  ( 0g
`  R ) ) ) ) )
4315, 40, 42mpbir2and 953 1  |-  ( ph  ->  ( N `  X
)  e.  U )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2203   A.wral 2520   E.wrex 2521   {crab 2524   class class class wbr 4108   `'ccnv 4747   "cima 4751    o. ccom 4752   -->wf 5347   ` cfv 5351  (class class class)co 6049    ^m cmap 6881   Fincfn 6974    < clt 8307   NNcn 9236   NN0cn0 9495   Basecbs 13204   0gc0g 13461   Grpcgrp 13705   invgcminusg 13706   mPwSer cmps 14801   mPoly cmpl 14802
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-addcom 8226  ax-mulcom 8227  ax-addass 8228  ax-mulass 8229  ax-distr 8230  ax-i2m1 8231  ax-0lt1 8232  ax-1rid 8233  ax-0id 8234  ax-rnegex 8235  ax-cnre 8237  ax-pre-ltirr 8238  ax-pre-ltwlin 8239  ax-pre-lttrn 8240  ax-pre-apti 8241  ax-pre-ltadd 8242
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-tp 3696  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-of 6265  df-1st 6333  df-2nd 6334  df-1o 6646  df-er 6766  df-map 6883  df-ixp 6933  df-en 6975  df-fin 6977  df-sup 7274  df-pnf 8309  df-mnf 8310  df-xr 8311  df-ltxr 8312  df-le 8313  df-sub 8445  df-neg 8446  df-inn 9237  df-2 9295  df-3 9296  df-4 9297  df-5 9298  df-6 9299  df-7 9300  df-8 9301  df-9 9302  df-n0 9496  df-z 9577  df-dec 9709  df-uz 9853  df-fz 10342  df-struct 13206  df-ndx 13207  df-slot 13208  df-base 13210  df-sets 13211  df-iress 13212  df-plusg 13295  df-mulr 13296  df-sca 13298  df-vsca 13299  df-ip 13300  df-tset 13301  df-ple 13302  df-ds 13304  df-hom 13306  df-cco 13307  df-rest 13446  df-topn 13447  df-0g 13463  df-topgen 13465  df-pt 13466  df-prds 13472  df-pws 13495  df-mgm 13561  df-sgrp 13607  df-mnd 13622  df-grp 13708  df-minusg 13709  df-psr 14803  df-mplcoe 14804
This theorem is referenced by:  mplsubgfi  14848
  Copyright terms: Public domain W3C validator