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

Theorem resghm2b 13392
Description: Restriction of the codomain of a homomorphism. (Contributed by Mario Carneiro, 13-Jan-2015.) (Revised by Mario Carneiro, 18-Jun-2015.)
Hypothesis
Ref Expression
resghm2.u  |-  U  =  ( Ts  X )
Assertion
Ref Expression
resghm2b  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  -> 
( F  e.  ( S  GrpHom  T )  <->  F  e.  ( S  GrpHom  U ) ) )

Proof of Theorem resghm2b
StepHypRef Expression
1 ghmgrp1 13375 . . 3  |-  ( F  e.  ( S  GrpHom  T )  ->  S  e.  Grp )
21a1i 9 . 2  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  -> 
( F  e.  ( S  GrpHom  T )  ->  S  e.  Grp )
)
3 ghmgrp1 13375 . . 3  |-  ( F  e.  ( S  GrpHom  U )  ->  S  e.  Grp )
43a1i 9 . 2  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  -> 
( F  e.  ( S  GrpHom  U )  ->  S  e.  Grp )
)
5 subgsubm 13326 . . . . . 6  |-  ( X  e.  (SubGrp `  T
)  ->  X  e.  (SubMnd `  T ) )
6 resghm2.u . . . . . . 7  |-  U  =  ( Ts  X )
76resmhm2b 13121 . . . . . 6  |-  ( ( X  e.  (SubMnd `  T )  /\  ran  F 
C_  X )  -> 
( F  e.  ( S MndHom  T )  <->  F  e.  ( S MndHom  U ) ) )
85, 7sylan 283 . . . . 5  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  -> 
( F  e.  ( S MndHom  T )  <->  F  e.  ( S MndHom  U ) ) )
98adantl 277 . . . 4  |-  ( ( S  e.  Grp  /\  ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X ) )  ->  ( F  e.  ( S MndHom  T )  <-> 
F  e.  ( S MndHom  U ) ) )
10 subgrcl 13309 . . . . . . 7  |-  ( X  e.  (SubGrp `  T
)  ->  T  e.  Grp )
1110adantr 276 . . . . . 6  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  ->  T  e.  Grp )
12 ghmmhmb 13384 . . . . . 6  |-  ( ( S  e.  Grp  /\  T  e.  Grp )  ->  ( S  GrpHom  T )  =  ( S MndHom  T
) )
1311, 12sylan2 286 . . . . 5  |-  ( ( S  e.  Grp  /\  ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X ) )  ->  ( S  GrpHom  T )  =  ( S MndHom  T ) )
1413eleq2d 2266 . . . 4  |-  ( ( S  e.  Grp  /\  ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X ) )  ->  ( F  e.  ( S  GrpHom  T )  <-> 
F  e.  ( S MndHom  T ) ) )
156subggrp 13307 . . . . . . 7  |-  ( X  e.  (SubGrp `  T
)  ->  U  e.  Grp )
1615adantr 276 . . . . . 6  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  ->  U  e.  Grp )
17 ghmmhmb 13384 . . . . . 6  |-  ( ( S  e.  Grp  /\  U  e.  Grp )  ->  ( S  GrpHom  U )  =  ( S MndHom  U
) )
1816, 17sylan2 286 . . . . 5  |-  ( ( S  e.  Grp  /\  ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X ) )  ->  ( S  GrpHom  U )  =  ( S MndHom  U ) )
1918eleq2d 2266 . . . 4  |-  ( ( S  e.  Grp  /\  ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X ) )  ->  ( F  e.  ( S  GrpHom  U )  <-> 
F  e.  ( S MndHom  U ) ) )
209, 14, 193bitr4d 220 . . 3  |-  ( ( S  e.  Grp  /\  ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X ) )  ->  ( F  e.  ( S  GrpHom  T )  <-> 
F  e.  ( S 
GrpHom  U ) ) )
2120expcom 116 . 2  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  -> 
( S  e.  Grp  ->  ( F  e.  ( S  GrpHom  T )  <->  F  e.  ( S  GrpHom  U ) ) ) )
222, 4, 21pm5.21ndd 706 1  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  -> 
( F  e.  ( S  GrpHom  T )  <->  F  e.  ( S  GrpHom  U ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2167    C_ wss 3157   ran crn 4664   ` cfv 5258  (class class class)co 5922   ↾s cress 12679   MndHom cmhm 13089  SubMndcsubmnd 13090   Grpcgrp 13132  SubGrpcsubg 13297    GrpHom cghm 13370
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 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-pre-ltirr 7991  ax-pre-ltadd 7995
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-nel 2463  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-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-map 6709  df-pnf 8063  df-mnf 8064  df-ltxr 8066  df-inn 8991  df-2 9049  df-ndx 12681  df-slot 12682  df-base 12684  df-sets 12685  df-iress 12686  df-plusg 12768  df-0g 12929  df-mgm 12999  df-sgrp 13045  df-mnd 13058  df-mhm 13091  df-submnd 13092  df-grp 13135  df-minusg 13136  df-subg 13300  df-ghm 13371
This theorem is referenced by:  ghmghmrn  13393  resrhm2b  13805
  Copyright terms: Public domain W3C validator