Metamath Proof Explorer


Theorem srg1zr

Description: The only semiring with a base set consisting of one element is the zero ring (at least if its operations are internal binary operations). (Contributed by FL, 13-Feb-2010) (Revised by AV, 25-Jan-2020) (Proof shortened by AV, 19-Jun-2026)

Ref Expression
Hypotheses srg1zr.b ⊢ B = Base R
srg1zr.p ⊢ + ˙ = + R
srg1zr.t ⊢ ∗ ˙ = ⋅ R
Assertion srg1zr ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → B = Z ↔ + ˙ = Z Z Z ∧ ∗ ˙ = Z Z Z

Proof

Step Hyp Ref Expression
1 srg1zr.b ⊢ B = Base R
2 srg1zr.p ⊢ + ˙ = + R
3 srg1zr.t ⊢ ∗ ˙ = ⋅ R
4 srgmnd ⊢ R ∈ SRing → R ∈ Mnd
5 mndmgm ⊢ R ∈ Mnd → R ∈ Mgm
6 4 5 syl ⊢ R ∈ SRing → R ∈ Mgm
7 eqid ⊢ mulGrp R = mulGrp R
8 7 srgmgp ⊢ R ∈ SRing → mulGrp R ∈ Mnd
9 mndmgm ⊢ mulGrp R ∈ Mnd → mulGrp R ∈ Mgm
10 8 9 syl ⊢ R ∈ SRing → mulGrp R ∈ Mgm
11 6 10 jca ⊢ R ∈ SRing → R ∈ Mgm ∧ mulGrp R ∈ Mgm
12 11 3ad2ant1 ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B → R ∈ Mgm ∧ mulGrp R ∈ Mgm
13 12 adantr ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → R ∈ Mgm ∧ mulGrp R ∈ Mgm
14 3simpc ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B → + ˙ Fn B × B ∧ ∗ ˙ Fn B × B
15 14 adantr ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → + ˙ Fn B × B ∧ ∗ ˙ Fn B × B
16 simpr ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → Z ∈ B
17 1 2 3 rng1zrlem ⊢ R ∈ Mgm ∧ mulGrp R ∈ Mgm ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → B = Z ↔ + ˙ = Z Z Z ∧ ∗ ˙ = Z Z Z
18 13 15 16 17 syl3anc ⊢ R ∈ SRing ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → B = Z ↔ + ˙ = Z Z Z ∧ ∗ ˙ = Z Z Z