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

Theorem mgpress 13934
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 2229 . . . . 5  |-  ( .r
`  R )  =  ( .r `  R
)
31, 2mgpvalg 13926 . . . 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 6028 . 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 13928 . . . 4  |-  ( R  e.  V  ->  M  e.  _V )
7 ressvalsets 13137 . . . 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 2229 . . . . . . . 8  |-  ( Base `  R )  =  (
Base `  R )
101, 9mgpbasg 13929 . . . . . . 7  |-  ( R  e.  V  ->  ( Base `  R )  =  ( Base `  M
) )
1110adantr 276 . . . . . 6  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Base `  R
)  =  ( Base `  M ) )
1211ineq2d 3406 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( A  i^i  ( Base `  R ) )  =  ( A  i^i  ( Base `  M )
) )
1312opeq2d 3867 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >.  =  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  M ) )
>. )
1413oveq2d 6029 . . 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 2265 . 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 13137 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1816, 17eqtrid 2274 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  =  ( R sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  R
) ) >. )
)
1916, 2ressmulrg 13218 . . . . . . 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 2235 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  S
)  =  ( .r
`  R ) )
2221opeq2d 3867 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  -> 
<. ( +g  `  ndx ) ,  ( .r `  S ) >.  =  <. ( +g  `  ndx ) ,  ( .r `  R ) >. )
2318, 22oveq12d 6031 . . 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 13138 . . . . 5  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Rs  A )  e.  _V )
2516, 24eqeltrid 2316 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  S  e.  _V )
26 eqid 2229 . . . . 5  |-  (mulGrp `  S )  =  (mulGrp `  S )
27 eqid 2229 . . . . 5  |-  ( .r
`  S )  =  ( .r `  S
)
2826, 27mgpvalg 13926 . . . 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 13185 . . . . . 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 13128 . . . . 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 13198 . . . . . 6  |-  ( Base `  ndx )  =/=  ( +g  `  ndx )
3736necomi 2485 . . . . 5  |-  ( +g  ` 
ndx )  =/=  ( Base `  ndx )
3837a1i 9 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( +g  `  ndx )  =/=  ( Base `  ndx ) )
39 mulrslid 13205 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
4039slotex 13099 . . . . 5  |-  ( R  e.  V  ->  ( .r `  R )  e. 
_V )
4140adantr 276 . . . 4  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( .r `  R
)  e.  _V )
42 inex1g 4223 . . . . 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 13113 . . 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 2272 . 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 2272 1  |-  ( ( R  e.  V  /\  A  e.  W )  ->  ( Ms  A )  =  (mulGrp `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200    =/= wne 2400   _Vcvv 2800    i^i cin 3197   <.cop 3670   ` cfv 5324  (class class class)co 6013   NNcn 9133   ndxcnx 13069   sSet csts 13070  Slot cslot 13071   Basecbs 13072   ↾s cress 13073   +g cplusg 13150   .rcmulr 13151  mulGrpcmgp 13923
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-inn 9134  df-2 9192  df-3 9193  df-ndx 13075  df-slot 13076  df-base 13078  df-sets 13079  df-iress 13080  df-plusg 13163  df-mulr 13164  df-mgp 13924
This theorem is referenced by:  rdivmuldivd  14148  subrgcrng  14229  subrgsubm  14238  resrhm  14252  resrhm2b  14253  zringmpg  14610
  Copyright terms: Public domain W3C validator