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

Theorem invghm 13399
Description: The inversion map is a group automorphism if and only if the group is abelian. (In general it is only a group homomorphism into the opposite group, but in an abelian group the opposite group coincides with the group itself.) (Contributed by Mario Carneiro, 4-May-2015.)
Hypotheses
Ref Expression
invghm.b  |-  B  =  ( Base `  G
)
invghm.m  |-  I  =  ( invg `  G )
Assertion
Ref Expression
invghm  |-  ( G  e.  Abel  <->  I  e.  ( G  GrpHom  G ) )

Proof of Theorem invghm
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 invghm.b . . 3  |-  B  =  ( Base `  G
)
2 eqid 2193 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
3 ablgrp 13359 . . 3  |-  ( G  e.  Abel  ->  G  e. 
Grp )
4 invghm.m . . . . 5  |-  I  =  ( invg `  G )
51, 4grpinvf 13119 . . . 4  |-  ( G  e.  Grp  ->  I : B --> B )
63, 5syl 14 . . 3  |-  ( G  e.  Abel  ->  I : B --> B )
71, 2, 4ablinvadd 13380 . . . 4  |-  ( ( G  e.  Abel  /\  x  e.  B  /\  y  e.  B )  ->  (
I `  ( x
( +g  `  G ) y ) )  =  ( ( I `  x ) ( +g  `  G ) ( I `
 y ) ) )
873expb 1206 . . 3  |-  ( ( G  e.  Abel  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( x ( +g  `  G ) y ) )  =  ( ( I `  x ) ( +g  `  G
) ( I `  y ) ) )
91, 1, 2, 2, 3, 3, 6, 8isghmd 13322 . 2  |-  ( G  e.  Abel  ->  I  e.  ( G  GrpHom  G ) )
10 ghmgrp1 13315 . . 3  |-  ( I  e.  ( G  GrpHom  G )  ->  G  e.  Grp )
1110adantr 276 . . . . . . . 8  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  G  e.  Grp )
12 simprr 531 . . . . . . . 8  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  y  e.  B )
13 simprl 529 . . . . . . . 8  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  x  e.  B )
141, 2, 4grpinvadd 13150 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  y  e.  B  /\  x  e.  B )  ->  ( I `  (
y ( +g  `  G
) x ) )  =  ( ( I `
 x ) ( +g  `  G ) ( I `  y
) ) )
1511, 12, 13, 14syl3anc 1249 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( y ( +g  `  G ) x ) )  =  ( ( I `  x ) ( +g  `  G
) ( I `  y ) ) )
1615fveq2d 5558 . . . . . 6  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  (
y ( +g  `  G
) x ) ) )  =  ( I `
 ( ( I `
 x ) ( +g  `  G ) ( I `  y
) ) ) )
17 simpl 109 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  I  e.  ( G  GrpHom  G ) )
181, 4grpinvcl 13120 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( I `  x
)  e.  B )
1911, 13, 18syl2anc 411 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  x )  e.  B
)
201, 4grpinvcl 13120 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  y  e.  B )  ->  ( I `  y
)  e.  B )
2111, 12, 20syl2anc 411 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  y )  e.  B
)
221, 2, 2ghmlin 13318 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
I `  x )  e.  B  /\  (
I `  y )  e.  B )  ->  (
I `  ( (
I `  x )
( +g  `  G ) ( I `  y
) ) )  =  ( ( I `  ( I `  x
) ) ( +g  `  G ) ( I `
 ( I `  y ) ) ) )
2317, 19, 21, 22syl3anc 1249 . . . . . 6  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( ( I `  x ) ( +g  `  G ) ( I `
 y ) ) )  =  ( ( I `  ( I `
 x ) ) ( +g  `  G
) ( I `  ( I `  y
) ) ) )
241, 4grpinvinv 13139 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( I `  (
I `  x )
)  =  x )
2511, 13, 24syl2anc 411 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  x
) )  =  x )
261, 4grpinvinv 13139 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  y  e.  B )  ->  ( I `  (
I `  y )
)  =  y )
2711, 12, 26syl2anc 411 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  y
) )  =  y )
2825, 27oveq12d 5936 . . . . . 6  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( (
I `  ( I `  x ) ) ( +g  `  G ) ( I `  (
I `  y )
) )  =  ( x ( +g  `  G
) y ) )
2916, 23, 283eqtrd 2230 . . . . 5  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  (
y ( +g  `  G
) x ) ) )  =  ( x ( +g  `  G
) y ) )
301, 2grpcl 13080 . . . . . . 7  |-  ( ( G  e.  Grp  /\  y  e.  B  /\  x  e.  B )  ->  ( y ( +g  `  G ) x )  e.  B )
3111, 12, 13, 30syl3anc 1249 . . . . . 6  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( y
( +g  `  G ) x )  e.  B
)
321, 4grpinvinv 13139 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( y ( +g  `  G ) x )  e.  B )  -> 
( I `  (
I `  ( y
( +g  `  G ) x ) ) )  =  ( y ( +g  `  G ) x ) )
3311, 31, 32syl2anc 411 . . . . 5  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  (
y ( +g  `  G
) x ) ) )  =  ( y ( +g  `  G
) x ) )
3429, 33eqtr3d 2228 . . . 4  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( x
( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) )
3534ralrimivva 2576 . . 3  |-  ( I  e.  ( G  GrpHom  G )  ->  A. x  e.  B  A. y  e.  B  ( x
( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) )
361, 2isabl2 13364 . . 3  |-  ( G  e.  Abel  <->  ( G  e. 
Grp  /\  A. x  e.  B  A. y  e.  B  ( x
( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) ) )
3710, 35, 36sylanbrc 417 . 2  |-  ( I  e.  ( G  GrpHom  G )  ->  G  e.  Abel )
389, 37impbii 126 1  |-  ( G  e.  Abel  <->  I  e.  ( G  GrpHom  G ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2164   A.wral 2472   -->wf 5250   ` cfv 5254  (class class class)co 5918   Basecbs 12618   +g cplusg 12695   Grpcgrp 13072   invgcminusg 13073    GrpHom cghm 13310   Abelcabl 13355
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075  df-minusg 13076  df-ghm 13311  df-cmn 13356  df-abl 13357
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator