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 19764

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 3103	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍)
3		srgisid.1	. . . 4 ⊢ (𝜑 → 𝑅 ∈ SRing)
4		srgz.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
5		srgz.z	. . . . 5 ⊢ 0 = (0_g‘𝑅)
6	4, 5	srg0cl 19755	. . . 4 ⊢ (𝑅 ∈ SRing → 0 ∈ 𝐵)
7		oveq2 7283	. . . . . 6 ⊢ (𝑥 = 0 → (𝑍 · 𝑥) = (𝑍 · 0 ))
8	7	eqeq1d 2740	. . . . 5 ⊢ (𝑥 = 0 → ((𝑍 · 𝑥) = 𝑍 ↔ (𝑍 · 0 ) = 𝑍))
9	8	rspcv 3557	. . . 4 ⊢ ( 0 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍 → (𝑍 · 0 ) = 𝑍))
10	3, 6, 9	3syl 18	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍 → (𝑍 · 0 ) = 𝑍))
11	2, 10	mpd 15	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 𝑍)
12		srgisid.2	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵)
13		srgz.t	. . . 4 ⊢ · = (._r‘𝑅)
14	4, 13, 5	srgrz 19762	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑍 ∈ 𝐵) → (𝑍 · 0 ) = 0 )
15	3, 12, 14	syl2anc 584	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 0 )
16	11, 15	eqtr3d 2780	1 ⊢ (𝜑 → 𝑍 = 0 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 ._rcmulr 16963 0_gc0g 17150 SRingcsrg 19741

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-iota 6391 df-fun 6435 df-fv 6441 df-riota 7232 df-ov 7278 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-cmn 19388 df-srg 19742

This theorem is referenced by: (None)

W3C validator