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

Theorem mgpress 14230
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 2238 . . . . 5  |-  ( .r
`  R )  =  ( .r `  R
)
31, 2mgpvalg 14220 . . . 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 6100 . 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 14223 . . . 4  |-  ( R  e.  V  ->  M  e.  _V )
7 ressvalsets 13418 . . . 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 2238 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
101, 9mgpbasg 14224 . . . . . . 7  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  M
) )
1110adantr 276 . . . . . 6  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Base `  R
)  =  ( Base `  M ) )
1211ineq2d 3432 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( A  i^i  ( Base `  R ) )  =  ( A  i^i  ( Base `  M )
) )
1312opeq2d 3911 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >.  =  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  M ) )
>. )
1413oveq2d 6101 . . 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 2274 . 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 13418 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1816, 17eqtrid 2283 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1916, 2ressmulrg 13499 . . . . . . 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 2244 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  S
)  =  ( .r
`  R ) )
2221opeq2d 3911 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( +g  `  ndx ) ,  ( .r `  S ) >.  =  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
2318, 22oveq12d 6103 . . 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 13419 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  e.  _V )
2516, 24eqeltrid 2325 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  e.  _V )
26 eqid 2238 . . . . 5  |-  (mulGrp `  S )  =  (mulGrp `  S )
27 eqid 2238 . . . . 5  |-  ( .r
`  S )  =  ( .r `  S
)
2826, 27mgpvalg 14220 . . . 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 13466 . . . . . 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 13408 . . . . 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 13479 . . . . . 6  |-  ( Base `  ndx )  =/=  ( +g  `  ndx )
3736necomi 2505 . . . . 5  |-  ( +g  ` 
ndx )  =/=  ( Base `  ndx )
3837a1i 9 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( +g  `  ndx )  =/=  ( Base `  ndx ) )
39 mulrslid 13486 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
4039slotex 13379 . . . . 5  |-  ( R  e.  V  ->  ( .r `  R )  e. 
_V )
4140adantr 276 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  R
)  e.  _V )
42 inex1g 4269 . . . . 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 13393 . . 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 2281 . 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 2281 1  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  (mulGrp `  S ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821    i^i cin 3219   <.cop 3712   ` cfv 5377  (class class class)co 6085   NNcn 9304   ndxcnx 13349   sSet csts 13350  Slot cslot 13351   Basecbs 13352   ↾s cress 13353   +g cplusg 13431   .rcmulr 13432  mulGrpcmgp 14217
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-mulr 13445  df-mgp 14218
This theorem is used by:  rdivmuldivd  14451  subrgcrng  14533  subrgsubm  14542  resrhm  14556  resrhm2b  14557  zringmpg  14941
  Copyright terms: Public domain W3C validator