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

Theorem resgrpisgrp 13401
Description: If the base set of a group is contained in the base set of another group, and the group operation of the group is the restriction of the group operation of the other group to its base set, then the other group restricted to the base set of the group is a group. (Contributed by AV, 14-Mar-2019.)
Hypotheses
Ref Expression
grpissubg.b  |-  B  =  ( Base `  G
)
grpissubg.s  |-  S  =  ( Base `  H
)
Assertion
Ref Expression
resgrpisgrp  |-  ( ( G  e.  Grp  /\  H  e.  Grp )  ->  ( ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) )  -> 
( Gs  S )  e.  Grp ) )

Proof of Theorem resgrpisgrp
StepHypRef Expression
1 grpissubg.b . . . . 5  |-  B  =  ( Base `  G
)
2 grpissubg.s . . . . 5  |-  S  =  ( Base `  H
)
31, 2grpissubg 13400 . . . 4  |-  ( ( G  e.  Grp  /\  H  e.  Grp )  ->  ( ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) )  ->  S  e.  (SubGrp `  G
) ) )
43imp 124 . . 3  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  S  e.  (SubGrp `  G ) )
5 ibar 301 . . . . . 6  |-  ( ( G  e.  Grp  /\  S  C_  B )  -> 
( ( Gs  S )  e.  Grp  <->  ( ( G  e.  Grp  /\  S  C_  B )  /\  ( Gs  S )  e.  Grp ) ) )
65ad2ant2r 509 . . . . 5  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( ( Gs  S )  e.  Grp  <->  ( ( G  e.  Grp  /\  S  C_  B )  /\  ( Gs  S )  e.  Grp ) ) )
7 df-3an 982 . . . . 5  |-  ( ( G  e.  Grp  /\  S  C_  B  /\  ( Gs  S )  e.  Grp ) 
<->  ( ( G  e. 
Grp  /\  S  C_  B
)  /\  ( Gs  S
)  e.  Grp )
)
86, 7bitr4di 198 . . . 4  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( ( Gs  S )  e.  Grp  <->  ( G  e.  Grp  /\  S  C_  B  /\  ( Gs  S )  e.  Grp ) ) )
91issubg 13379 . . . 4  |-  ( S  e.  (SubGrp `  G
)  <->  ( G  e. 
Grp  /\  S  C_  B  /\  ( Gs  S )  e.  Grp ) )
108, 9bitr4di 198 . . 3  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( ( Gs  S )  e.  Grp  <->  S  e.  (SubGrp `  G ) ) )
114, 10mpbird 167 . 2  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( Gs  S )  e.  Grp )
1211ex 115 1  |-  ( ( G  e.  Grp  /\  H  e.  Grp )  ->  ( ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) )  -> 
( Gs  S )  e.  Grp ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2167    C_ wss 3157    X. cxp 4662    |` cres 4666   ` cfv 5259  (class class class)co 5925   Basecbs 12703   ↾s cress 12704   +g cplusg 12780   Grpcgrp 13202  SubGrpcsubg 13373
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-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-grp 13205  df-minusg 13206  df-subg 13376
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator