Theorem rngoneglmul 37922

Description: Negation of a product in a ring. (Contributed by Jeff Madsen, 19-Jun-2010.)

Hypotheses

Ref	Expression
ringnegmul.1	⊢ 𝐺 = (1st ‘𝑅)
ringnegmul.2	⊢ 𝐻 = (2nd ‘𝑅)
ringnegmul.3	⊢ 𝑋 = ran 𝐺
ringnegmul.4	⊢ 𝑁 = (inv‘𝐺)

Assertion

Ref	Expression
rngoneglmul	⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘𝐴)𝐻𝐵))

Proof of Theorem rngoneglmul

Step	Hyp	Ref	Expression
1		ringnegmul.3	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
2		ringnegmul.1	. . . . . . . 8 ⊢ 𝐺 = (1st ‘𝑅)
3	2	rneqi 5883	. . . . . . 7 ⊢ ran 𝐺 = ran (1st ‘𝑅)
4	1, 3	eqtri 2752	. . . . . 6 ⊢ 𝑋 = ran (1st ‘𝑅)
5		ringnegmul.2	. . . . . 6 ⊢ 𝐻 = (2nd ‘𝑅)
6		eqid 2729	. . . . . 6 ⊢ (GId‘𝐻) = (GId‘𝐻)
7	4, 5, 6	rngo1cl 37918	. . . . 5 ⊢ (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8		ringnegmul.4	. . . . . 6 ⊢ 𝑁 = (inv‘𝐺)
9	2, 1, 8	rngonegcl 37906	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
10	7, 9	mpdan 687	. . . 4 ⊢ (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
11	2, 5, 1	rngoass 37885	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ ((𝑁‘(GId‘𝐻)) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
12	11	3exp2 1355	. . . 4 ⊢ (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵))))))
13	10, 12	mpd 15	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))))
14	13	3imp 1110	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
15	2, 5, 1, 8, 6	rngonegmn1l 37920	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (𝑁‘𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
16	15	3adant3 1132	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
17	16	oveq1d 7368	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘𝐴)𝐻𝐵) = (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵))
18	2, 5, 1	rngocl 37880	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
19	18	3expb 1120	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
20	2, 5, 1, 8, 6	rngonegmn1l 37920	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
21	19, 20	syldan 591	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
22	21	3impb 1114	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
23	14, 17, 22	3eqtr4rd 2775	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘𝐴)𝐻𝐵))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ran crn 5624  ‘cfv 6486  (class class class)co 7353  1^st c1st 7929  2^nd c2nd 7930  GIdcgi 30452  invcgn 30453  RingOpscrngo 37873

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7675

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-1st 7931  df-2nd 7932  df-grpo 30455  df-gid 30456  df-ginv 30457  df-ablo 30507  df-ass 37822  df-exid 37824  df-mgmOLD 37828  df-sgrOLD 37840  df-mndo 37846  df-rngo 37874

This theorem is referenced by:  rngosubdir  37925