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

Theorem srgrz 13963
Description: The zero of a semiring is a right-absorbing element. (Contributed by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
srgz.b  |-  B  =  ( Base `  R
)
srgz.t  |-  .x.  =  ( .r `  R )
srgz.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
srgrz  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )

Proof of Theorem srgrz
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 srgz.b . . . . . . 7  |-  B  =  ( Base `  R
)
2 eqid 2229 . . . . . . 7  |-  (mulGrp `  R )  =  (mulGrp `  R )
3 eqid 2229 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
4 srgz.t . . . . . . 7  |-  .x.  =  ( .r `  R )
5 srgz.z . . . . . . 7  |-  .0.  =  ( 0g `  R )
61, 2, 3, 4, 5issrg 13944 . . . . . 6  |-  ( R  e. SRing 
<->  ( R  e. CMnd  /\  (mulGrp `  R )  e. 
Mnd  /\  A. x  e.  B  ( A. y  e.  B  A. z  e.  B  (
( x  .x.  (
y ( +g  `  R
) z ) )  =  ( ( x 
.x.  y ) ( +g  `  R ) ( x  .x.  z
) )  /\  (
( x ( +g  `  R ) y ) 
.x.  z )  =  ( ( x  .x.  z ) ( +g  `  R ) ( y 
.x.  z ) ) )  /\  ( (  .0.  .x.  x )  =  .0.  /\  ( x 
.x.  .0.  )  =  .0.  ) ) ) )
76simp3bi 1038 . . . . 5  |-  ( R  e. SRing  ->  A. x  e.  B  ( A. y  e.  B  A. z  e.  B  ( ( x  .x.  ( y ( +g  `  R ) z ) )  =  ( ( x  .x.  y ) ( +g  `  R
) ( x  .x.  z ) )  /\  ( ( x ( +g  `  R ) y )  .x.  z
)  =  ( ( x  .x.  z ) ( +g  `  R
) ( y  .x.  z ) ) )  /\  ( (  .0. 
.x.  x )  =  .0.  /\  ( x 
.x.  .0.  )  =  .0.  ) ) )
87r19.21bi 2618 . . . 4  |-  ( ( R  e. SRing  /\  x  e.  B )  ->  ( A. y  e.  B  A. z  e.  B  ( ( x  .x.  ( y ( +g  `  R ) z ) )  =  ( ( x  .x.  y ) ( +g  `  R
) ( x  .x.  z ) )  /\  ( ( x ( +g  `  R ) y )  .x.  z
)  =  ( ( x  .x.  z ) ( +g  `  R
) ( y  .x.  z ) ) )  /\  ( (  .0. 
.x.  x )  =  .0.  /\  ( x 
.x.  .0.  )  =  .0.  ) ) )
98simprrd 532 . . 3  |-  ( ( R  e. SRing  /\  x  e.  B )  ->  (
x  .x.  .0.  )  =  .0.  )
109ralrimiva 2603 . 2  |-  ( R  e. SRing  ->  A. x  e.  B  ( x  .x.  .0.  )  =  .0.  )
11 oveq1 6014 . . . 4  |-  ( x  =  X  ->  (
x  .x.  .0.  )  =  ( X  .x.  .0.  ) )
1211eqeq1d 2238 . . 3  |-  ( x  =  X  ->  (
( x  .x.  .0.  )  =  .0.  <->  ( X  .x.  .0.  )  =  .0.  ) )
1312rspcv 2903 . 2  |-  ( X  e.  B  ->  ( A. x  e.  B  ( x  .x.  .0.  )  =  .0.  ->  ( X  .x.  .0.  )  =  .0.  ) )
1410, 13mpan9 281 1  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  ( X  .x.  .0.  )  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   A.wral 2508   ` cfv 5318  (class class class)co 6007   Basecbs 13048   +g cplusg 13126   .rcmulr 13127   0gc0g 13305   Mndcmnd 13465  CMndccmn 13837  mulGrpcmgp 13899  SRingcsrg 13942
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-cnex 8101  ax-resscn 8102  ax-1re 8104  ax-addrcl 8107
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326  df-riota 5960  df-ov 6010  df-inn 9122  df-2 9180  df-3 9181  df-ndx 13051  df-slot 13052  df-base 13054  df-plusg 13139  df-mulr 13140  df-0g 13307  df-srg 13943
This theorem is referenced by:  srgisid  13965  srglmhm  13972
  Copyright terms: Public domain W3C validator