Metamath Proof Explorer


Theorem rnglz

Description: The zero of a non-unital ring is a left-absorbing element. (Contributed by FL, 31-Aug-2009) Generalization of ringlz . (Revised by AV, 17-Apr-2020)

Ref Expression
Hypotheses rngcl.b ⊢ B = Base R
rngcl.t ⊢ · ˙ = ⋅ R
rnglz.z ⊢ 0 ˙ = 0 R
Assertion rnglz ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ · ˙ X = 0 ˙

Proof

Step Hyp Ref Expression
1 rngcl.b ⊢ B = Base R
2 rngcl.t ⊢ · ˙ = ⋅ R
3 rnglz.z ⊢ 0 ˙ = 0 R
4 rngabl ⊢ R ∈ Rng → R ∈ Abel
5 ablgrp ⊢ R ∈ Abel → R ∈ Grp
6 4 5 syl ⊢ R ∈ Rng → R ∈ Grp
7 1 3 grpidcl ⊢ R ∈ Grp → 0 ˙ ∈ B
8 eqid ⊢ + R = + R
9 1 8 3 grplid ⊢ R ∈ Grp ∧ 0 ˙ ∈ B → 0 ˙ + R 0 ˙ = 0 ˙
10 6 7 9 syl2anc2 ⊢ R ∈ Rng → 0 ˙ + R 0 ˙ = 0 ˙
11 10 adantr ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ + R 0 ˙ = 0 ˙
12 11 oveq1d ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ + R 0 ˙ · ˙ X = 0 ˙ · ˙ X
13 simpl ⊢ R ∈ Rng ∧ X ∈ B → R ∈ Rng
14 6 7 syl ⊢ R ∈ Rng → 0 ˙ ∈ B
15 14 14 jca ⊢ R ∈ Rng → 0 ˙ ∈ B ∧ 0 ˙ ∈ B
16 15 anim1i ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ ∈ B ∧ 0 ˙ ∈ B ∧ X ∈ B
17 df-3an ⊢ 0 ˙ ∈ B ∧ 0 ˙ ∈ B ∧ X ∈ B ↔ 0 ˙ ∈ B ∧ 0 ˙ ∈ B ∧ X ∈ B
18 16 17 sylibr ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ ∈ B ∧ 0 ˙ ∈ B ∧ X ∈ B
19 1 8 2 rngdir ⊢ R ∈ Rng ∧ 0 ˙ ∈ B ∧ 0 ˙ ∈ B ∧ X ∈ B → 0 ˙ + R 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙ · ˙ X
20 13 18 19 syl2anc ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ + R 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙ · ˙ X
21 6 adantr ⊢ R ∈ Rng ∧ X ∈ B → R ∈ Grp
22 14 adantr ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ ∈ B
23 simpr ⊢ R ∈ Rng ∧ X ∈ B → X ∈ B
24 1 2 rngcl ⊢ R ∈ Rng ∧ 0 ˙ ∈ B ∧ X ∈ B → 0 ˙ · ˙ X ∈ B
25 13 22 23 24 syl3anc ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ · ˙ X ∈ B
26 1 8 3 grprid ⊢ R ∈ Grp ∧ 0 ˙ · ˙ X ∈ B → 0 ˙ · ˙ X + R 0 ˙ = 0 ˙ · ˙ X
27 26 eqcomd ⊢ R ∈ Grp ∧ 0 ˙ · ˙ X ∈ B → 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙
28 21 25 27 syl2anc ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙
29 12 20 28 3eqtr3d ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ · ˙ X + R 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙
30 1 8 grplcan ⊢ R ∈ Grp ∧ 0 ˙ · ˙ X ∈ B ∧ 0 ˙ ∈ B ∧ 0 ˙ · ˙ X ∈ B → 0 ˙ · ˙ X + R 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙ ↔ 0 ˙ · ˙ X = 0 ˙
31 21 25 22 25 30 syl13anc ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ · ˙ X + R 0 ˙ · ˙ X = 0 ˙ · ˙ X + R 0 ˙ ↔ 0 ˙ · ˙ X = 0 ˙
32 29 31 mpbid ⊢ R ∈ Rng ∧ X ∈ B → 0 ˙ · ˙ X = 0 ˙