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

Theorem ghmsub 13918
Description: Linearity of subtraction through a group homomorphism. (Contributed by Stefan O'Rear, 31-Dec-2014.)
Hypotheses
Ref Expression
ghmsub.b  |-  B  =  ( Base `  S
)
ghmsub.m  |-  .-  =  ( -g `  S )
ghmsub.n  |-  N  =  ( -g `  T
)
Assertion
Ref Expression
ghmsub  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  ( F `  ( U  .-  V ) )  =  ( ( F `  U ) N ( F `  V ) ) )

Proof of Theorem ghmsub
StepHypRef Expression
1 ghmgrp1 13912 . . . . . 6  |-  ( F  e.  ( S  GrpHom  T )  ->  S  e.  Grp )
213ad2ant1 1045 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  S  e.  Grp )
3 simp3 1026 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  V  e.  B )
4 ghmsub.b . . . . . 6  |-  B  =  ( Base `  S
)
5 eqid 2231 . . . . . 6  |-  ( invg `  S )  =  ( invg `  S )
64, 5grpinvcl 13711 . . . . 5  |-  ( ( S  e.  Grp  /\  V  e.  B )  ->  ( ( invg `  S ) `  V
)  e.  B )
72, 3, 6syl2anc 411 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  (
( invg `  S ) `  V
)  e.  B )
8 eqid 2231 . . . . 5  |-  ( +g  `  S )  =  ( +g  `  S )
9 eqid 2231 . . . . 5  |-  ( +g  `  T )  =  ( +g  `  T )
104, 8, 9ghmlin 13915 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  (
( invg `  S ) `  V
)  e.  B )  ->  ( F `  ( U ( +g  `  S
) ( ( invg `  S ) `
 V ) ) )  =  ( ( F `  U ) ( +g  `  T
) ( F `  ( ( invg `  S ) `  V
) ) ) )
117, 10syld3an3 1319 . . 3  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  ( F `  ( U
( +g  `  S ) ( ( invg `  S ) `  V
) ) )  =  ( ( F `  U ) ( +g  `  T ) ( F `
 ( ( invg `  S ) `
 V ) ) ) )
12 eqid 2231 . . . . . 6  |-  ( invg `  T )  =  ( invg `  T )
134, 5, 12ghminv 13917 . . . . 5  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  V  e.  B )  ->  ( F `  ( ( invg `  S ) `
 V ) )  =  ( ( invg `  T ) `
 ( F `  V ) ) )
14133adant2 1043 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  ( F `  ( ( invg `  S ) `
 V ) )  =  ( ( invg `  T ) `
 ( F `  V ) ) )
1514oveq2d 6044 . . 3  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  (
( F `  U
) ( +g  `  T
) ( F `  ( ( invg `  S ) `  V
) ) )  =  ( ( F `  U ) ( +g  `  T ) ( ( invg `  T
) `  ( F `  V ) ) ) )
1611, 15eqtrd 2264 . 2  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  ( F `  ( U
( +g  `  S ) ( ( invg `  S ) `  V
) ) )  =  ( ( F `  U ) ( +g  `  T ) ( ( invg `  T
) `  ( F `  V ) ) ) )
17 ghmsub.m . . . . 5  |-  .-  =  ( -g `  S )
184, 8, 5, 17grpsubval 13709 . . . 4  |-  ( ( U  e.  B  /\  V  e.  B )  ->  ( U  .-  V
)  =  ( U ( +g  `  S
) ( ( invg `  S ) `
 V ) ) )
1918fveq2d 5652 . . 3  |-  ( ( U  e.  B  /\  V  e.  B )  ->  ( F `  ( U  .-  V ) )  =  ( F `  ( U ( +g  `  S
) ( ( invg `  S ) `
 V ) ) ) )
20193adant1 1042 . 2  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  ( F `  ( U  .-  V ) )  =  ( F `  ( U ( +g  `  S
) ( ( invg `  S ) `
 V ) ) ) )
21 eqid 2231 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
224, 21ghmf 13914 . . . . 5  |-  ( F  e.  ( S  GrpHom  T )  ->  F : B
--> ( Base `  T
) )
23 ffvelcdm 5788 . . . . . 6  |-  ( ( F : B --> ( Base `  T )  /\  U  e.  B )  ->  ( F `  U )  e.  ( Base `  T
) )
24 ffvelcdm 5788 . . . . . 6  |-  ( ( F : B --> ( Base `  T )  /\  V  e.  B )  ->  ( F `  V )  e.  ( Base `  T
) )
2523, 24anim12dan 604 . . . . 5  |-  ( ( F : B --> ( Base `  T )  /\  ( U  e.  B  /\  V  e.  B )
)  ->  ( ( F `  U )  e.  ( Base `  T
)  /\  ( F `  V )  e.  (
Base `  T )
) )
2622, 25sylan 283 . . . 4  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  ( U  e.  B  /\  V  e.  B )
)  ->  ( ( F `  U )  e.  ( Base `  T
)  /\  ( F `  V )  e.  (
Base `  T )
) )
27263impb 1226 . . 3  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  (
( F `  U
)  e.  ( Base `  T )  /\  ( F `  V )  e.  ( Base `  T
) ) )
28 ghmsub.n . . . 4  |-  N  =  ( -g `  T
)
2921, 9, 12, 28grpsubval 13709 . . 3  |-  ( ( ( F `  U
)  e.  ( Base `  T )  /\  ( F `  V )  e.  ( Base `  T
) )  ->  (
( F `  U
) N ( F `
 V ) )  =  ( ( F `
 U ) ( +g  `  T ) ( ( invg `  T ) `  ( F `  V )
) ) )
3027, 29syl 14 . 2  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  (
( F `  U
) N ( F `
 V ) )  =  ( ( F `
 U ) ( +g  `  T ) ( ( invg `  T ) `  ( F `  V )
) ) )
3116, 20, 303eqtr4d 2274 1  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  B  /\  V  e.  B )  ->  ( F `  ( U  .-  V ) )  =  ( ( F `  U ) N ( F `  V ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2202   -->wf 5329   ` cfv 5333  (class class class)co 6028   Basecbs 13162   +g cplusg 13240   Grpcgrp 13663   invgcminusg 13664   -gcsg 13665    GrpHom cghm 13907
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-inn 9203  df-2 9261  df-ndx 13165  df-slot 13166  df-base 13168  df-plusg 13253  df-0g 13421  df-mgm 13519  df-sgrp 13565  df-mnd 13580  df-grp 13666  df-minusg 13667  df-sbg 13668  df-ghm 13908
This theorem is referenced by:  ghmnsgima  13935  ghmnsgpreima  13936  ghmeqker  13938  ghmf1  13940
  Copyright terms: Public domain W3C validator