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

Theorem resgrpisgrp 14057
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
) ) )  -> 
( G ↾s  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 14056 . . . 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 )  -> 
( ( G ↾s  S )  e.  Grp  <->  ( ( G  e.  Grp  /\  S  C_  B )  /\  ( G ↾s  S )  e.  Grp ) ) )
65ad2ant2r 513 . . . . 5  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( ( G ↾s  S )  e.  Grp  <->  ( ( G  e.  Grp  /\  S  C_  B )  /\  ( G ↾s  S )  e.  Grp ) ) )
7 df-3an 1011 . . . . 5  |-  ( ( G  e.  Grp  /\  S  C_  B  /\  ( G ↾s  S )  e.  Grp ) 
<->  ( ( G  e. 
Grp  /\  S  C_  B
)  /\  ( G ↾s  S
)  e.  Grp )
)
86, 7bitr4di 198 . . . 4  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( ( G ↾s  S )  e.  Grp  <->  ( G  e.  Grp  /\  S  C_  B  /\  ( G ↾s  S )  e.  Grp ) ) )
91issubg 14035 . . . 4  |-  ( S  e.  (SubGrp `  G
)  <->  ( G  e. 
Grp  /\  S  C_  B  /\  ( G ↾s  S )  e.  Grp ) )
108, 9bitr4di 198 . . 3  |-  ( ( ( G  e.  Grp  /\  H  e.  Grp )  /\  ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) ) )  ->  ( ( G ↾s  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
) ) ) )  ->  ( G ↾s  S )  e.  Grp )
1211ex 115 1  |-  ( ( G  e.  Grp  /\  H  e.  Grp )  ->  ( ( S  C_  B  /\  ( +g  `  H
)  =  ( ( +g  `  G )  |`  ( S  X.  S
) ) )  -> 
( G ↾s  S )  e.  Grp ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220    X. cxp 4774    |` cres 4778   ` cfv 5380  (class class class)co 6088   Basecbs 13410   ↾s cress 13411   +g cplusg 13490   Grpcgrp 13864  SubGrpcsubg 14029
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-subg 14032
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator