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

Theorem isgrpi 13606
Description: Properties that determine a group.  N (negative) is normally dependent on  x i.e. read it as  N ( x ). (Contributed by NM, 3-Sep-2011.)
Hypotheses
Ref Expression
isgrpi.b  |-  B  =  ( Base `  G
)
isgrpi.p  |-  .+  =  ( +g  `  G )
isgrpi.c  |-  ( ( x  e.  B  /\  y  e.  B )  ->  ( x  .+  y
)  e.  B )
isgrpi.a  |-  ( ( x  e.  B  /\  y  e.  B  /\  z  e.  B )  ->  ( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
isgrpi.z  |-  .0.  e.  B
isgrpi.i  |-  ( x  e.  B  ->  (  .0.  .+  x )  =  x )
isgrpi.n  |-  ( x  e.  B  ->  N  e.  B )
isgrpi.j  |-  ( x  e.  B  ->  ( N  .+  x )  =  .0.  )
Assertion
Ref Expression
isgrpi  |-  G  e. 
Grp
Distinct variable groups:    x, y, z, B    x, G, y, z    y, N    x,  .+ , y, z    x,  .0. , y, z
Allowed substitution hints:    N( x, z)

Proof of Theorem isgrpi
StepHypRef Expression
1 isgrpi.b . . . 4  |-  B  =  ( Base `  G
)
21a1i 9 . . 3  |-  ( T. 
->  B  =  ( Base `  G ) )
3 isgrpi.p . . . 4  |-  .+  =  ( +g  `  G )
43a1i 9 . . 3  |-  ( T. 
->  .+  =  ( +g  `  G ) )
5 isgrpi.c . . . 4  |-  ( ( x  e.  B  /\  y  e.  B )  ->  ( x  .+  y
)  e.  B )
653adant1 1041 . . 3  |-  ( ( T.  /\  x  e.  B  /\  y  e.  B )  ->  (
x  .+  y )  e.  B )
7 isgrpi.a . . . 4  |-  ( ( x  e.  B  /\  y  e.  B  /\  z  e.  B )  ->  ( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
87adantl 277 . . 3  |-  ( ( T.  /\  ( x  e.  B  /\  y  e.  B  /\  z  e.  B ) )  -> 
( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
9 isgrpi.z . . . 4  |-  .0.  e.  B
109a1i 9 . . 3  |-  ( T. 
->  .0.  e.  B )
11 isgrpi.i . . . 4  |-  ( x  e.  B  ->  (  .0.  .+  x )  =  x )
1211adantl 277 . . 3  |-  ( ( T.  /\  x  e.  B )  ->  (  .0.  .+  x )  =  x )
13 isgrpi.n . . . 4  |-  ( x  e.  B  ->  N  e.  B )
1413adantl 277 . . 3  |-  ( ( T.  /\  x  e.  B )  ->  N  e.  B )
15 isgrpi.j . . . 4  |-  ( x  e.  B  ->  ( N  .+  x )  =  .0.  )
1615adantl 277 . . 3  |-  ( ( T.  /\  x  e.  B )  ->  ( N  .+  x )  =  .0.  )
172, 4, 6, 8, 10, 12, 14, 16isgrpd 13605 . 2  |-  ( T. 
->  G  e.  Grp )
1817mptru 1406 1  |-  G  e. 
Grp
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1004    = wceq 1397   T. wtru 1398    e. wcel 2202   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5970  df-ov 6020  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585
This theorem is referenced by:  cncrng  14582
  Copyright terms: Public domain W3C validator