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

Theorem ghminv 13456
Description: A homomorphism of groups preserves inverses. (Contributed by Stefan O'Rear, 31-Dec-2014.)
Hypotheses
Ref Expression
ghminv.b  |-  B  =  ( Base `  S
)
ghminv.y  |-  M  =  ( invg `  S )
ghminv.z  |-  N  =  ( invg `  T )
Assertion
Ref Expression
ghminv  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  ( M `  X ) )  =  ( N `  ( F `  X )
) )

Proof of Theorem ghminv
StepHypRef Expression
1 ghmgrp1 13451 . . . . . 6  |-  ( F  e.  ( S  GrpHom  T )  ->  S  e.  Grp )
2 ghminv.b . . . . . . 7  |-  B  =  ( Base `  S
)
3 eqid 2196 . . . . . . 7  |-  ( +g  `  S )  =  ( +g  `  S )
4 eqid 2196 . . . . . . 7  |-  ( 0g
`  S )  =  ( 0g `  S
)
5 ghminv.y . . . . . . 7  |-  M  =  ( invg `  S )
62, 3, 4, 5grprinv 13253 . . . . . 6  |-  ( ( S  e.  Grp  /\  X  e.  B )  ->  ( X ( +g  `  S ) ( M `
 X ) )  =  ( 0g `  S ) )
71, 6sylan 283 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( X ( +g  `  S
) ( M `  X ) )  =  ( 0g `  S
) )
87fveq2d 5565 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  ( X
( +g  `  S ) ( M `  X
) ) )  =  ( F `  ( 0g `  S ) ) )
92, 5grpinvcl 13250 . . . . . 6  |-  ( ( S  e.  Grp  /\  X  e.  B )  ->  ( M `  X
)  e.  B )
101, 9sylan 283 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( M `  X )  e.  B )
11 eqid 2196 . . . . . 6  |-  ( +g  `  T )  =  ( +g  `  T )
122, 3, 11ghmlin 13454 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B  /\  ( M `  X )  e.  B )  ->  ( F `  ( X
( +g  `  S ) ( M `  X
) ) )  =  ( ( F `  X ) ( +g  `  T ) ( F `
 ( M `  X ) ) ) )
1310, 12mpd3an3 1349 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  ( X
( +g  `  S ) ( M `  X
) ) )  =  ( ( F `  X ) ( +g  `  T ) ( F `
 ( M `  X ) ) ) )
14 eqid 2196 . . . . . 6  |-  ( 0g
`  T )  =  ( 0g `  T
)
154, 14ghmid 13455 . . . . 5  |-  ( F  e.  ( S  GrpHom  T )  ->  ( F `  ( 0g `  S
) )  =  ( 0g `  T ) )
1615adantr 276 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  ( 0g `  S ) )  =  ( 0g `  T
) )
178, 13, 163eqtr3d 2237 . . 3  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  (
( F `  X
) ( +g  `  T
) ( F `  ( M `  X ) ) )  =  ( 0g `  T ) )
18 ghmgrp2 13452 . . . . 5  |-  ( F  e.  ( S  GrpHom  T )  ->  T  e.  Grp )
1918adantr 276 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  T  e.  Grp )
20 eqid 2196 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
212, 20ghmf 13453 . . . . 5  |-  ( F  e.  ( S  GrpHom  T )  ->  F : B
--> ( Base `  T
) )
2221ffvelcdmda 5700 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  X )  e.  ( Base `  T
) )
2321adantr 276 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  F : B --> ( Base `  T
) )
2423, 10ffvelcdmd 5701 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  ( M `  X ) )  e.  ( Base `  T
) )
25 ghminv.z . . . . 5  |-  N  =  ( invg `  T )
2620, 11, 14, 25grpinvid1 13254 . . . 4  |-  ( ( T  e.  Grp  /\  ( F `  X )  e.  ( Base `  T
)  /\  ( F `  ( M `  X
) )  e.  (
Base `  T )
)  ->  ( ( N `  ( F `  X ) )  =  ( F `  ( M `  X )
)  <->  ( ( F `
 X ) ( +g  `  T ) ( F `  ( M `  X )
) )  =  ( 0g `  T ) ) )
2719, 22, 24, 26syl3anc 1249 . . 3  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  (
( N `  ( F `  X )
)  =  ( F `
 ( M `  X ) )  <->  ( ( F `  X )
( +g  `  T ) ( F `  ( M `  X )
) )  =  ( 0g `  T ) ) )
2817, 27mpbird 167 . 2  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( N `  ( F `  X ) )  =  ( F `  ( M `  X )
) )
2928eqcomd 2202 1  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  X  e.  B )  ->  ( F `  ( M `  X ) )  =  ( N `  ( F `  X )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2167   -->wf 5255   ` cfv 5259  (class class class)co 5925   Basecbs 12703   +g cplusg 12780   0gc0g 12958   Grpcgrp 13202   invgcminusg 13203    GrpHom cghm 13446
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-ghm 13447
This theorem is referenced by:  ghmsub  13457  ghmmulg  13462  ghmrn  13463  ghmpreima  13472  ghmeql  13473
  Copyright terms: Public domain W3C validator