Theorem rngonegrmul 38696

Description: Obsolete theorem, use ringmneg2 20451 instead. Negation of a product in a ring. (Contributed by Jeff Madsen, 19-Jun-2010.) (New usage is discouraged.) (Proof modification is discouraged.)

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 5925	. . . . . . 7 ⊢ ran 𝐺 = ran (1st ‘𝑅)
4	1, 3	eqtri 2785	. . . . . 6 ⊢ 𝑋 = ran (1st ‘𝑅)
5		ringnegmul.2	. . . . . 6 ⊢ 𝐻 = (2nd ‘𝑅)
6		eqid 2762	. . . . . 6 ⊢ (GId‘𝐻) = (GId‘𝐻)
7	4, 5, 6	rngo1cl 38691	. . . . 5 ⊢ (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8		ringnegmul.4	. . . . . 6 ⊢ 𝑁 = (inv‘𝐺)
9	2, 1, 8	rngonegcl 38679	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
10	7, 9	mpdan 700	. . . 4 ⊢ (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
11	2, 5, 1	rngoass 38658	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ (𝑁‘(GId‘𝐻)) ∈ 𝑋)) → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
12	11	3exp2 1373	. . . . . 6 ⊢ (𝑅 ∈ RingOps → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
13	12	com24 96	. . . . 5 ⊢ (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴 ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
14	13	com34 92	. . . 4 ⊢ (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
15	10, 14	mpd 16	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))))
16	15	3imp 1128	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
17	2, 5, 1	rngocl 38653	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
18	17	3expb 1138	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
19	2, 5, 1, 8, 6	rngonegmn1r 38694	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
20	18, 19	syldan 603	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
21	20	3impb 1132	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
22	2, 5, 1, 8, 6	rngonegmn1r 38694	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) = (𝐵𝐻(𝑁‘(GId‘𝐻))))
23	22	3adant2 1149	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) = (𝐵𝐻(𝑁‘(GId‘𝐻))))
24	23	oveq2d 7432	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐻(𝑁‘𝐵)) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
25	16, 21, 24	3eqtr4d 2807	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = (𝐴𝐻(𝑁‘𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ran crn 5660  ‘cfv 6537  (class class class)co 7416  1^st c1st 7987  2^nd c2nd 7988  GIdcgi 30972  invcgn 30973  RingOpscrngo 38646

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-1st 7989  df-2nd 7990  df-grpo 30975  df-gid 30976  df-ginv 30977  df-ablo 31027  df-ass 38595  df-exid 38597  df-mgmOLD 38601  df-sgrOLD 38613  df-mndo 38619  df-rngo 38647

This theorem is used by:  rngosubdi  38697