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

Theorem rngonegrmul 33723
 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
StepHypRef Expression
1 ringnegmul.3 . . . . . . 7 𝑋 = ran 𝐺
2 ringnegmul.1 . . . . . . . 8 𝐺 = (1st𝑅)
32rneqi 5350 . . . . . . 7 ran 𝐺 = ran (1st𝑅)
41, 3eqtri 2643 . . . . . 6 𝑋 = ran (1st𝑅)
5 ringnegmul.2 . . . . . 6 𝐻 = (2nd𝑅)
6 eqid 2621 . . . . . 6 (GId‘𝐻) = (GId‘𝐻)
74, 5, 6rngo1cl 33718 . . . . 5 (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8 ringnegmul.4 . . . . . 6 𝑁 = (inv‘𝐺)
92, 1, 8rngonegcl 33706 . . . . 5 ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
107, 9mpdan 702 . . . 4 (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
112, 5, 1rngoass 33685 . . . . . . 7 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋 ∧ (𝑁‘(GId‘𝐻)) ∈ 𝑋)) → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
12113exp2 1284 . . . . . 6 (𝑅 ∈ RingOps → (𝐴𝑋 → (𝐵𝑋 → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
1312com24 95 . . . . 5 (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐵𝑋 → (𝐴𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
1413com34 91 . . . 4 (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴𝑋 → (𝐵𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻))))))))
1510, 14mpd 15 . . 3 (𝑅 ∈ RingOps → (𝐴𝑋 → (𝐵𝑋 → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))))
16153imp 1255 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
172, 5, 1rngocl 33680 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
18173expb 1265 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
192, 5, 1, 8, 6rngonegmn1r 33721 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
2018, 19syldan 487 . . 3 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
21203impb 1259 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝐴𝐻𝐵)𝐻(𝑁‘(GId‘𝐻))))
222, 5, 1, 8, 6rngonegmn1r 33721 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐵𝑋) → (𝑁𝐵) = (𝐵𝐻(𝑁‘(GId‘𝐻))))
23223adant2 1079 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁𝐵) = (𝐵𝐻(𝑁‘(GId‘𝐻))))
2423oveq2d 6663 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐻(𝑁𝐵)) = (𝐴𝐻(𝐵𝐻(𝑁‘(GId‘𝐻)))))
2516, 21, 243eqtr4d 2665 1 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = (𝐴𝐻(𝑁𝐵)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1482   ∈ wcel 1989  ran crn 5113  ‘cfv 5886  (class class class)co 6647  1st c1st 7163  2nd c2nd 7164  GIdcgi 27328  invcgn 27329  RingOpscrngo 33673 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-8 1991  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-rep 4769  ax-sep 4779  ax-nul 4787  ax-pow 4841  ax-pr 4904  ax-un 6946 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-ne 2794  df-ral 2916  df-rex 2917  df-reu 2918  df-rmo 2919  df-rab 2920  df-v 3200  df-sbc 3434  df-csb 3532  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-nul 3914  df-if 4085  df-sn 4176  df-pr 4178  df-op 4182  df-uni 4435  df-iun 4520  df-br 4652  df-opab 4711  df-mpt 4728  df-id 5022  df-xp 5118  df-rel 5119  df-cnv 5120  df-co 5121  df-dm 5122  df-rn 5123  df-res 5124  df-ima 5125  df-iota 5849  df-fun 5888  df-fn 5889  df-f 5890  df-f1 5891  df-fo 5892  df-f1o 5893  df-fv 5894  df-riota 6608  df-ov 6650  df-1st 7165  df-2nd 7166  df-grpo 27331  df-gid 27332  df-ginv 27333  df-ablo 27383  df-ass 33622  df-exid 33624  df-mgmOLD 33628  df-sgrOLD 33640  df-mndo 33646  df-rngo 33674 This theorem is referenced by:  rngosubdi  33724
 Copyright terms: Public domain W3C validator