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

Theorem srgisid 14264
Description: In a semiring, the only left-absorbing element is the additive identity. Remark in [Golan] p. 1. (Contributed by Thierry Arnoux, 1-May-2018.)
Hypotheses
Ref Expression
srgz.b  |-  B  =  ( Base `  R
)
srgz.t  |-  .x.  =  ( .r `  R )
srgz.z  |-  .0.  =  ( 0g `  R )
srgisid.1  |-  ( ph  ->  R  e. SRing )
srgisid.2  |-  ( ph  ->  Z  e.  B )
srgisid.3  |-  ( (
ph  /\  x  e.  B )  ->  ( Z  .x.  x )  =  Z )
Assertion
Ref Expression
srgisid  |-  ( ph  ->  Z  =  .0.  )
Distinct variable groups:    x, B    x, R    x,  .x.    x,  .0.    x, Z    ph, x

Proof of Theorem srgisid
StepHypRef Expression
1 srgisid.3 . . . 4  |-  ( (
ph  /\  x  e.  B )  ->  ( Z  .x.  x )  =  Z )
21ralrimiva 2623 . . 3  |-  ( ph  ->  A. x  e.  B  ( Z  .x.  x )  =  Z )
3 srgisid.1 . . . 4  |-  ( ph  ->  R  e. SRing )
4 srgz.b . . . . 5  |-  B  =  ( Base `  R
)
5 srgz.z . . . . 5  |-  .0.  =  ( 0g `  R )
64, 5srg0cl 14255 . . . 4  |-  ( R  e. SRing  ->  .0.  e.  B
)
7 oveq2 6083 . . . . . 6  |-  ( x  =  .0.  ->  ( Z  .x.  x )  =  ( Z  .x.  .0.  ) )
87eqeq1d 2247 . . . . 5  |-  ( x  =  .0.  ->  (
( Z  .x.  x
)  =  Z  <->  ( Z  .x.  .0.  )  =  Z ) )
98rspcv 2925 . . . 4  |-  (  .0. 
e.  B  ->  ( A. x  e.  B  ( Z  .x.  x )  =  Z  ->  ( Z  .x.  .0.  )  =  Z ) )
103, 6, 93syl 17 . . 3  |-  ( ph  ->  ( A. x  e.  B  ( Z  .x.  x )  =  Z  ->  ( Z  .x.  .0.  )  =  Z
) )
112, 10mpd 13 . 2  |-  ( ph  ->  ( Z  .x.  .0.  )  =  Z )
12 srgisid.2 . . 3  |-  ( ph  ->  Z  e.  B )
13 srgz.t . . . 4  |-  .x.  =  ( .r `  R )
144, 13, 5srgrz 14262 . . 3  |-  ( ( R  e. SRing  /\  Z  e.  B )  ->  ( Z  .x.  .0.  )  =  .0.  )
153, 12, 14syl2anc 415 . 2  |-  ( ph  ->  ( Z  .x.  .0.  )  =  .0.  )
1611, 15eqtr3d 2273 1  |-  ( ph  ->  Z  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   ` cfv 5372  (class class class)co 6075   Basecbs 13330   .rcmulr 13409   0gc0g 13587  SRingcsrg 14241
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-mulr 13422  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-cmn 14066  df-srg 14242
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator