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

Theorem invghm 14135
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 2238 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
3 ablgrp 14094 . . 3  |-  ( G  e.  Abel  ->  G  e. 
Grp )
4 invghm.m . . . . 5  |-  I  =  ( invg `  G )
51, 4grpinvf 13854 . . . 4  |-  ( G  e.  Grp  ->  I : B --> B )
63, 5syl 14 . . 3  |-  ( G  e.  Abel  ->  I : B --> B )
71, 2, 4ablinvadd 14116 . . . 4  |-  ( ( G  e.  Abel  /\  x  e.  B  /\  y  e.  B )  ->  (
I `  ( x
( +g  `  G ) y ) )  =  ( ( I `  x ) ( +g  `  G ) ( I `
 y ) ) )
873expb 1235 . . 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 14057 . 2  |-  ( G  e.  Abel  ->  I  e.  ( G  GrpHom  G ) )
10 ghmgrp1 14050 . . 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 537 . . . . . . . 8  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  y  e.  B )
13 simprl 535 . . . . . . . 8  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  x  e.  B )
141, 2, 4grpinvadd 13885 . . . . . . . 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 1278 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( y ( +g  `  G ) x ) )  =  ( ( I `  x ) ( +g  `  G
) ( I `  y ) ) )
1615fveq2d 5699 . . . . . 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 13855 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( I `  x
)  e.  B )
1911, 13, 18syl2anc 415 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  x )  e.  B
)
201, 4grpinvcl 13855 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  y  e.  B )  ->  ( I `  y
)  e.  B )
2111, 12, 20syl2anc 415 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  y )  e.  B
)
221, 2, 2ghmlin 14053 . . . . . . 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 1278 . . . . . 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 13874 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  x  e.  B )  ->  ( I `  (
I `  x )
)  =  x )
2511, 13, 24syl2anc 415 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  x
) )  =  x )
261, 4grpinvinv 13874 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  y  e.  B )  ->  ( I `  (
I `  y )
)  =  y )
2711, 12, 26syl2anc 415 . . . . . . 7  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  y
) )  =  y )
2825, 27oveq12d 6103 . . . . . 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 2275 . . . . 5  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  (
y ( +g  `  G
) x ) ) )  =  ( x ( +g  `  G
) y ) )
301, 2grpcl 13815 . . . . . . 7  |-  ( ( G  e.  Grp  /\  y  e.  B  /\  x  e.  B )  ->  ( y ( +g  `  G ) x )  e.  B )
3111, 12, 13, 30syl3anc 1278 . . . . . 6  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( y
( +g  `  G ) x )  e.  B
)
321, 4grpinvinv 13874 . . . . . 6  |-  ( ( G  e.  Grp  /\  ( y ( +g  `  G ) x )  e.  B )  -> 
( I `  (
I `  ( y
( +g  `  G ) x ) ) )  =  ( y ( +g  `  G ) x ) )
3311, 31, 32syl2anc 415 . . . . 5  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( I `  ( I `  (
y ( +g  `  G
) x ) ) )  =  ( y ( +g  `  G
) x ) )
3429, 33eqtr3d 2273 . . . 4  |-  ( ( I  e.  ( G 
GrpHom  G )  /\  (
x  e.  B  /\  y  e.  B )
)  ->  ( x
( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) )
3534ralrimivva 2632 . . 3  |-  ( I  e.  ( G  GrpHom  G )  ->  A. x  e.  B  A. y  e.  B  ( x
( +g  `  G ) y )  =  ( y ( +g  `  G
) x ) )
361, 2isabl2 14099 . . 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 421 . 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
This proof depends on syntax axioms:    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   -->wf 5373   ` cfv 5377  (class class class)co 6085   Basecbs 13354   +g cplusg 13433   Grpcgrp 13807   invgcminusg 13808    GrpHom cghm 14045   Abelcabl 14090
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-inn 9306  df-2 9364  df-ndx 13357  df-slot 13358  df-base 13360  df-plusg 13446  df-0g 13614  df-mgm 13678  df-sgrp 13719  df-mnd 13732  df-grp 13810  df-minusg 13811  df-ghm 14046  df-cmn 14091  df-abl 14092
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator