MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  srglz Structured version   Visualization version   Unicode version

Theorem srglz 18527
Description: The zero of a semiring is a left-absorbing element. (Contributed by AV, 23-Aug-2019.)
Hypotheses
Ref Expression
srgz.b  |-  B  =  ( Base `  R
)
srgz.t  |-  .x.  =  ( .r `  R )
srgz.z  |-  .0.  =  ( 0g `  R )
Assertion
Ref Expression
srglz  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  (  .0.  .x.  X )  =  .0.  )

Proof of Theorem srglz
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 2622 . . . . . . 7  |-  (mulGrp `  R )  =  (mulGrp `  R )
3 eqid 2622 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
4 srgz.t . . . . . . 7  |-  .x.  =  ( .r `  R )
5 srgz.z . . . . . . 7  |-  .0.  =  ( 0g `  R )
61, 2, 3, 4, 5issrg 18507 . . . . . 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 1078 . . . . 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 2932 . . . 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.  ) ) )
98simprld 795 . . 3  |-  ( ( R  e. SRing  /\  x  e.  B )  ->  (  .0.  .x.  x )  =  .0.  )
109ralrimiva 2966 . 2  |-  ( R  e. SRing  ->  A. x  e.  B  (  .0.  .x.  x )  =  .0.  )
11 oveq2 6658 . . . 4  |-  ( x  =  X  ->  (  .0.  .x.  x )  =  (  .0.  .x.  X
) )
1211eqeq1d 2624 . . 3  |-  ( x  =  X  ->  (
(  .0.  .x.  x
)  =  .0.  <->  (  .0.  .x. 
X )  =  .0.  ) )
1312rspcv 3305 . 2  |-  ( X  e.  B  ->  ( A. x  e.  B  (  .0.  .x.  x )  =  .0.  ->  (  .0.  .x. 
X )  =  .0.  ) )
1410, 13mpan9 486 1  |-  ( ( R  e. SRing  /\  X  e.  B )  ->  (  .0.  .x.  X )  =  .0.  )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   A.wral 2912   ` cfv 5888  (class class class)co 6650   Basecbs 15857   +g cplusg 15941   .rcmulr 15942   0gc0g 16100   Mndcmnd 17294  CMndccmn 18193  mulGrpcmgp 18489  SRingcsrg 18505
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-srg 18506
This theorem is referenced by:  srgmulgass  18531  srgrmhm  18536
  Copyright terms: Public domain W3C validator