Theorem rngonegrmul 37973

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
rngonegrmul	⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = (𝐴𝐻(𝑁‘𝐵)))

Proof of Theorem rngonegrmul

Step	Hyp	Ref	Expression
1		ringnegmul.3	. . . . . . 7 ⊢ 𝑋 = ran 𝐺
2		ringnegmul.1	. . . . . . . 8 ⊢ 𝐺 = (1st ‘𝑅)
3	2	rneqi 5922	. . . . . . 7 ⊢ ran 𝐺 = ran (1st ‘𝑅)
4	1, 3	eqtri 2759	. . . . . 6 ⊢ 𝑋 = ran (1st ‘𝑅)
5		ringnegmul.2	. . . . . 6 ⊢ 𝐻 = (2nd ‘𝑅)
6		eqid 2736	. . . . . 6 ⊢ (GId‘𝐻) = (GId‘𝐻)
7	4, 5, 6	rngo1cl 37968	. . . . 5 ⊢ (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8		ringnegmul.4	. . . . . 6 ⊢ 𝑁 = (inv‘𝐺)
9	2, 1, 8	rngonegcl 37956	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
10	7, 9	mpdan 687	. . . 4 ⊢ (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
11	2, 5, 1	rngoass 37935	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ (𝑁‘(GId‘𝐻)) ∈ 𝑋)) → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
12	11	3exp2 1355	. . . . . 6 ⊢ (𝑅 ∈ RingOps → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
13	12	com24 95	. . . . 5 ⊢ (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴 ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
14	13	com34 91	. . . 4 ⊢ (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
15	10, 14	mpd 15	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))))
16	15	3imp 1110	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
17	2, 5, 1	rngocl 37930	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
18	17	3expb 1120	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
19	2, 5, 1, 8, 6	rngonegmn1r 37971	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
20	18, 19	syldan 591	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
21	20	3impb 1114	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
22	2, 5, 1, 8, 6	rngonegmn1r 37971	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) = (𝐵𝐻(𝑁‘(GId‘𝐻))))
23	22	3adant2 1131	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) = (𝐵𝐻(𝑁‘(GId‘𝐻))))
24	23	oveq2d 7426	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐻(𝑁‘𝐵)) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
25	16, 21, 24	3eqtr4d 2781	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = (𝐴𝐻(𝑁‘𝐵)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ran crn 5660  ‘cfv 6536  (class class class)co 7410  1^st c1st 7991  2^nd c2nd 7992  GIdcgi 30476  invcgn 30477  RingOpscrngo 37923

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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-un 7734

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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-1st 7993  df-2nd 7994  df-grpo 30479  df-gid 30480  df-ginv 30481  df-ablo 30531  df-ass 37872  df-exid 37874  df-mgmOLD 37878  df-sgrOLD 37890  df-mndo 37896  df-rngo 37924

This theorem is referenced by:  rngosubdi  37974