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 36080
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 5843 . . . . . . 7 ran 𝐺 = ran (1st𝑅)
41, 3eqtri 2767 . . . . . 6 𝑋 = ran (1st𝑅)
5 ringnegmul.2 . . . . . 6 𝐻 = (2nd𝑅)
6 eqid 2739 . . . . . 6 (GId‘𝐻) = (GId‘𝐻)
74, 5, 6rngo1cl 36076 . . . . 5 (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8 ringnegmul.4 . . . . . 6 𝑁 = (inv‘𝐺)
92, 1, 8rngonegcl 36064 . . . . 5 ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
107, 9mpdan 683 . . . 4 (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
112, 5, 1rngoass 36043 . . . . 5 ((𝑅 ∈ RingOps ∧ ((𝑁‘(GId‘𝐻)) ∈ 𝑋𝐴𝑋𝐵𝑋)) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
12113exp2 1352 . . . 4 (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴𝑋 → (𝐵𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵))))))
1310, 12mpd 15 . . 3 (𝑅 ∈ RingOps → (𝐴𝑋 → (𝐵𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))))
14133imp 1109 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
152, 5, 1, 8, 6rngonegmn1l 36078 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
16153adant3 1130 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
1716oveq1d 7283 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → ((𝑁𝐴)𝐻𝐵) = (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵))
182, 5, 1rngocl 36038 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
19183expb 1118 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
202, 5, 1, 8, 6rngonegmn1l 36078 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2119, 20syldan 590 . . 3 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
22213impb 1113 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2314, 17, 223eqtr4rd 2790 1 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁𝐴)𝐻𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1541  wcel 2109  ran crn 5589  cfv 6430  (class class class)co 7268  1st c1st 7815  2nd c2nd 7816  GIdcgi 28831  invcgn 28832  RingOpscrngo 36031
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pr 5355  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rmo 3073  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-riota 7225  df-ov 7271  df-1st 7817  df-2nd 7818  df-grpo 28834  df-gid 28835  df-ginv 28836  df-ablo 28886  df-ass 35980  df-exid 35982  df-mgmOLD 35986  df-sgrOLD 35998  df-mndo 36004  df-rngo 36032
This theorem is referenced by:  rngosubdir  36083
  Copyright terms: Public domain W3C validator