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

Theorem isgrpd 13470
Description: Deduce a group from its properties. Unlike isgrpd2 13468, 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 5974 . . . . 5  |-  ( y  =  N  ->  (
y  .+  x )  =  ( N  .+  x ) )
109eqeq1d 2216 . . . 4  |-  ( y  =  N  ->  (
( y  .+  x
)  =  .0.  <->  ( N  .+  x )  =  .0.  ) )
1110rspcev 2884 . . 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 13469 1  |-  ( ph  ->  G  e.  Grp )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 981    = wceq 1373    e. wcel 2178   E.wrex 2487   ` cfv 5290  (class class class)co 5967   Basecbs 12947   +g cplusg 13024   Grpcgrp 13447
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-cnex 8051  ax-resscn 8052  ax-1re 8054  ax-addrcl 8057
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-iota 5251  df-fun 5292  df-fn 5293  df-fv 5298  df-riota 5922  df-ov 5970  df-inn 9072  df-2 9130  df-ndx 12950  df-slot 12951  df-base 12953  df-plusg 13037  df-0g 13205  df-mgm 13303  df-sgrp 13349  df-mnd 13364  df-grp 13450
This theorem is referenced by:  isgrpi  13471  grpressid  13508  issubg2m  13640
  Copyright terms: Public domain W3C validator