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

Theorem conjsubg 13809
Description: A conjugated subgroup is also a subgroup. (Contributed by Mario Carneiro, 13-Jan-2015.)
Hypotheses
Ref Expression
conjghm.x  |-  X  =  ( Base `  G
)
conjghm.p  |-  .+  =  ( +g  `  G )
conjghm.m  |-  .-  =  ( -g `  G )
conjsubg.f  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
Assertion
Ref Expression
conjsubg  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  ran  F  e.  (SubGrp `  G
) )
Distinct variable groups:    x,  .-    x,  .+    x, A    x, G    x, S    x, X
Allowed substitution hint:    F( x)

Proof of Theorem conjsubg
StepHypRef Expression
1 conjghm.x . . . . 5  |-  X  =  ( Base `  G
)
21subgss 13706 . . . 4  |-  ( S  e.  (SubGrp `  G
)  ->  S  C_  X
)
32adantr 276 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  S  C_  X )
4 df-ima 4731 . . . 4  |-  ( ( x  e.  X  |->  ( ( A  .+  x
)  .-  A )
) " S )  =  ran  ( ( x  e.  X  |->  ( ( A  .+  x
)  .-  A )
)  |`  S )
5 resmpt 5052 . . . . . 6  |-  ( S 
C_  X  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  |`  S )  =  ( x  e.  S  |->  ( ( A 
.+  x )  .-  A ) ) )
6 conjsubg.f . . . . . 6  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
75, 6eqtr4di 2280 . . . . 5  |-  ( S 
C_  X  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  |`  S )  =  F )
87rneqd 4952 . . . 4  |-  ( S 
C_  X  ->  ran  ( ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) )  |`  S )  =  ran  F )
94, 8eqtrid 2274 . . 3  |-  ( S 
C_  X  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) " S
)  =  ran  F
)
103, 9syl 14 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) " S
)  =  ran  F
)
11 subgrcl 13711 . . . . 5  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
12 conjghm.p . . . . . 6  |-  .+  =  ( +g  `  G )
13 conjghm.m . . . . . 6  |-  .-  =  ( -g `  G )
14 eqid 2229 . . . . . 6  |-  ( x  e.  X  |->  ( ( A  .+  x ) 
.-  A ) )  =  ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) )
151, 12, 13, 14conjghm 13808 . . . . 5  |-  ( ( G  e.  Grp  /\  A  e.  X )  ->  ( ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) )  e.  ( G  GrpHom  G )  /\  ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) ) : X -1-1-onto-> X ) )
1611, 15sylan 283 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  e.  ( G  GrpHom  G )  /\  ( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) : X -1-1-onto-> X
) )
1716simpld 112 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
x  e.  X  |->  ( ( A  .+  x
)  .-  A )
)  e.  ( G 
GrpHom  G ) )
18 simpl 109 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  S  e.  (SubGrp `  G )
)
19 ghmima 13797 . . 3  |-  ( ( ( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  e.  ( G  GrpHom  G )  /\  S  e.  (SubGrp `  G
) )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) " S
)  e.  (SubGrp `  G ) )
2017, 18, 19syl2anc 411 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) " S
)  e.  (SubGrp `  G ) )
2110, 20eqeltrrd 2307 1  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  ran  F  e.  (SubGrp `  G
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200    C_ wss 3197    |-> cmpt 4144   ran crn 4719    |` cres 4720   "cima 4721   -1-1-onto->wf1o 5316   ` cfv 5317  (class class class)co 6000   Basecbs 13027   +g cplusg 13105   Grpcgrp 13528   -gcsg 13530  SubGrpcsubg 13699    GrpHom cghm 13772
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-coll 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-pre-ltirr 8107  ax-pre-ltadd 8111
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-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-pnf 8179  df-mnf 8180  df-ltxr 8182  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-sets 13034  df-iress 13035  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-grp 13531  df-minusg 13532  df-sbg 13533  df-subg 13702  df-ghm 13773
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator