Metamath Proof Explorer


Theorem ringnegl

Description: Negation in a ring is the same as left multiplication by -1. ( rngonegmn1l analog.) (Contributed by Jeff Madsen, 19-Jun-2010) (Revised by Mario Carneiro, 2-Jul-2014)

Ref Expression
Hypotheses ringnegl.b ⊢ B = Base R
ringnegl.t ⊢ · ˙ = ⋅ R
ringnegl.u ⊢ 1 ˙ = 1 R
ringnegl.n ⊢ N = inv g ⁡ R
ringnegl.r ⊢ φ → R ∈ Ring
ringnegl.x ⊢ φ → X ∈ B
Assertion ringnegl ⊢ φ → N ⁡ 1 ˙ · ˙ X = N ⁡ X

Proof

Step Hyp Ref Expression
1 ringnegl.b ⊢ B = Base R
2 ringnegl.t ⊢ · ˙ = ⋅ R
3 ringnegl.u ⊢ 1 ˙ = 1 R
4 ringnegl.n ⊢ N = inv g ⁡ R
5 ringnegl.r ⊢ φ → R ∈ Ring
6 ringnegl.x ⊢ φ → X ∈ B
7 1 3 ringidcl ⊢ R ∈ Ring → 1 ˙ ∈ B
8 5 7 syl ⊢ φ → 1 ˙ ∈ B
9 ringgrp ⊢ R ∈ Ring → R ∈ Grp
10 5 9 syl ⊢ φ → R ∈ Grp
11 1 4 grpinvcl ⊢ R ∈ Grp ∧ 1 ˙ ∈ B → N ⁡ 1 ˙ ∈ B
12 10 8 11 syl2anc ⊢ φ → N ⁡ 1 ˙ ∈ B
13 eqid ⊢ + R = + R
14 1 13 2 ringdir ⊢ R ∈ Ring ∧ 1 ˙ ∈ B ∧ N ⁡ 1 ˙ ∈ B ∧ X ∈ B → 1 ˙ + R N ⁡ 1 ˙ · ˙ X = 1 ˙ · ˙ X + R N ⁡ 1 ˙ · ˙ X
15 5 8 12 6 14 syl13anc ⊢ φ → 1 ˙ + R N ⁡ 1 ˙ · ˙ X = 1 ˙ · ˙ X + R N ⁡ 1 ˙ · ˙ X
16 eqid ⊢ 0 R = 0 R
17 1 13 16 4 grprinv ⊢ R ∈ Grp ∧ 1 ˙ ∈ B → 1 ˙ + R N ⁡ 1 ˙ = 0 R
18 10 8 17 syl2anc ⊢ φ → 1 ˙ + R N ⁡ 1 ˙ = 0 R
19 18 oveq1d ⊢ φ → 1 ˙ + R N ⁡ 1 ˙ · ˙ X = 0 R · ˙ X
20 1 2 16 ringlz ⊢ R ∈ Ring ∧ X ∈ B → 0 R · ˙ X = 0 R
21 5 6 20 syl2anc ⊢ φ → 0 R · ˙ X = 0 R
22 19 21 eqtrd ⊢ φ → 1 ˙ + R N ⁡ 1 ˙ · ˙ X = 0 R
23 1 2 3 ringlidm ⊢ R ∈ Ring ∧ X ∈ B → 1 ˙ · ˙ X = X
24 5 6 23 syl2anc ⊢ φ → 1 ˙ · ˙ X = X
25 24 oveq1d ⊢ φ → 1 ˙ · ˙ X + R N ⁡ 1 ˙ · ˙ X = X + R N ⁡ 1 ˙ · ˙ X
26 15 22 25 3eqtr3rd ⊢ φ → X + R N ⁡ 1 ˙ · ˙ X = 0 R
27 1 2 ringcl ⊢ R ∈ Ring ∧ N ⁡ 1 ˙ ∈ B ∧ X ∈ B → N ⁡ 1 ˙ · ˙ X ∈ B
28 5 12 6 27 syl3anc ⊢ φ → N ⁡ 1 ˙ · ˙ X ∈ B
29 1 13 16 4 grpinvid1 ⊢ R ∈ Grp ∧ X ∈ B ∧ N ⁡ 1 ˙ · ˙ X ∈ B → N ⁡ X = N ⁡ 1 ˙ · ˙ X ↔ X + R N ⁡ 1 ˙ · ˙ X = 0 R
30 10 6 28 29 syl3anc ⊢ φ → N ⁡ X = N ⁡ 1 ˙ · ˙ X ↔ X + R N ⁡ 1 ˙ · ˙ X = 0 R
31 26 30 mpbird ⊢ φ → N ⁡ X = N ⁡ 1 ˙ · ˙ X
32 31 eqcomd ⊢ φ → N ⁡ 1 ˙ · ˙ X = N ⁡ X