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

Theorem resgrpisgrp 13127
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 13126 . . . 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 13105 . . . 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 2160    C_ wss 3144    X. cxp 4639    |` cres 4643   ` cfv 5232  (class class class)co 5892   Basecbs 12507   ↾s cress 12508   +g cplusg 12582   Grpcgrp 12938  SubGrpcsubg 13099
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-cnex 7927  ax-resscn 7928  ax-1cn 7929  ax-1re 7930  ax-icn 7931  ax-addcl 7932  ax-addrcl 7933  ax-mulcl 7934  ax-addcom 7936  ax-addass 7938  ax-i2m1 7941  ax-0lt1 7942  ax-0id 7944  ax-rnegex 7945  ax-pre-ltirr 7948  ax-pre-ltadd 7952
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4308  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5234  df-fn 5235  df-f 5236  df-f1 5237  df-fo 5238  df-f1o 5239  df-fv 5240  df-riota 5848  df-ov 5895  df-oprab 5896  df-mpo 5897  df-pnf 8019  df-mnf 8020  df-ltxr 8022  df-inn 8945  df-2 9003  df-ndx 12510  df-slot 12511  df-base 12513  df-sets 12514  df-iress 12515  df-plusg 12595  df-0g 12756  df-mgm 12825  df-sgrp 12858  df-mnd 12871  df-grp 12941  df-minusg 12942  df-subg 13102
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator