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

Theorem issgrp 12621
Description: The predicate "is a semigroup". (Contributed by FL, 2-Nov-2009.) (Revised by AV, 6-Jan-2020.)
Hypotheses
Ref Expression
issgrp.b  |-  B  =  ( Base `  M
)
issgrp.o  |-  .o.  =  ( +g  `  M )
Assertion
Ref Expression
issgrp  |-  ( M  e. Smgrp 
<->  ( M  e. Mgm  /\  A. x  e.  B  A. y  e.  B  A. z  e.  B  (
( x  .o.  y
)  .o.  z )  =  ( x  .o.  ( y  .o.  z
) ) ) )
Distinct variable groups:    x, B, y, z    x, M, y, z    x,  .o. , y, z

Proof of Theorem issgrp
Dummy variables  b  g  o are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 basfn 12451 . . . . 5  |-  Base  Fn  _V
2 vex 2729 . . . . 5  |-  g  e. 
_V
3 funfvex 5503 . . . . . 6  |-  ( ( Fun  Base  /\  g  e.  dom  Base )  ->  ( Base `  g )  e. 
_V )
43funfni 5288 . . . . 5  |-  ( (
Base  Fn  _V  /\  g  e.  _V )  ->  ( Base `  g )  e. 
_V )
51, 2, 4mp2an 423 . . . 4  |-  ( Base `  g )  e.  _V
65a1i 9 . . 3  |-  ( g  =  M  ->  ( Base `  g )  e. 
_V )
7 fveq2 5486 . . . 4  |-  ( g  =  M  ->  ( Base `  g )  =  ( Base `  M
) )
8 issgrp.b . . . 4  |-  B  =  ( Base `  M
)
97, 8eqtr4di 2217 . . 3  |-  ( g  =  M  ->  ( Base `  g )  =  B )
10 plusgslid 12490 . . . . . . 7  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
1110slotex 12421 . . . . . 6  |-  ( g  e.  _V  ->  ( +g  `  g )  e. 
_V )
1211elv 2730 . . . . 5  |-  ( +g  `  g )  e.  _V
1312a1i 9 . . . 4  |-  ( ( g  =  M  /\  b  =  B )  ->  ( +g  `  g
)  e.  _V )
14 fveq2 5486 . . . . . 6  |-  ( g  =  M  ->  ( +g  `  g )  =  ( +g  `  M
) )
1514adantr 274 . . . . 5  |-  ( ( g  =  M  /\  b  =  B )  ->  ( +g  `  g
)  =  ( +g  `  M ) )
16 issgrp.o . . . . 5  |-  .o.  =  ( +g  `  M )
1715, 16eqtr4di 2217 . . . 4  |-  ( ( g  =  M  /\  b  =  B )  ->  ( +g  `  g
)  =  .o.  )
18 simplr 520 . . . . 5  |-  ( ( ( g  =  M  /\  b  =  B )  /\  o  =  .o.  )  ->  b  =  B )
19 id 19 . . . . . . . . . 10  |-  ( o  =  .o.  ->  o  =  .o.  )
20 oveq 5848 . . . . . . . . . 10  |-  ( o  =  .o.  ->  (
x o y )  =  ( x  .o.  y ) )
21 eqidd 2166 . . . . . . . . . 10  |-  ( o  =  .o.  ->  z  =  z )
2219, 20, 21oveq123d 5863 . . . . . . . . 9  |-  ( o  =  .o.  ->  (
( x o y ) o z )  =  ( ( x  .o.  y )  .o.  z ) )
23 eqidd 2166 . . . . . . . . . 10  |-  ( o  =  .o.  ->  x  =  x )
24 oveq 5848 . . . . . . . . . 10  |-  ( o  =  .o.  ->  (
y o z )  =  ( y  .o.  z ) )
2519, 23, 24oveq123d 5863 . . . . . . . . 9  |-  ( o  =  .o.  ->  (
x o ( y o z ) )  =  ( x  .o.  ( y  .o.  z
) ) )
2622, 25eqeq12d 2180 . . . . . . . 8  |-  ( o  =  .o.  ->  (
( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
2726adantl 275 . . . . . . 7  |-  ( ( ( g  =  M  /\  b  =  B )  /\  o  =  .o.  )  ->  (
( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
2818, 27raleqbidv 2673 . . . . . 6  |-  ( ( ( g  =  M  /\  b  =  B )  /\  o  =  .o.  )  ->  ( A. z  e.  b 
( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  A. z  e.  B  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
2918, 28raleqbidv 2673 . . . . 5  |-  ( ( ( g  =  M  /\  b  =  B )  /\  o  =  .o.  )  ->  ( A. y  e.  b  A. z  e.  b 
( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  A. y  e.  B  A. z  e.  B  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
3018, 29raleqbidv 2673 . . . 4  |-  ( ( ( g  =  M  /\  b  =  B )  /\  o  =  .o.  )  ->  ( A. x  e.  b  A. y  e.  b  A. z  e.  b 
( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  A. x  e.  B  A. y  e.  B  A. z  e.  B  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
3113, 17, 30sbcied2 2988 . . 3  |-  ( ( g  =  M  /\  b  =  B )  ->  ( [. ( +g  `  g )  /  o ]. A. x  e.  b 
A. y  e.  b 
A. z  e.  b  ( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  A. x  e.  B  A. y  e.  B  A. z  e.  B  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
326, 9, 31sbcied2 2988 . 2  |-  ( g  =  M  ->  ( [. ( Base `  g
)  /  b ]. [. ( +g  `  g
)  /  o ]. A. x  e.  b  A. y  e.  b  A. z  e.  b 
( ( x o y ) o z )  =  ( x o ( y o z ) )  <->  A. x  e.  B  A. y  e.  B  A. z  e.  B  ( (
x  .o.  y )  .o.  z )  =  ( x  .o.  ( y  .o.  z ) ) ) )
33 df-sgrp 12620 . 2  |- Smgrp  =  {
g  e. Mgm  |  [. ( Base `  g )  / 
b ]. [. ( +g  `  g )  /  o ]. A. x  e.  b 
A. y  e.  b 
A. z  e.  b  ( ( x o y ) o z )  =  ( x o ( y o z ) ) }
3432, 33elrab2 2885 1  |-  ( M  e. Smgrp 
<->  ( M  e. Mgm  /\  A. x  e.  B  A. y  e.  B  A. z  e.  B  (
( x  .o.  y
)  .o.  z )  =  ( x  .o.  ( y  .o.  z
) ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   A.wral 2444   _Vcvv 2726   [.wsbc 2951    Fn wfn 5183   ` cfv 5188  (class class class)co 5842   Basecbs 12394   +g cplusg 12457  Mgmcmgm 12585  Smgrpcsgrp 12619
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-cnex 7844  ax-resscn 7845  ax-1re 7847  ax-addrcl 7850
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-iota 5153  df-fun 5190  df-fn 5191  df-fv 5196  df-ov 5845  df-inn 8858  df-2 8916  df-ndx 12397  df-slot 12398  df-base 12400  df-plusg 12470  df-sgrp 12620
This theorem is referenced by:  issgrpv  12622  issgrpn0  12623  isnsgrp  12624  sgrpmgm  12625  sgrpass  12626  sgrp0  12627  sgrp1  12628
  Copyright terms: Public domain W3C validator