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

Theorem isgrpd2 13603
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 2231, but we make an exception for theorems such as isgrpd2 13603 and ismndd 13519 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 6024 . . . . 5  |-  ( y  =  N  ->  (
y  .+  x )  =  ( N  .+  x ) )
87eqeq1d 2240 . . . 4  |-  ( y  =  N  ->  (
( y  .+  x
)  =  .0.  <->  ( N  .+  x )  =  .0.  ) )
98rspcev 2910 . . 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 13602 1  |-  ( ph  ->  G  e.  Grp )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   E.wrex 2511   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   0gc0g 13338   Mndcmnd 13498   Grpcgrp 13582
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020  df-grp 13585
This theorem is referenced by:  prdsgrpd  13691
  Copyright terms: Public domain W3C validator