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 20415

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 3155	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑍 · 𝑥) = 𝑍)
3		srgisid.1	. . . 4 ⊢ (𝜑 → 𝑅 ∈ SRing)
4		srgz.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
5		srgz.z	. . . . 5 ⊢ 0 = (0_g‘𝑅)
6	4, 5	srg0cl 20406	. . . 4 ⊢ (𝑅 ∈ SRing → 0 ∈ 𝐵)
7		oveq2 7420	. . . . . 6 ⊢ (𝑥 = 0 → (𝑍 · 𝑥) = (𝑍 · 0 ))
8	7	eqeq1d 2763	. . . . 5 ⊢ (𝑥 = 0 → ((𝑍 · 𝑥) = 𝑍 ↔ (𝑍 · 0 ) = 𝑍))
9	8	rspcv 3573	. . . 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 20413	. . 3 ⊢ ((𝑅 ∈ SRing ∧ 𝑍 ∈ 𝐵) → (𝑍 · 0 ) = 0 )
15	3, 12, 14	syl2anc 596	. 2 ⊢ (𝜑 → (𝑍 · 0 ) = 0 )
16	11, 15	eqtr3d 2798	1 ⊢ (𝜑 → 𝑍 = 0 )

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 ._rcmulr 17409 0_gc0g 17590 SRingcsrg 20392

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6487 df-fun 6533 df-fv 6539 df-riota 7369 df-ov 7415 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-cmn 19976 df-srg 20393

This theorem is used by: (None)

W3C validator