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 20181

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 3130	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍)
3		srgisid.1	. . . 4 ⊢ (𝜑 → 𝑅 ∈ SRing)
4		srgz.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
5		srgz.z	. . . . 5 ⊢ 0 = (0_g‘𝑅)
6	4, 5	srg0cl 20172	. . . 4 ⊢ (𝑅 ∈ SRing → 0 ∈ 𝐵)
7		oveq2 7368	. . . . . 6 ⊢ (𝑥 = 0 → (𝑍 · 𝑥) = (𝑍 · 0 ))
8	7	eqeq1d 2739	. . . . 5 ⊢ (𝑥 = 0 → ((𝑍 · 𝑥) = 𝑍 ↔ (𝑍 · 0 ) = 𝑍))
9	8	rspcv 3561	. . . 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 20179	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑍 ∈ 𝐵) → (𝑍 · 0 ) = 0 )
15	3, 12, 14	syl2anc 585	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 0 )
16	11, 15	eqtr3d 2774	1 ⊢ (𝜑 → 𝑍 = 0 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 ._rcmulr 17212 0_gc0g 17393 SRingcsrg 20158

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5370

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 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 7317 df-ov 7363 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-cmn 19748 df-srg 20159

This theorem is referenced by: (None)

W3C validator