Metamath Proof Explorer


Theorem rng1zr

Description: The only ring 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, 18-Jun-2026)

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

Proof

Step Hyp Ref Expression
1 rng1zr.b ⊢ B = Base R
2 rng1zr.p ⊢ + ˙ = + R
3 rng1zr.t ⊢ ∗ ˙ = ⋅ R
4 rnggrp ⊢ R ∈ Rng → R ∈ Grp
5 4 grpmgmd ⊢ R ∈ Rng → R ∈ Mgm
6 eqid ⊢ mulGrp R = mulGrp R
7 6 rngmgp ⊢ R ∈ Rng → mulGrp R ∈ Smgrp
8 sgrpmgm ⊢ mulGrp R ∈ Smgrp → mulGrp R ∈ Mgm
9 7 8 syl ⊢ R ∈ Rng → mulGrp R ∈ Mgm
10 5 9 jca ⊢ R ∈ Rng → R ∈ Mgm ∧ mulGrp R ∈ Mgm
11 10 3ad2ant1 ⊢ R ∈ Rng ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B → R ∈ Mgm ∧ mulGrp R ∈ Mgm
12 11 adantr ⊢ R ∈ Rng ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → R ∈ Mgm ∧ mulGrp R ∈ Mgm
13 3simpc ⊢ R ∈ Rng ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B → + ˙ Fn B × B ∧ ∗ ˙ Fn B × B
14 13 adantr ⊢ R ∈ Rng ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → + ˙ Fn B × B ∧ ∗ ˙ Fn B × B
15 simpr ⊢ R ∈ Rng ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → Z ∈ B
16 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
17 12 14 15 16 syl3anc ⊢ R ∈ Rng ∧ + ˙ Fn B × B ∧ ∗ ˙ Fn B × B ∧ Z ∈ B → B = Z ↔ + ˙ = Z Z Z ∧ ∗ ˙ = Z Z Z