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

Theorem grpidd2 12744
Description: Deduce the identity element of a group from its properties. Useful in conjunction with isgrpd 12729. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
grpidd2.b  |-  ( ph  ->  B  =  ( Base `  G ) )
grpidd2.p  |-  ( ph  ->  .+  =  ( +g  `  G ) )
grpidd2.z  |-  ( ph  ->  .0.  e.  B )
grpidd2.i  |-  ( (
ph  /\  x  e.  B )  ->  (  .0.  .+  x )  =  x )
grpidd2.j  |-  ( ph  ->  G  e.  Grp )
Assertion
Ref Expression
grpidd2  |-  ( ph  ->  .0.  =  ( 0g
`  G ) )
Distinct variable groups:    x, B    x,  .+    ph, x    x,  .0.
Allowed substitution hint:    G( x)

Proof of Theorem grpidd2
StepHypRef Expression
1 grpidd2.p . . . . 5  |-  ( ph  ->  .+  =  ( +g  `  G ) )
21oveqd 5870 . . . 4  |-  ( ph  ->  (  .0.  .+  .0.  )  =  (  .0.  ( +g  `  G )  .0.  ) )
3 oveq2 5861 . . . . . 6  |-  ( x  =  .0.  ->  (  .0.  .+  x )  =  (  .0.  .+  .0.  ) )
4 id 19 . . . . . 6  |-  ( x  =  .0.  ->  x  =  .0.  )
53, 4eqeq12d 2185 . . . . 5  |-  ( x  =  .0.  ->  (
(  .0.  .+  x
)  =  x  <->  (  .0.  .+  .0.  )  =  .0.  ) )
6 grpidd2.i . . . . . 6  |-  ( (
ph  /\  x  e.  B )  ->  (  .0.  .+  x )  =  x )
76ralrimiva 2543 . . . . 5  |-  ( ph  ->  A. x  e.  B  (  .0.  .+  x )  =  x )
8 grpidd2.z . . . . 5  |-  ( ph  ->  .0.  e.  B )
95, 7, 8rspcdva 2839 . . . 4  |-  ( ph  ->  (  .0.  .+  .0.  )  =  .0.  )
102, 9eqtr3d 2205 . . 3  |-  ( ph  ->  (  .0.  ( +g  `  G )  .0.  )  =  .0.  )
11 grpidd2.j . . . 4  |-  ( ph  ->  G  e.  Grp )
12 grpidd2.b . . . . 5  |-  ( ph  ->  B  =  ( Base `  G ) )
138, 12eleqtrd 2249 . . . 4  |-  ( ph  ->  .0.  e.  ( Base `  G ) )
14 eqid 2170 . . . . 5  |-  ( Base `  G )  =  (
Base `  G )
15 eqid 2170 . . . . 5  |-  ( +g  `  G )  =  ( +g  `  G )
16 eqid 2170 . . . . 5  |-  ( 0g
`  G )  =  ( 0g `  G
)
1714, 15, 16grpid 12742 . . . 4  |-  ( ( G  e.  Grp  /\  .0.  e.  ( Base `  G
) )  ->  (
(  .0.  ( +g  `  G )  .0.  )  =  .0.  <->  ( 0g `  G )  =  .0.  ) )
1811, 13, 17syl2anc 409 . . 3  |-  ( ph  ->  ( (  .0.  ( +g  `  G )  .0.  )  =  .0.  <->  ( 0g `  G )  =  .0.  ) )
1910, 18mpbid 146 . 2  |-  ( ph  ->  ( 0g `  G
)  =  .0.  )
2019eqcomd 2176 1  |-  ( ph  ->  .0.  =  ( 0g
`  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141   ` cfv 5198  (class class class)co 5853   Basecbs 12416   +g cplusg 12480   0gc0g 12596   Grpcgrp 12708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-cnex 7865  ax-resscn 7866  ax-1re 7868  ax-addrcl 7871
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-iota 5160  df-fun 5200  df-fn 5201  df-fv 5206  df-riota 5809  df-ov 5856  df-inn 8879  df-2 8937  df-ndx 12419  df-slot 12420  df-base 12422  df-plusg 12493  df-0g 12598  df-mgm 12610  df-sgrp 12643  df-mnd 12653  df-grp 12711
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator