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

Theorem resghm2b 13468
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 13451 . . 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 13451 . . 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 13402 . . . . . 6  |-  ( X  e.  (SubGrp `  T
)  ->  X  e.  (SubMnd `  T ) )
6 resghm2.u . . . . . . 7  |-  U  =  ( Ts  X )
76resmhm2b 13191 . . . . . 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 13385 . . . . . . 7  |-  ( X  e.  (SubGrp `  T
)  ->  T  e.  Grp )
1110adantr 276 . . . . . 6  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  ->  T  e.  Grp )
12 ghmmhmb 13460 . . . . . 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 13383 . . . . . . 7  |-  ( X  e.  (SubGrp `  T
)  ->  U  e.  Grp )
1615adantr 276 . . . . . 6  |-  ( ( X  e.  (SubGrp `  T )  /\  ran  F 
C_  X )  ->  U  e.  Grp )
17 ghmmhmb 13460 . . . . . 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 4665   ` cfv 5259  (class class class)co 5925   ↾s cress 12704   MndHom cmhm 13159  SubMndcsubmnd 13160   Grpcgrp 13202  SubGrpcsubg 13373    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-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-ltadd 8012
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 3452  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-1st 6207  df-2nd 6208  df-map 6718  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-mhm 13161  df-submnd 13162  df-grp 13205  df-minusg 13206  df-subg 13376  df-ghm 13447
This theorem is referenced by:  ghmghmrn  13469  resrhm2b  13881
  Copyright terms: Public domain W3C validator