Theorem srgrz 20120

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 2731	. . . . . . 7 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅)
3		eqid 2731	. . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅)
4		srgz.t	. . . . . . 7 ⊢ · = (.r‘𝑅)
5		srgz.z	. . . . . . 7 ⊢ 0 = (0g‘𝑅)
6	1, 2, 3, 4, 5	issrg 20101	. . . . . 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 3224	. . . 4 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))) ∧ (( 0 · 𝑥) = 0 ∧ (𝑥 · 0 ) = 0 )))
9	8	simprrd 773	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑥 ∈ 𝐵) → (𝑥 · 0 ) = 0 )
10	9	ralrimiva 3124	. 2 ⊢ (𝑅 ∈ SRing → ∀𝑥 ∈ 𝐵 (𝑥 · 0 ) = 0 )
11		oveq1 7348	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 · 0 ) = (𝑋 · 0 ))
12	11	eqeq1d 2733	. . 3 ⊢ (𝑥 = 𝑋 → ((𝑥 · 0 ) = 0 ↔ (𝑋 · 0 ) = 0 ))
13	12	rspcv 3568	. 2 ⊢ (𝑋 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑥 · 0 ) = 0 → (𝑋 · 0 ) = 0 ))
14	10, 13	mpan9 506	1 ⊢ ((𝑅 ∈ SRing ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 )

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∀wral 3047  ‘cfv 6476  (class class class)co 7341  Basecbs 17115  +_gcplusg 17156  ._rcmulr 17157  0_gc0g 17338  Mndcmnd 18637  CMndccmn 19687  mulGrpcmgp 20053  SRingcsrg 20099

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-12 2180  ax-ext 2703  ax-nul 5239

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rab 3396  df-v 3438  df-sbc 3737  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-iota 6432  df-fv 6484  df-ov 7344  df-srg 20100

This theorem is referenced by:  srgisid  20122  srglmhm  20134  slmdvs0  33186  rhmqusspan  42218