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

Theorem isgrpd2 13353
Description: Deduce a group from its properties.  N (negative) is normally dependent on  x i.e. read it as  N ( x ). Note: normally we don't use a  ph antecedent on hypotheses that name structure components, since they can be eliminated with eqid 2205, but we make an exception for theorems such as isgrpd2 13353 and ismndd 13269 since theorems using them often rewrite the structure components. (Contributed by NM, 10-Aug-2013.)
Hypotheses
Ref Expression
isgrpd2.b  |-  ( ph  ->  B  =  ( Base `  G ) )
isgrpd2.p  |-  ( ph  ->  .+  =  ( +g  `  G ) )
isgrpd2.z  |-  ( ph  ->  .0.  =  ( 0g
`  G ) )
isgrpd2.g  |-  ( ph  ->  G  e.  Mnd )
isgrpd2.n  |-  ( (
ph  /\  x  e.  B )  ->  N  e.  B )
isgrpd2.j  |-  ( (
ph  /\  x  e.  B )  ->  ( N  .+  x )  =  .0.  )
Assertion
Ref Expression
isgrpd2  |-  ( ph  ->  G  e.  Grp )
Distinct variable groups:    x,  .+    x, B   
x, G    ph, x
Allowed substitution hints:    N( x)    .0. ( x)

Proof of Theorem isgrpd2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 isgrpd2.b . 2  |-  ( ph  ->  B  =  ( Base `  G ) )
2 isgrpd2.p . 2  |-  ( ph  ->  .+  =  ( +g  `  G ) )
3 isgrpd2.z . 2  |-  ( ph  ->  .0.  =  ( 0g
`  G ) )
4 isgrpd2.g . 2  |-  ( ph  ->  G  e.  Mnd )
5 isgrpd2.n . . 3  |-  ( (
ph  /\  x  e.  B )  ->  N  e.  B )
6 isgrpd2.j . . 3  |-  ( (
ph  /\  x  e.  B )  ->  ( N  .+  x )  =  .0.  )
7 oveq1 5951 . . . . 5  |-  ( y  =  N  ->  (
y  .+  x )  =  ( N  .+  x ) )
87eqeq1d 2214 . . . 4  |-  ( y  =  N  ->  (
( y  .+  x
)  =  .0.  <->  ( N  .+  x )  =  .0.  ) )
98rspcev 2877 . . 3  |-  ( ( N  e.  B  /\  ( N  .+  x )  =  .0.  )  ->  E. y  e.  B  ( y  .+  x
)  =  .0.  )
105, 6, 9syl2anc 411 . 2  |-  ( (
ph  /\  x  e.  B )  ->  E. y  e.  B  ( y  .+  x )  =  .0.  )
111, 2, 3, 4, 10isgrpd2e 13352 1  |-  ( ph  ->  G  e.  Grp )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373    e. wcel 2176   E.wrex 2485   ` cfv 5271  (class class class)co 5944   Basecbs 12832   +g cplusg 12909   0gc0g 13088   Mndcmnd 13248   Grpcgrp 13332
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-iota 5232  df-fv 5279  df-ov 5947  df-grp 13335
This theorem is referenced by:  prdsgrpd  13441
  Copyright terms: Public domain W3C validator