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 20144

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 3128	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍)
3		srgisid.1	. . . 4 ⊢ (𝜑 → 𝑅 ∈ SRing)
4		srgz.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
5		srgz.z	. . . . 5 ⊢ 0 = (0_g‘𝑅)
6	4, 5	srg0cl 20135	. . . 4 ⊢ (𝑅 ∈ SRing → 0 ∈ 𝐵)
7		oveq2 7366	. . . . . 6 ⊢ (𝑥 = 0 → (𝑍 · 𝑥) = (𝑍 · 0 ))
8	7	eqeq1d 2738	. . . . 5 ⊢ (𝑥 = 0 → ((𝑍 · 𝑥) = 𝑍 ↔ (𝑍 · 0 ) = 𝑍))
9	8	rspcv 3572	. . . 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 20142	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑍 ∈ 𝐵) → (𝑍 · 0 ) = 0 )
15	3, 12, 14	syl2anc 584	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 0 )
16	11, 15	eqtr3d 2773	1 ⊢ (𝜑 → 𝑍 = 0 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 ._rcmulr 17178 0_gc0g 17359 SRingcsrg 20121

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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377

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-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6448 df-fun 6494 df-fv 6500 df-riota 7315 df-ov 7361 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-cmn 19711 df-srg 20122

This theorem is referenced by: (None)

W3C validator