Theorem srgrz 20116

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.

Step	Hyp	Ref	Expression
1		srgz.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
2		eqid 2729	. . . . . . 7 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
3		eqid 2729	. . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅)
4		srgz.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
5		srgz.z	. . . . . . 7 ⊢ 0 = (0g‘𝑅)
6	1, 2, 3, 4, 5	issrg 20097	. . . . . 6 ⊢ (𝑅 ∈ SRing ↔ (𝑅 ∈ CMnd ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 ))))
7	6	simp3bi 1147	. . . . 5 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
8	7	r19.21bi 3229	. . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
9	8	simprrd 773	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (𝑥 · 0 ) = 0 )
10	9	ralrimiva 3125	. 2 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 (𝑥 · 0 ) = 0 )
11		oveq1 7394	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 · 0 ) = (𝑋 · 0 ))
12	11	eqeq1d 2731	. . 3 ⊢ (𝑥 = 𝑋 → ((𝑥 · 0 ) = 0 ↔ (𝑋 · 0 ) = 0 ))
13	12	rspcv 3584	. 2 ⊢ (𝑋 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑥 · 0 ) = 0 → (𝑋 · 0 ) = 0 ))
14	10, 13	mpan9 506	1 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 )

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ‘cfv 6511  (class class class)co 7387  Basecbs 17179  +_gcplusg 17220  ._rcmulr 17221  0_gc0g 17402  Mndcmnd 18661  CMndccmn 19710  mulGrpcmgp 20049  SRingcsrg 20095

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-12 2178  ax-ext 2701  ax-nul 5261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-iota 6464  df-fv 6519  df-ov 7390  df-srg 20096

This theorem is referenced by:  srgisid  20118  srglmhm  20130  slmdvs0  33178  rhmqusspan  42173