srgisid - Metamath Proof Explorer

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

Theorem srgisid 20322

Description: In a semiring, the only left-absorbing element is the additive identity. Remark in [Golan] p. 1. (Contributed by Thierry Arnoux, 1-May-2018.)

**Hypotheses**
Ref	Expression
srgz.b	⊢ 𝐵 = (Base‘𝑅)
srgz.t	⊢ · = (._r‘𝑅)
srgz.z	⊢ 0 = (0_g‘𝑅)
srgisid.1	⊢ (𝜑 → 𝑅 ∈ SRing)
srgisid.2	⊢ (𝜑 → 𝑍 ∈ 𝐵)
srgisid.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑍 · 𝑥) = 𝑍)

**Assertion**
Ref	Expression
srgisid	⊢ (𝜑 → 𝑍 = 0 )

Distinct variable groups: 𝑥,𝐵 𝑥,𝑅 𝑥, · 𝑥, 0 𝑥,𝑍 𝜑,𝑥

**Proof of Theorem srgisid**
Step	Hyp	Ref	Expression
1		srgisid.3	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑍 · 𝑥) = 𝑍)
2	1	ralrimiva 3160	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍)
3		srgisid.1	. . . 4 ⊢ (𝜑 → 𝑅 ∈ SRing)
4		srgz.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
5		srgz.z	. . . . 5 ⊢ 0 = (0_g‘𝑅)
6	4, 5	srg0cl 20313	. . . 4 ⊢ (𝑅 ∈ SRing → 0 ∈ 𝐵)
7		oveq2 7431	. . . . . 6 ⊢ (𝑥 = 0 → (𝑍 · 𝑥) = (𝑍 · 0 ))
8	7	eqeq1d 2768	. . . . 5 ⊢ (𝑥 = 0 → ((𝑍 · 𝑥) = 𝑍 ↔ (𝑍 · 0 ) = 𝑍))
9	8	rspcv 3580	. . . 4 ⊢ ( 0 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍 → (𝑍 · 0 ) = 𝑍))
10	3, 6, 9	3syl 19	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍 → (𝑍 · 0 ) = 𝑍))
11	2, 10	mpd 16	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 𝑍)
12		srgisid.2	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
13		srgz.t	. . . 4 ⊢ · = (._r‘𝑅)
14	4, 13, 5	srgrz 20320	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑍 ∈ 𝐵) → (𝑍 · 0 ) = 0 )
15	3, 12, 14	syl2anc 596	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 0 )
16	11, 15	eqtr3d 2803	1 ⊢ (𝜑 → 𝑍 = 0 )

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3082 ‘cfv 6543 (class class class)co 7423 Basecbs 17294 ._rcmulr 17336 0_gc0g 17517 SRingcsrg 20299

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-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409

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-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6499 df-fun 6545 df-fv 6551 df-riota 7380 df-ov 7426 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-cmn 19883 df-srg 20300

This theorem is used by: (None)

W3C validator