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

Theorem mplsubgfileminv 14577
Description: Lemma for mplsubgfi 14578. 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 2207 . . . 4  |-  { f  e.  ( NN0  ^m  I )  |  ( `' f " NN )  e.  Fin }  =  { f  e.  ( NN0  ^m  I )  |  ( `' f
" NN )  e. 
Fin }
5 eqid 2207 . . . 4  |-  ( invg `  R )  =  ( invg `  R )
6 eqid 2207 . . . 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 14573 . . . . 5  |-  U  C_  ( Base `  S )
11 mplsubgfileminv.x . . . . 5  |-  ( ph  ->  X  e.  U )
1210, 11sselid 3199 . . . 4  |-  ( ph  ->  X  e.  ( Base `  S ) )
131, 2, 3, 4, 5, 6, 7, 12psrneg 14564 . . 3  |-  ( ph  ->  ( N `  X
)  =  ( ( invg `  R
)  o.  X ) )
141, 2, 3, 4, 5, 6, 12psrnegcl 14560 . . 3  |-  ( ph  ->  ( ( invg `  R )  o.  X
)  e.  ( Base `  S ) )
1513, 14eqeltrd 2284 . 2  |-  ( ph  ->  ( N `  X
)  e.  ( Base `  S ) )
16 eqid 2207 . . . . . . 7  |-  ( 0g
`  R )  =  ( 0g `  R
)
178, 1, 6, 16, 9mplelbascoe 14569 . . . . . 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 5601 . . . . . . . . 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 2207 . . . . . . . . . . 11  |-  ( Base `  R )  =  (
Base `  R )
241, 23, 2, 6, 12psrelbasfi 14553 . . . . . . . . . 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 528 . . . . . . . . 9  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
b  e.  ( NN0 
^m  I ) )
27 fvco3 5673 . . . . . . . . 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 5603 . . . . . . . . 9  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( invg `  R ) `  ( X `  b )
)  =  ( ( invg `  R
) `  ( 0g `  R ) ) )
3116, 5grpinvid 13507 . . . . . . . . . . 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 2240 . . . . . . . 8  |-  ( ( ( ph  /\  b  e.  ( NN0  ^m  I
) )  /\  ( X `  b )  =  ( 0g `  R ) )  -> 
( ( invg `  R ) `  ( X `  b )
)  =  ( 0g
`  R ) )
3522, 28, 343eqtrd 2244 . . . . . . 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 2575 . . . 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 2609 . . 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 14569 . . 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 947 1  |-  ( ph  ->  ( N `  X
)  e.  U )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2178   A.wral 2486   E.wrex 2487   {crab 2490   class class class wbr 4059   `'ccnv 4692   "cima 4696    o. ccom 4697   -->wf 5286   ` cfv 5290  (class class class)co 5967    ^m cmap 6758   Fincfn 6850    < clt 8142   NNcn 9071   NN0cn0 9330   Basecbs 12947   0gc0g 13203   Grpcgrp 13447   invgcminusg 13448   mPwSer cmps 14538   mPoly cmpl 14539
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-if 3580  df-pw 3628  df-sn 3649  df-pr 3650  df-tp 3651  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-iord 4431  df-on 4433  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-of 6181  df-1st 6249  df-2nd 6250  df-1o 6525  df-er 6643  df-map 6760  df-ixp 6809  df-en 6851  df-fin 6853  df-sup 7112  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-inn 9072  df-2 9130  df-3 9131  df-4 9132  df-5 9133  df-6 9134  df-7 9135  df-8 9136  df-9 9137  df-n0 9331  df-z 9408  df-dec 9540  df-uz 9684  df-fz 10166  df-struct 12949  df-ndx 12950  df-slot 12951  df-base 12953  df-sets 12954  df-iress 12955  df-plusg 13037  df-mulr 13038  df-sca 13040  df-vsca 13041  df-ip 13042  df-tset 13043  df-ple 13044  df-ds 13046  df-hom 13048  df-cco 13049  df-rest 13188  df-topn 13189  df-0g 13205  df-topgen 13207  df-pt 13208  df-prds 13214  df-pws 13237  df-mgm 13303  df-sgrp 13349  df-mnd 13364  df-grp 13450  df-minusg 13451  df-psr 14540  df-mplcoe 14541
This theorem is referenced by:  mplsubgfi  14578
  Copyright terms: Public domain W3C validator