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

Theorem conjsubgen 14081
Description: A conjugated subgroup is equinumerous to the original subgroup. (Contributed by Mario Carneiro, 18-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
conjsubgen  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  S  ~~  ran  F )
Distinct variable groups:    x,  .-    x,  .+    x, A    x, G    x, S    x, X
Allowed substitution hint:    F( x)

Proof of Theorem conjsubgen
StepHypRef Expression
1 subgrcl 13982 . . . . . . 7  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
2 conjghm.x . . . . . . . 8  |-  X  =  ( Base `  G
)
3 conjghm.p . . . . . . . 8  |-  .+  =  ( +g  `  G )
4 conjghm.m . . . . . . . 8  |-  .-  =  ( -g `  G )
5 eqid 2238 . . . . . . . 8  |-  ( x  e.  X  |->  ( ( A  .+  x ) 
.-  A ) )  =  ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) )
62, 3, 4, 5conjghm 14079 . . . . . . 7  |-  ( ( 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 ) )
71, 6sylan 283 . . . . . 6  |-  ( ( 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
) )
8 f1of1 5638 . . . . . 6  |-  ( ( x  e.  X  |->  ( ( A  .+  x
)  .-  A )
) : X -1-1-onto-> X  -> 
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) : X -1-1-> X )
97, 8simpl2im 390 . . . . 5  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
x  e.  X  |->  ( ( A  .+  x
)  .-  A )
) : X -1-1-> X
)
102subgss 13977 . . . . . 6  |-  ( S  e.  (SubGrp `  G
)  ->  S  C_  X
)
1110adantr 276 . . . . 5  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  S  C_  X )
12 f1ssres 5607 . . . . 5  |-  ( ( ( x  e.  X  |->  ( ( A  .+  x )  .-  A
) ) : X -1-1-> X  /\  S  C_  X
)  ->  ( (
x  e.  X  |->  ( ( A  .+  x
)  .-  A )
)  |`  S ) : S -1-1-> X )
139, 11, 12syl2anc 415 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  |`  S ) : S -1-1-> X )
1411resmptd 5114 . . . . . 6  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  |`  S )  =  ( x  e.  S  |->  ( ( A 
.+  x )  .-  A ) ) )
15 conjsubg.f . . . . . 6  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
1614, 15eqtr4di 2289 . . . . 5  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  |`  S )  =  F )
17 f1eq1 5593 . . . . 5  |-  ( ( ( x  e.  X  |->  ( ( A  .+  x )  .-  A
) )  |`  S )  =  F  ->  (
( ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) )  |`  S ) : S -1-1-> X  <-> 
F : S -1-1-> X
) )
1816, 17syl 14 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  (
( ( x  e.  X  |->  ( ( A 
.+  x )  .-  A ) )  |`  S ) : S -1-1-> X  <-> 
F : S -1-1-> X
) )
1913, 18mpbid 147 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  F : S -1-1-> X )
20 f1f1orn 5650 . . 3  |-  ( F : S -1-1-> X  ->  F : S -1-1-onto-> ran  F )
2119, 20syl 14 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  F : S -1-1-onto-> ran  F )
22 f1oeng 7043 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  F : S -1-1-onto-> ran  F )  ->  S  ~~  ran  F )
2321, 22syldan 282 1  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  ->  S  ~~  ran  F )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    C_ wss 3220   class class class wbr 4130    |-> cmpt 4192   ran crn 4775    |` cres 4776   -1-1->wf1 5374   -1-1-onto->wf1o 5376   ` cfv 5377  (class class class)co 6085    ~~ cen 7020   Basecbs 13352   +g cplusg 13431   Grpcgrp 13805   -gcsg 13807  SubGrpcsubg 13970    GrpHom cghm 14043
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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
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-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-en 7023  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809  df-sbg 13810  df-subg 13973  df-ghm 14044
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator