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

Theorem mgpress 14075
Description: Subgroup commutes with the multiplicative group operator. (Contributed by Mario Carneiro, 10-Jan-2015.) (Proof shortened by AV, 18-Oct-2024.)
Hypotheses
Ref Expression
mgpress.1  |-  S  =  ( Rs  A )
mgpress.2  |-  M  =  (mulGrp `  R )
Assertion
Ref Expression
mgpress  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  (mulGrp `  S ) )

Proof of Theorem mgpress
StepHypRef Expression
1 mgpress.2 . . . . 5  |-  M  =  (mulGrp `  R )
2 eqid 2232 . . . . 5  |-  ( .r
`  R )  =  ( .r `  R
)
31, 2mgpvalg 14067 . . . 4  |-  ( R  e.  V  ->  M  =  ( R sSet  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
)
43adantr 276 . . 3  |-  ( ( R  e.  V  /\  A  e.  W )  ->  M  =  ( R sSet  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
)
54oveq1d 6065 . 2  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( M sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) )
>. )  =  (
( R sSet  <. ( +g  ` 
ndx ) ,  ( .r `  R )
>. ) sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) ) >.
) )
61mgpex 14069 . . . 4  |-  ( R  e.  V  ->  M  e.  _V )
7 ressvalsets 13277 . . . 4  |-  ( ( M  e.  _V  /\  A  e.  W )  ->  ( Ms  A )  =  ( M sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  M
) ) >. )
)
86, 7sylan 283 . . 3  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  ( M sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  M
) ) >. )
)
9 eqid 2232 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
101, 9mgpbasg 14070 . . . . . . 7  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  M
) )
1110adantr 276 . . . . . 6  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Base `  R
)  =  ( Base `  M ) )
1211ineq2d 3422 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( A  i^i  ( Base `  R ) )  =  ( A  i^i  ( Base `  M )
) )
1312opeq2d 3890 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >.  =  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  M ) )
>. )
1413oveq2d 6066 . . 3  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( M sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) )
>. )  =  ( M sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  M
) ) >. )
)
158, 14eqtr4d 2268 . 2  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  ( M sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
16 mgpress.1 . . . . 5  |-  S  =  ( Rs  A )
17 ressvalsets 13277 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1816, 17eqtrid 2277 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1916, 2ressmulrg 13358 . . . . . . 7  |-  ( ( A  e.  W  /\  R  e.  V )  ->  ( .r `  R
)  =  ( .r
`  S ) )
2019ancoms 268 . . . . . 6  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  R
)  =  ( .r
`  S ) )
2120eqcomd 2238 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  S
)  =  ( .r
`  R ) )
2221opeq2d 3890 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( +g  `  ndx ) ,  ( .r `  S ) >.  =  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
2318, 22oveq12d 6068 . . 3  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( S sSet  <. ( +g  `  ndx ) ,  ( .r `  S
) >. )  =  ( ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) )
>. ) sSet  <. ( +g  ` 
ndx ) ,  ( .r `  R )
>. ) )
24 ressex 13278 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  e.  _V )
2516, 24eqeltrid 2319 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  e.  _V )
26 eqid 2232 . . . . 5  |-  (mulGrp `  S )  =  (mulGrp `  S )
27 eqid 2232 . . . . 5  |-  ( .r
`  S )  =  ( .r `  S
)
2826, 27mgpvalg 14067 . . . 4  |-  ( S  e.  _V  ->  (mulGrp `  S )  =  ( S sSet  <. ( +g  `  ndx ) ,  ( .r `  S ) >. )
)
2925, 28syl 14 . . 3  |-  ( ( R  e.  V  /\  A  e.  W )  ->  (mulGrp `  S )  =  ( S sSet  <. ( +g  `  ndx ) ,  ( .r `  S ) >. )
)
30 plusgslid 13325 . . . . . 6  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
3130simpri 113 . . . . 5  |-  ( +g  ` 
ndx )  e.  NN
3231a1i 9 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( +g  `  ndx )  e.  NN )
33 basendxnn 13268 . . . . 5  |-  ( Base `  ndx )  e.  NN
3433a1i 9 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Base `  ndx )  e.  NN )
35 simpl 109 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  R  e.  V )
36 basendxnplusgndx 13338 . . . . . 6  |-  ( Base `  ndx )  =/=  ( +g  `  ndx )
3736necomi 2497 . . . . 5  |-  ( +g  ` 
ndx )  =/=  ( Base `  ndx )
3837a1i 9 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( +g  `  ndx )  =/=  ( Base `  ndx ) )
39 mulrslid 13345 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
4039slotex 13239 . . . . 5  |-  ( R  e.  V  ->  ( .r `  R )  e. 
_V )
4140adantr 276 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  R
)  e.  _V )
42 inex1g 4246 . . . . 5  |-  ( A  e.  W  ->  ( A  i^i  ( Base `  R
) )  e.  _V )
4342adantl 277 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( A  i^i  ( Base `  R ) )  e.  _V )
4432, 34, 35, 38, 41, 43setscomd 13253 . . 3  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( ( R sSet  <. ( +g  `  ndx ) ,  ( .r `  R ) >. ) sSet  <.
( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) )
>. )  =  (
( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) ) >.
) sSet  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
)
4523, 29, 443eqtr4d 2275 . 2  |-  ( ( R  e.  V  /\  A  e.  W )  ->  (mulGrp `  S )  =  ( ( R sSet  <. ( +g  `  ndx ) ,  ( .r `  R ) >. ) sSet  <.
( Base `  ndx ) ,  ( A  i^i  ( Base `  R ) )
>. ) )
465, 15, 453eqtr4d 2275 1  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  (mulGrp `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203    =/= wne 2412   _Vcvv 2813    i^i cin 3210   <.cop 3692   ` cfv 5352  (class class class)co 6050   NNcn 9237   ndxcnx 13209   sSet csts 13210  Slot cslot 13211   Basecbs 13212   ↾s cress 13213   +g cplusg 13290   .rcmulr 13291  mulGrpcmgp 14064
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-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  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-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-3 9297  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-iress 13220  df-plusg 13303  df-mulr 13304  df-mgp 14065
This theorem is referenced by:  rdivmuldivd  14289  subrgcrng  14370  subrgsubm  14379  resrhm  14393  resrhm2b  14394  zringmpg  14754
  Copyright terms: Public domain W3C validator