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

Theorem 0subg 14002
Description: The zero subgroup of an arbitrary group. (Contributed by Stefan O'Rear, 10-Dec-2014.) (Proof shortened by SN, 31-Jan-2025.)
Hypothesis
Ref Expression
0subg.z  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
0subg  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (SubGrp `  G
) )

Proof of Theorem 0subg
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 grpmnd 13812 . . 3  |-  ( G  e.  Grp  ->  G  e.  Mnd )
2 0subg.z . . . 4  |-  .0.  =  ( 0g `  G )
320subm 13791 . . 3  |-  ( G  e.  Mnd  ->  {  .0.  }  e.  (SubMnd `  G
) )
41, 3syl 14 . 2  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (SubMnd `  G
) )
5 eqid 2238 . . . . 5  |-  ( invg `  G )  =  ( invg `  G )
62, 5grpinvid 13865 . . . 4  |-  ( G  e.  Grp  ->  (
( invg `  G ) `  .0.  )  =  .0.  )
7 eqid 2238 . . . . . . 7  |-  ( Base `  G )  =  (
Base `  G )
87, 2grpidcl 13834 . . . . . 6  |-  ( G  e.  Grp  ->  .0.  e.  ( Base `  G
) )
97, 5grpinvcl 13853 . . . . . 6  |-  ( ( G  e.  Grp  /\  .0.  e.  ( Base `  G
) )  ->  (
( invg `  G ) `  .0.  )  e.  ( Base `  G ) )
108, 9mpdan 425 . . . . 5  |-  ( G  e.  Grp  ->  (
( invg `  G ) `  .0.  )  e.  ( Base `  G ) )
11 elsng 3724 . . . . 5  |-  ( ( ( invg `  G ) `  .0.  )  e.  ( Base `  G )  ->  (
( ( invg `  G ) `  .0.  )  e.  {  .0.  }  <-> 
( ( invg `  G ) `  .0.  )  =  .0.  )
)
1210, 11syl 14 . . . 4  |-  ( G  e.  Grp  ->  (
( ( invg `  G ) `  .0.  )  e.  {  .0.  }  <-> 
( ( invg `  G ) `  .0.  )  =  .0.  )
)
136, 12mpbird 167 . . 3  |-  ( G  e.  Grp  ->  (
( invg `  G ) `  .0.  )  e.  {  .0.  } )
14 fveq2 5695 . . . . . 6  |-  ( a  =  .0.  ->  (
( invg `  G ) `  a
)  =  ( ( invg `  G
) `  .0.  )
)
1514eleq1d 2307 . . . . 5  |-  ( a  =  .0.  ->  (
( ( invg `  G ) `  a
)  e.  {  .0.  }  <-> 
( ( invg `  G ) `  .0.  )  e.  {  .0.  } ) )
1615ralsng 3749 . . . 4  |-  (  .0. 
e.  ( Base `  G
)  ->  ( A. a  e.  {  .0.  }  ( ( invg `  G ) `  a
)  e.  {  .0.  }  <-> 
( ( invg `  G ) `  .0.  )  e.  {  .0.  } ) )
178, 16syl 14 . . 3  |-  ( G  e.  Grp  ->  ( A. a  e.  {  .0.  }  ( ( invg `  G ) `  a
)  e.  {  .0.  }  <-> 
( ( invg `  G ) `  .0.  )  e.  {  .0.  } ) )
1813, 17mpbird 167 . 2  |-  ( G  e.  Grp  ->  A. a  e.  {  .0.  }  (
( invg `  G ) `  a
)  e.  {  .0.  } )
195issubg3 13995 . 2  |-  ( G  e.  Grp  ->  ( {  .0.  }  e.  (SubGrp `  G )  <->  ( {  .0.  }  e.  (SubMnd `  G )  /\  A. a  e.  {  .0.  }  ( ( invg `  G ) `  a
)  e.  {  .0.  } ) ) )
204, 18, 19mpbir2and 957 1  |-  ( G  e.  Grp  ->  {  .0.  }  e.  (SubGrp `  G
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   {csn 3709   ` cfv 5377   Basecbs 13352   0gc0g 13610   Mndcmnd 13729  SubMndcsubmnd 13765   Grpcgrp 13805   invgcminusg 13806  SubGrpcsubg 13970
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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-ltadd 8295
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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-submnd 13767  df-grp 13808  df-minusg 13809  df-subg 13973
This theorem is used by:  0nsg  14017
  Copyright terms: Public domain W3C validator