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 38252
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 5881 . . . . . . 7 ran 𝐺 = ran (1st𝑅)
41, 3eqtri 2758 . . . . . 6 𝑋 = ran (1st𝑅)
5 ringnegmul.2 . . . . . 6 𝐻 = (2nd𝑅)
6 eqid 2735 . . . . . 6 (GId‘𝐻) = (GId‘𝐻)
74, 5, 6rngo1cl 38248 . . . . 5 (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8 ringnegmul.4 . . . . . 6 𝑁 = (inv‘𝐺)
92, 1, 8rngonegcl 38236 . . . . 5 ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
107, 9mpdan 688 . . . 4 (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
112, 5, 1rngoass 38215 . . . . 5 ((𝑅 ∈ RingOps ∧ ((𝑁‘(GId‘𝐻)) ∈ 𝑋𝐴𝑋𝐵𝑋)) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
12113exp2 1356 . . . 4 (𝑅 ∈ RingOps → ((𝑁‘(GId‘𝐻)) ∈ 𝑋 → (𝐴𝑋 → (𝐵𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵))))))
1310, 12mpd 15 . . 3 (𝑅 ∈ RingOps → (𝐴𝑋 → (𝐵𝑋 → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))))
14133imp 1111 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
152, 5, 1, 8, 6rngonegmn1l 38250 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
16153adant3 1133 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
1716oveq1d 7371 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → ((𝑁𝐴)𝐻𝐵) = (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵))
182, 5, 1rngocl 38210 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
19183expb 1121 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
202, 5, 1, 8, 6rngonegmn1l 38250 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2119, 20syldan 592 . . 3 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
22213impb 1115 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2314, 17, 223eqtr4rd 2781 1 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁𝐴)𝐻𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  ran crn 5621  cfv 6487  (class class class)co 7356  1st c1st 7929  2nd c2nd 7930  GIdcgi 30549  invcgn 30550  RingOpscrngo 38203
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2184  ax-ext 2707  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pr 5364  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2931  df-ral 3050  df-rex 3060  df-rmo 3340  df-reu 3341  df-rab 3388  df-v 3429  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-riota 7313  df-ov 7359  df-1st 7931  df-2nd 7932  df-grpo 30552  df-gid 30553  df-ginv 30554  df-ablo 30604  df-ass 38152  df-exid 38154  df-mgmOLD 38158  df-sgrOLD 38170  df-mndo 38176  df-rngo 38204
This theorem is referenced by:  rngosubdir  38255
  Copyright terms: Public domain W3C validator