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

Theorem resgrpisgrp 13929
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 13928 . . . 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 1007 . . . . 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 13907 . . . 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 1005    = wceq 1398    e. wcel 2205    C_ wss 3213    X. cxp 4749    |` cres 4753   ` cfv 5354  (class class class)co 6052   Basecbs 13229   ↾s cress 13230   +g cplusg 13307   Grpcgrp 13730  SubGrpcsubg 13901
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-pre-ltirr 8241  ax-pre-ltadd 8245
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-pnf 8312  df-mnf 8313  df-ltxr 8315  df-inn 9240  df-2 9298  df-ndx 13232  df-slot 13233  df-base 13235  df-sets 13236  df-iress 13237  df-plusg 13320  df-0g 13488  df-mgm 13586  df-sgrp 13632  df-mnd 13647  df-grp 13733  df-minusg 13734  df-subg 13904
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator