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

Theorem isgrpd 12759
Description: Deduce a group from its properties. Unlike isgrpd2 12757, this one goes straight from the base properties rather than going through  Mnd.  N (negative) is normally dependent on  x i.e. read it as  N ( x ). (Contributed by NM, 6-Jun-2013.) (Revised by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
isgrpd.b  |-  ( ph  ->  B  =  ( Base `  G ) )
isgrpd.p  |-  ( ph  ->  .+  =  ( +g  `  G ) )
isgrpd.c  |-  ( (
ph  /\  x  e.  B  /\  y  e.  B
)  ->  ( x  .+  y )  e.  B
)
isgrpd.a  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B  /\  z  e.  B ) )  -> 
( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
isgrpd.z  |-  ( ph  ->  .0.  e.  B )
isgrpd.i  |-  ( (
ph  /\  x  e.  B )  ->  (  .0.  .+  x )  =  x )
isgrpd.n  |-  ( (
ph  /\  x  e.  B )  ->  N  e.  B )
isgrpd.j  |-  ( (
ph  /\  x  e.  B )  ->  ( N  .+  x )  =  .0.  )
Assertion
Ref Expression
isgrpd  |-  ( ph  ->  G  e.  Grp )
Distinct variable groups:    x, y, z, 
.+    x,  .0. , y, z   
x, B, y, z   
y, N    ph, x, y, z    x, G, y, z
Allowed substitution hints:    N( x, z)

Proof of Theorem isgrpd
StepHypRef Expression
1 isgrpd.b . 2  |-  ( ph  ->  B  =  ( Base `  G ) )
2 isgrpd.p . 2  |-  ( ph  ->  .+  =  ( +g  `  G ) )
3 isgrpd.c . 2  |-  ( (
ph  /\  x  e.  B  /\  y  e.  B
)  ->  ( x  .+  y )  e.  B
)
4 isgrpd.a . 2  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B  /\  z  e.  B ) )  -> 
( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
5 isgrpd.z . 2  |-  ( ph  ->  .0.  e.  B )
6 isgrpd.i . 2  |-  ( (
ph  /\  x  e.  B )  ->  (  .0.  .+  x )  =  x )
7 isgrpd.n . . 3  |-  ( (
ph  /\  x  e.  B )  ->  N  e.  B )
8 isgrpd.j . . 3  |-  ( (
ph  /\  x  e.  B )  ->  ( N  .+  x )  =  .0.  )
9 oveq1 5872 . . . . 5  |-  ( y  =  N  ->  (
y  .+  x )  =  ( N  .+  x ) )
109eqeq1d 2184 . . . 4  |-  ( y  =  N  ->  (
( y  .+  x
)  =  .0.  <->  ( N  .+  x )  =  .0.  ) )
1110rspcev 2839 . . 3  |-  ( ( N  e.  B  /\  ( N  .+  x )  =  .0.  )  ->  E. y  e.  B  ( y  .+  x
)  =  .0.  )
127, 8, 11syl2anc 411 . 2  |-  ( (
ph  /\  x  e.  B )  ->  E. y  e.  B  ( y  .+  x )  =  .0.  )
131, 2, 3, 4, 5, 6, 12isgrpde 12758 1  |-  ( ph  ->  G  e.  Grp )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 978    = wceq 1353    e. wcel 2146   E.wrex 2454   ` cfv 5208  (class class class)co 5865   Basecbs 12427   +g cplusg 12491   Grpcgrp 12737
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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-cnex 7877  ax-resscn 7878  ax-1re 7880  ax-addrcl 7883
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-iota 5170  df-fun 5210  df-fn 5211  df-fv 5216  df-riota 5821  df-ov 5868  df-inn 8891  df-2 8949  df-ndx 12430  df-slot 12431  df-base 12433  df-plusg 12504  df-0g 12627  df-mgm 12639  df-sgrp 12672  df-mnd 12682  df-grp 12740
This theorem is referenced by:  isgrpi  12760
  Copyright terms: Public domain W3C validator