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

Theorem issubgrpd 13728
Description: Prove a subgroup by closure. (Contributed by Stefan O'Rear, 7-Dec-2014.)
Hypotheses
Ref Expression
issubgrpd.s  |-  ( ph  ->  S  =  ( Is  D ) )
issubgrpd.z  |-  ( ph  ->  .0.  =  ( 0g
`  I ) )
issubgrpd.p  |-  ( ph  ->  .+  =  ( +g  `  I ) )
issubgrpd.ss  |-  ( ph  ->  D  C_  ( Base `  I ) )
issubgrpd.zcl  |-  ( ph  ->  .0.  e.  D )
issubgrpd.acl  |-  ( (
ph  /\  x  e.  D  /\  y  e.  D
)  ->  ( x  .+  y )  e.  D
)
issubgrpd.ncl  |-  ( (
ph  /\  x  e.  D )  ->  (
( invg `  I ) `  x
)  e.  D )
issubgrpd.g  |-  ( ph  ->  I  e.  Grp )
Assertion
Ref Expression
issubgrpd  |-  ( ph  ->  S  e.  Grp )
Distinct variable groups:    x, y,  .0.    x, D, y    x, I, y    x,  .+ , y    ph, x, y    x, S, y

Proof of Theorem issubgrpd
StepHypRef Expression
1 issubgrpd.s . 2  |-  ( ph  ->  S  =  ( Is  D ) )
2 issubgrpd.z . . . 4  |-  ( ph  ->  .0.  =  ( 0g
`  I ) )
3 issubgrpd.p . . . 4  |-  ( ph  ->  .+  =  ( +g  `  I ) )
4 issubgrpd.ss . . . 4  |-  ( ph  ->  D  C_  ( Base `  I ) )
5 issubgrpd.zcl . . . 4  |-  ( ph  ->  .0.  e.  D )
6 issubgrpd.acl . . . 4  |-  ( (
ph  /\  x  e.  D  /\  y  e.  D
)  ->  ( x  .+  y )  e.  D
)
7 issubgrpd.ncl . . . 4  |-  ( (
ph  /\  x  e.  D )  ->  (
( invg `  I ) `  x
)  e.  D )
8 issubgrpd.g . . . 4  |-  ( ph  ->  I  e.  Grp )
91, 2, 3, 4, 5, 6, 7, 8issubgrpd2 13727 . . 3  |-  ( ph  ->  D  e.  (SubGrp `  I ) )
10 eqid 2229 . . . 4  |-  ( Is  D )  =  ( Is  D )
1110subggrp 13714 . . 3  |-  ( D  e.  (SubGrp `  I
)  ->  ( Is  D
)  e.  Grp )
129, 11syl 14 . 2  |-  ( ph  ->  ( Is  D )  e.  Grp )
131, 12eqeltrd 2306 1  |-  ( ph  ->  S  e.  Grp )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    = wceq 1395    e. wcel 2200    C_ wss 3197   ` cfv 5318  (class class class)co 6001   Basecbs 13032   ↾s cress 13033   +g cplusg 13110   0gc0g 13289   Grpcgrp 13533   invgcminusg 13534  SubGrpcsubg 13704
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-pre-ltirr 8111  ax-pre-ltadd 8115
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-ltxr 8186  df-inn 9111  df-2 9169  df-ndx 13035  df-slot 13036  df-base 13038  df-sets 13039  df-iress 13040  df-plusg 13123  df-0g 13291  df-mgm 13389  df-sgrp 13435  df-mnd 13450  df-grp 13536  df-minusg 13537  df-subg 13707
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator