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

Theorem srglz 20314
Description: The zero of a semiring is a left-absorbing element. (Contributed by AV, 23-Aug-2019.)
Hypotheses
Ref Expression
srgz.b 𝐵 = (Base‘𝑅)
srgz.t · = (.r𝑅)
srgz.z 0 = (0g𝑅)
Assertion
Ref Expression
srglz ((𝑅 ∈ SRing ∧ 𝑋𝐵) → ( 0 · 𝑋) = 0 )

Proof of Theorem srglz
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 srgz.b . . . . . . 7 𝐵 = (Base‘𝑅)
2 eqid 2765 . . . . . . 7 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3 eqid 2765 . . . . . . 7 (+g𝑅) = (+g𝑅)
4 srgz.t . . . . . . 7 · = (.r𝑅)
5 srgz.z . . . . . . 7 0 = (0g𝑅)
61, 2, 3, 4, 5issrg 20294 . . . . . 6 (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥𝐵 (∀𝑦𝐵𝑧𝐵 ((𝑥 · (𝑦(+g𝑅)𝑧)) = ((𝑥 · 𝑦)(+g𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))))
76simp3bi 1165 . . . . 5 (𝑅 ∈ SRing → ∀𝑥𝐵 (∀𝑦𝐵𝑧𝐵 ((𝑥 · (𝑦(+g𝑅)𝑧)) = ((𝑥 · 𝑦)(+g𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
87r19.21bi 3259 . . . 4 ((𝑅 ∈ SRing ∧ 𝑥𝐵) → (∀𝑦𝐵𝑧𝐵 ((𝑥 · (𝑦(+g𝑅)𝑧)) = ((𝑥 · 𝑦)(+g𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
98simprld 784 . . 3 ((𝑅 ∈ SRing ∧ 𝑥𝐵) → ( 0 · 𝑥) = 0 )
109ralrimiva 3159 . 2 (𝑅 ∈ SRing → ∀𝑥𝐵 ( 0 · 𝑥) = 0 )
11 oveq2 7424 . . . 4 (𝑥 = 𝑋 → ( 0 · 𝑥) = ( 0 · 𝑋))
1211eqeq1d 2767 . . 3 (𝑥 = 𝑋 → (( 0 · 𝑥) = 0 ↔ ( 0 · 𝑋) = 0 ))
1312rspcv 3579 . 2 (𝑋𝐵 → (∀𝑥𝐵 ( 0 · 𝑥) = 0 → ( 0 · 𝑋) = 0 ))
1410, 13mpan9 516 1 ((𝑅 ∈ SRing ∧ 𝑋𝐵) → ( 0 · 𝑋) = 0 )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wral 3081  cfv 6540  (class class class)co 7416  Basecbs 17287  +gcplusg 17328  .rcmulr 17329  0gc0g 17510  Mndcmnd 18814  CMndccmn 19874  mulGrpcmgp 20240  SRingcsrg 20292
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737  ax-nul 5271
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7419  df-srg 20293
This theorem is used by:  srgmulgass  20323  srgrmhm  20328
  Copyright terms: Public domain W3C validator