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

Theorem ghmlin 13965
Description: A homomorphism of groups is linear. (Contributed by Stefan O'Rear, 31-Dec-2014.)
Hypotheses
Ref Expression
ghmlin.x  |-  X  =  ( Base `  S
)
ghmlin.a  |-  .+  =  ( +g  `  S )
ghmlin.b  |-  .+^  =  ( +g  `  T )
Assertion
Ref Expression
ghmlin  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  X  /\  V  e.  X )  ->  ( F `  ( U  .+  V ) )  =  ( ( F `  U )  .+^  ( F `
 V ) ) )

Proof of Theorem ghmlin
Dummy variables  a  b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ghmlin.x . . . . . 6  |-  X  =  ( Base `  S
)
2 eqid 2232 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
3 ghmlin.a . . . . . 6  |-  .+  =  ( +g  `  S )
4 ghmlin.b . . . . . 6  |-  .+^  =  ( +g  `  T )
51, 2, 3, 4isghm 13960 . . . . 5  |-  ( F  e.  ( S  GrpHom  T )  <->  ( ( S  e.  Grp  /\  T  e.  Grp )  /\  ( F : X --> ( Base `  T )  /\  A. a  e.  X  A. b  e.  X  ( F `  ( a  .+  b ) )  =  ( ( F `  a )  .+^  ( F `
 b ) ) ) ) )
65simprbi 275 . . . 4  |-  ( F  e.  ( S  GrpHom  T )  ->  ( F : X --> ( Base `  T
)  /\  A. a  e.  X  A. b  e.  X  ( F `  ( a  .+  b
) )  =  ( ( F `  a
)  .+^  ( F `  b ) ) ) )
76simprd 114 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  A. a  e.  X  A. b  e.  X  ( F `  ( a  .+  b
) )  =  ( ( F `  a
)  .+^  ( F `  b ) ) )
8 fvoveq1 6073 . . . . 5  |-  ( a  =  U  ->  ( F `  ( a  .+  b ) )  =  ( F `  ( U  .+  b ) ) )
9 fveq2 5670 . . . . . 6  |-  ( a  =  U  ->  ( F `  a )  =  ( F `  U ) )
109oveq1d 6065 . . . . 5  |-  ( a  =  U  ->  (
( F `  a
)  .+^  ( F `  b ) )  =  ( ( F `  U )  .+^  ( F `
 b ) ) )
118, 10eqeq12d 2247 . . . 4  |-  ( a  =  U  ->  (
( F `  (
a  .+  b )
)  =  ( ( F `  a ) 
.+^  ( F `  b ) )  <->  ( F `  ( U  .+  b
) )  =  ( ( F `  U
)  .+^  ( F `  b ) ) ) )
12 oveq2 6058 . . . . . 6  |-  ( b  =  V  ->  ( U  .+  b )  =  ( U  .+  V
) )
1312fveq2d 5674 . . . . 5  |-  ( b  =  V  ->  ( F `  ( U  .+  b ) )  =  ( F `  ( U  .+  V ) ) )
14 fveq2 5670 . . . . . 6  |-  ( b  =  V  ->  ( F `  b )  =  ( F `  V ) )
1514oveq2d 6066 . . . . 5  |-  ( b  =  V  ->  (
( F `  U
)  .+^  ( F `  b ) )  =  ( ( F `  U )  .+^  ( F `
 V ) ) )
1613, 15eqeq12d 2247 . . . 4  |-  ( b  =  V  ->  (
( F `  ( U  .+  b ) )  =  ( ( F `
 U )  .+^  ( F `  b ) )  <->  ( F `  ( U  .+  V ) )  =  ( ( F `  U ) 
.+^  ( F `  V ) ) ) )
1711, 16rspc2v 2934 . . 3  |-  ( ( U  e.  X  /\  V  e.  X )  ->  ( A. a  e.  X  A. b  e.  X  ( F `  ( a  .+  b
) )  =  ( ( F `  a
)  .+^  ( F `  b ) )  -> 
( F `  ( U  .+  V ) )  =  ( ( F `
 U )  .+^  ( F `  V ) ) ) )
187, 17mpan9 281 . 2  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  ( U  e.  X  /\  V  e.  X )
)  ->  ( F `  ( U  .+  V
) )  =  ( ( F `  U
)  .+^  ( F `  V ) ) )
19183impb 1226 1  |-  ( ( F  e.  ( S 
GrpHom  T )  /\  U  e.  X  /\  V  e.  X )  ->  ( F `  ( U  .+  V ) )  =  ( ( F `  U )  .+^  ( F `
 V ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2203   A.wral 2520   -->wf 5348   ` cfv 5352  (class class class)co 6050   Basecbs 13212   +g cplusg 13290   Grpcgrp 13713    GrpHom cghm 13957
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-inn 9238  df-ndx 13215  df-slot 13216  df-base 13218  df-ghm 13958
This theorem is referenced by:  ghmid  13966  ghminv  13967  ghmsub  13968  ghmmhm  13970  ghmrn  13974  resghm  13977  ghmpreima  13983  ghmnsgima  13985  ghmnsgpreima  13986  ghmf1o  13992  invghm  14046  rhmopp  14321
  Copyright terms: Public domain W3C validator