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

Theorem mgpress 13563
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 2196 . . . . 5  |-  ( .r
`  R )  =  ( .r `  R
)
31, 2mgpvalg 13555 . . . 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 5940 . 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 13557 . . . 4  |-  ( R  e.  V  ->  M  e.  _V )
7 ressvalsets 12767 . . . 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 2196 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
101, 9mgpbasg 13558 . . . . . . 7  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  M
) )
1110adantr 276 . . . . . 6  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Base `  R
)  =  ( Base `  M ) )
1211ineq2d 3365 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( A  i^i  ( Base `  R ) )  =  ( A  i^i  ( Base `  M )
) )
1312opeq2d 3816 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >.  =  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  M ) )
>. )
1413oveq2d 5941 . . 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 2232 . 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 12767 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1816, 17eqtrid 2241 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1916, 2ressmulrg 12847 . . . . . . 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 2202 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  S
)  =  ( .r
`  R ) )
2221opeq2d 3816 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( +g  `  ndx ) ,  ( .r `  S ) >.  =  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
2318, 22oveq12d 5943 . . 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 12768 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  e.  _V )
2516, 24eqeltrid 2283 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  e.  _V )
26 eqid 2196 . . . . 5  |-  (mulGrp `  S )  =  (mulGrp `  S )
27 eqid 2196 . . . . 5  |-  ( .r
`  S )  =  ( .r `  S
)
2826, 27mgpvalg 13555 . . . 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 12815 . . . . . 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 12759 . . . . 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 12827 . . . . . 6  |-  ( Base `  ndx )  =/=  ( +g  `  ndx )
3736necomi 2452 . . . . 5  |-  ( +g  ` 
ndx )  =/=  ( Base `  ndx )
3837a1i 9 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( +g  `  ndx )  =/=  ( Base `  ndx ) )
39 mulrslid 12834 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
4039slotex 12730 . . . . 5  |-  ( R  e.  V  ->  ( .r `  R )  e. 
_V )
4140adantr 276 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  R
)  e.  _V )
42 inex1g 4170 . . . . 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 12744 . . 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 2239 . 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 2239 1  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  (mulGrp `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167    =/= wne 2367   _Vcvv 2763    i^i cin 3156   <.cop 3626   ` cfv 5259  (class class class)co 5925   NNcn 9007   ndxcnx 12700   sSet csts 12701  Slot cslot 12702   Basecbs 12703   ↾s cress 12704   +g cplusg 12780   .rcmulr 12781  mulGrpcmgp 13552
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-lttrn 8010  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-mulr 12794  df-mgp 13553
This theorem is referenced by:  rdivmuldivd  13776  subrgcrng  13857  subrgsubm  13866  resrhm  13880  resrhm2b  13881  zringmpg  14238
  Copyright terms: Public domain W3C validator