Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rngoneglmul Structured version   Visualization version   GIF version

Theorem rngoneglmul 38140
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
StepHypRef Expression
1 ringnegmul.3 . . . . . . 7 𝑋 = ran 𝐺
2 ringnegmul.1 . . . . . . . 8 𝐺 = (1st𝑅)
32rneqi 5886 . . . . . . 7 ran 𝐺 = ran (1st𝑅)
41, 3eqtri 2759 . . . . . 6 𝑋 = ran (1st𝑅)
5 ringnegmul.2 . . . . . 6 𝐻 = (2nd𝑅)
6 eqid 2736 . . . . . 6 (GId‘𝐻) = (GId‘𝐻)
74, 5, 6rngo1cl 38136 . . . . 5 (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8 ringnegmul.4 . . . . . 6 𝑁 = (inv‘𝐺)
92, 1, 8rngonegcl 38124 . . . . 5 ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
107, 9mpdan 687 . . . 4 (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
112, 5, 1rngoass 38103 . . . . 5 ((𝑅 ∈ RingOps ∧ ((𝑁‘(GId‘𝐻)) ∈ 𝑋𝐴𝑋𝐵𝑋)) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
12113exp2 1355 . . . 4 (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴𝑋 → (𝐵𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵))))))
1310, 12mpd 15 . . 3 (𝑅 ∈ RingOps → (𝐴𝑋 → (𝐵𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))))
14133imp 1110 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
152, 5, 1, 8, 6rngonegmn1l 38138 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
16153adant3 1132 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
1716oveq1d 7373 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → ((𝑁𝐴)𝐻𝐵) = (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵))
182, 5, 1rngocl 38098 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
19183expb 1120 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
202, 5, 1, 8, 6rngonegmn1l 38138 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2119, 20syldan 591 . . 3 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
22213impb 1114 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2314, 17, 223eqtr4rd 2782 1 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁𝐴)𝐻𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wcel 2113  ran crn 5625  cfv 6492  (class class class)co 7358  1st c1st 7931  2nd c2nd 7932  GIdcgi 30565  invcgn 30566  RingOpscrngo 38091
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-1st 7933  df-2nd 7934  df-grpo 30568  df-gid 30569  df-ginv 30570  df-ablo 30620  df-ass 38040  df-exid 38042  df-mgmOLD 38046  df-sgrOLD 38058  df-mndo 38064  df-rngo 38092
This theorem is referenced by:  rngosubdir  38143
  Copyright terms: Public domain W3C validator