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

Theorem srgrz 19278
Description: The zero of a semiring is a right-absorbing element. (Contributed by Thierry Arnoux, 1-Apr-2018.)
Hypotheses
Ref Expression
srgz.b 𝐵 = (Base‘𝑅)
srgz.t · = (.r𝑅)
srgz.z 0 = (0g𝑅)
Assertion
Ref Expression
srgrz ((𝑅 ∈ SRing ∧ 𝑋𝐵) → (𝑋 · 0 ) = 0 )

Proof of Theorem srgrz
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 srgz.b . . . . . . 7 𝐵 = (Base‘𝑅)
2 eqid 2823 . . . . . . 7 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3 eqid 2823 . . . . . . 7 (+g𝑅) = (+g𝑅)
4 srgz.t . . . . . . 7 · = (.r𝑅)
5 srgz.z . . . . . . 7 0 = (0g𝑅)
61, 2, 3, 4, 5issrg 19259 . . . . . 6 (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥𝐵 (∀𝑦𝐵𝑧𝐵 ((𝑥 · (𝑦(+g𝑅)𝑧)) = ((𝑥 · 𝑦)(+g𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))))
76simp3bi 1143 . . . . 5 (𝑅 ∈ SRing → ∀𝑥𝐵 (∀𝑦𝐵𝑧𝐵 ((𝑥 · (𝑦(+g𝑅)𝑧)) = ((𝑥 · 𝑦)(+g𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
87r19.21bi 3210 . . . 4 ((𝑅 ∈ SRing ∧ 𝑥𝐵) → (∀𝑦𝐵𝑧𝐵 ((𝑥 · (𝑦(+g𝑅)𝑧)) = ((𝑥 · 𝑦)(+g𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
98simprrd 772 . . 3 ((𝑅 ∈ SRing ∧ 𝑥𝐵) → (𝑥 · 0 ) = 0 )
109ralrimiva 3184 . 2 (𝑅 ∈ SRing → ∀𝑥𝐵 (𝑥 · 0 ) = 0 )
11 oveq1 7165 . . . 4 (𝑥 = 𝑋 → (𝑥 · 0 ) = (𝑋 · 0 ))
1211eqeq1d 2825 . . 3 (𝑥 = 𝑋 → ((𝑥 · 0 ) = 0 ↔ (𝑋 · 0 ) = 0 ))
1312rspcv 3620 . 2 (𝑋𝐵 → (∀𝑥𝐵 (𝑥 · 0 ) = 0 → (𝑋 · 0 ) = 0 ))
1410, 13mpan9 509 1 ((𝑅 ∈ SRing ∧ 𝑋𝐵) → (𝑋 · 0 ) = 0 )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  wral 3140  cfv 6357  (class class class)co 7158  Basecbs 16485  +gcplusg 16567  .rcmulr 16568  0gc0g 16715  Mndcmnd 17913  CMndccmn 18908  mulGrpcmgp 19241  SRingcsrg 19257
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-nul 5212
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-iota 6316  df-fv 6365  df-ov 7161  df-srg 19258
This theorem is referenced by:  srgisid  19280  srglmhm  19287  slmdvs0  30855
  Copyright terms: Public domain W3C validator