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

Theorem grpid 13821
Description: Two ways of saying that an element of a group is the identity element. Provides a convenient way to compute the value of the identity element. (Contributed by NM, 24-Aug-2011.)
Hypotheses
Ref Expression
grpinveu.b  |-  B  =  ( Base `  G
)
grpinveu.p  |-  .+  =  ( +g  `  G )
grpinveu.o  |-  .0.  =  ( 0g `  G )
Assertion
Ref Expression
grpid  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( X  .+  X )  =  X  <-> 
.0.  =  X ) )

Proof of Theorem grpid
StepHypRef Expression
1 eqcom 2240 . 2  |-  (  .0.  =  X  <->  X  =  .0.  )
2 grpinveu.b . . . . . . 7  |-  B  =  ( Base `  G
)
3 grpinveu.o . . . . . . 7  |-  .0.  =  ( 0g `  G )
42, 3grpidcl 13811 . . . . . 6  |-  ( G  e.  Grp  ->  .0.  e.  B )
5 grpinveu.p . . . . . . . 8  |-  .+  =  ( +g  `  G )
62, 5grprcan 13819 . . . . . . 7  |-  ( ( G  e.  Grp  /\  ( X  e.  B  /\  .0.  e.  B  /\  X  e.  B )
)  ->  ( ( X  .+  X )  =  (  .0.  .+  X
)  <->  X  =  .0.  ) )
763exp2 1256 . . . . . 6  |-  ( G  e.  Grp  ->  ( X  e.  B  ->  (  .0.  e.  B  -> 
( X  e.  B  ->  ( ( X  .+  X )  =  (  .0.  .+  X )  <->  X  =  .0.  ) ) ) ) )
84, 7mpid 42 . . . . 5  |-  ( G  e.  Grp  ->  ( X  e.  B  ->  ( X  e.  B  -> 
( ( X  .+  X )  =  (  .0.  .+  X )  <->  X  =  .0.  ) ) ) )
98pm2.43d 50 . . . 4  |-  ( G  e.  Grp  ->  ( X  e.  B  ->  ( ( X  .+  X
)  =  (  .0.  .+  X )  <->  X  =  .0.  ) ) )
109imp 124 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( X  .+  X )  =  (  .0.  .+  X )  <->  X  =  .0.  ) )
112, 5, 3grplid 13813 . . . 4  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  (  .0.  .+  X
)  =  X )
1211eqeq2d 2250 . . 3  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( X  .+  X )  =  (  .0.  .+  X )  <->  ( X  .+  X )  =  X ) )
1310, 12bitr3d 190 . 2  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( X  =  .0.  <->  ( X  .+  X )  =  X ) )
141, 13bitr2id 193 1  |-  ( ( G  e.  Grp  /\  X  e.  B )  ->  ( ( X  .+  X )  =  X  <-> 
.0.  =  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   0gc0g 13587   Grpcgrp 13782
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-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-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-grp 13785
This theorem is referenced by:  isgrpid2  13822  grpidd2  13823  subg0  13960  qus0  14015  ghmid  14029  lmod0vid  14629  cnfld0  14880  psr0  15000
  Copyright terms: Public domain W3C validator