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

Theorem issubgrpd 13974
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 13973 . . 3  |-  ( ph  ->  D  e.  (SubGrp `  I ) )
10 eqid 2238 . . . 4  |-  ( Is  D )  =  ( Is  D )
1110subggrp 13960 . . 3  |-  ( D  e.  (SubGrp `  I
)  ->  ( Is  D
)  e.  Grp )
129, 11syl 14 . 2  |-  ( ph  ->  ( Is  D )  e.  Grp )
131, 12eqeltrd 2315 1  |-  ( ph  ->  S  e.  Grp )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209    C_ wss 3220   ` cfv 5375  (class class class)co 6078   Basecbs 13333   ↾s cress 13334   +g cplusg 13411   0gc0g 13590   Grpcgrp 13785   invgcminusg 13786  SubGrpcsubg 13950
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 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 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8263  ax-resscn 8264  ax-1cn 8265  ax-1re 8266  ax-icn 8267  ax-addcl 8268  ax-addrcl 8269  ax-mulcl 8270  ax-addcom 8272  ax-addass 8274  ax-i2m1 8277  ax-0lt1 8278  ax-0id 8280  ax-rnegex 8281  ax-pre-ltirr 8284  ax-pre-ltadd 8288
This theorem 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 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6031  df-ov 6081  df-oprab 6082  df-mpo 6083  df-pnf 8355  df-mnf 8356  df-ltxr 8358  df-inn 9287  df-2 9345  df-ndx 13336  df-slot 13337  df-base 13339  df-sets 13340  df-iress 13341  df-plusg 13424  df-0g 13592  df-mgm 13656  df-sgrp 13697  df-mnd 13710  df-grp 13788  df-minusg 13789  df-subg 13953
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator