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

Theorem srgrz 14078
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 2231 . . . . . . 7  |-  (mulGrp `  R )  =  (mulGrp `  R )
3 eqid 2231 . . . . . . 7  |-  ( +g  `  R )  =  ( +g  `  R )
4 srgz.t . . . . . . 7  |-  .x.  =  ( .r `  R )
5 srgz.z . . . . . . 7  |-  .0.  =  ( 0g `  R )
61, 2, 3, 4, 5issrg 14059 . . . . . 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 1041 . . . . 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 2621 . . . 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 534 . . 3  |-  ( ( R  e. SRing  /\  x  e.  B )  ->  (
x  .x.  .0.  )  =  .0.  )
109ralrimiva 2606 . 2  |-  ( R  e. SRing  ->  A. x  e.  B  ( x  .x.  .0.  )  =  .0.  )
11 oveq1 6035 . . . 4  |-  ( x  =  X  ->  (
x  .x.  .0.  )  =  ( X  .x.  .0.  ) )
1211eqeq1d 2240 . . 3  |-  ( x  =  X  ->  (
( x  .x.  .0.  )  =  .0.  <->  ( X  .x.  .0.  )  =  .0.  ) )
1312rspcv 2907 . 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 1398    e. wcel 2202   A.wral 2511   ` cfv 5333  (class class class)co 6028   Basecbs 13162   +g cplusg 13240   .rcmulr 13241   0gc0g 13419   Mndcmnd 13579  CMndccmn 13951  mulGrpcmgp 14014  SRingcsrg 14057
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-inn 9203  df-2 9261  df-3 9262  df-ndx 13165  df-slot 13166  df-base 13168  df-plusg 13253  df-mulr 13254  df-0g 13421  df-srg 14058
This theorem is referenced by:  srgisid  14080  srglmhm  14087
  Copyright terms: Public domain W3C validator