Metamath Proof Explorer


Theorem ringmneg2

Description: Negation of a product in a ring. ( mulneg2 analog.) Compared with rngmneg2 , the proof is shorter making use of the existence of a ring unity. (Contributed by Jeff Madsen, 19-Jun-2010) (Revised by Mario Carneiro, 2-Jul-2014)

Ref Expression
Hypotheses ringneglmul.b ⊢ B = Base R
ringneglmul.t ⊢ · ˙ = ⋅ R
ringneglmul.n ⊢ N = inv g ⁡ R
ringneglmul.r ⊢ φ → R ∈ Ring
ringneglmul.x ⊢ φ → X ∈ B
ringneglmul.y ⊢ φ → Y ∈ B
Assertion ringmneg2 ⊢ φ → X · ˙ N ⁡ Y = N ⁡ X · ˙ Y

Proof

Step Hyp Ref Expression
1 ringneglmul.b ⊢ B = Base R
2 ringneglmul.t ⊢ · ˙ = ⋅ R
3 ringneglmul.n ⊢ N = inv g ⁡ R
4 ringneglmul.r ⊢ φ → R ∈ Ring
5 ringneglmul.x ⊢ φ → X ∈ B
6 ringneglmul.y ⊢ φ → Y ∈ B
7 ringgrp ⊢ R ∈ Ring → R ∈ Grp
8 4 7 syl ⊢ φ → R ∈ Grp
9 eqid ⊢ 1 R = 1 R
10 1 9 ringidcl ⊢ R ∈ Ring → 1 R ∈ B
11 4 10 syl ⊢ φ → 1 R ∈ B
12 1 3 grpinvcl ⊢ R ∈ Grp ∧ 1 R ∈ B → N ⁡ 1 R ∈ B
13 8 11 12 syl2anc ⊢ φ → N ⁡ 1 R ∈ B
14 1 2 ringass ⊢ R ∈ Ring ∧ X ∈ B ∧ Y ∈ B ∧ N ⁡ 1 R ∈ B → X · ˙ Y · ˙ N ⁡ 1 R = X · ˙ Y · ˙ N ⁡ 1 R
15 4 5 6 13 14 syl13anc ⊢ φ → X · ˙ Y · ˙ N ⁡ 1 R = X · ˙ Y · ˙ N ⁡ 1 R
16 1 2 ringcl ⊢ R ∈ Ring ∧ X ∈ B ∧ Y ∈ B → X · ˙ Y ∈ B
17 4 5 6 16 syl3anc ⊢ φ → X · ˙ Y ∈ B
18 1 2 9 3 4 17 ringnegr ⊢ φ → X · ˙ Y · ˙ N ⁡ 1 R = N ⁡ X · ˙ Y
19 1 2 9 3 4 6 ringnegr ⊢ φ → Y · ˙ N ⁡ 1 R = N ⁡ Y
20 19 oveq2d ⊢ φ → X · ˙ Y · ˙ N ⁡ 1 R = X · ˙ N ⁡ Y
21 15 18 20 3eqtr3rd ⊢ φ → X · ˙ N ⁡ Y = N ⁡ X · ˙ Y