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

Theorem srglz 20427
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 2761 . . . . . . 7 (mulGrp‘𝑅) = (mulGrp‘𝑅)
3 eqid 2761 . . . . . . 7 (+g‘𝑅) = (+g‘𝑅)
4 srgz.t . . . . . . 7 · = (.r‘𝑅)
5 srgz.z . . . . . . 7 0 = (0g‘𝑅)
61, 2, 3, 4, 5issrg 20407 . . . . . 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 3255 . . . 4 ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
98simprld 784 . . 3 ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → ( 0 · 𝑥) = 0 )
109ralrimiva 3155 . 2 (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 ( 0 · 𝑥) = 0 )
11 oveq2 7426 . . . 4 (𝑥 = 𝑋 → ( 0 · 𝑥) = ( 0 · 𝑋))
1211eqeq1d 2763 . . 3 (𝑥 = 𝑋 → (( 0 · 𝑥) = 0 ↔ ( 0 · 𝑋) = 0 ))
1312rspcv 3573 . 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 2145  ∀wral 3077  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  +gcplusg 17421  .rcmulr 17422  0gc0g 17603  Mndcmnd 18916  CMndccmn 19987  mulGrpcmgp 20353  SRingcsrg 20405
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 2147  ax-9 2155  ax-12 2213  ax-ext 2733  ax-nul 5260
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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6493  df-fv 6545  df-ov 7421  df-srg 20406
This theorem is used by:  srgmulgass  20436  srgrmhm  20441
  Copyright terms: Public domain W3C validator