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 38115
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 5887 . . . . . . 7 ran 𝐺 = ran (1st𝑅)
41, 3eqtri 2760 . . . . . 6 𝑋 = ran (1st𝑅)
5 ringnegmul.2 . . . . . 6 𝐻 = (2nd𝑅)
6 eqid 2737 . . . . . 6 (GId‘𝐻) = (GId‘𝐻)
74, 5, 6rngo1cl 38111 . . . . 5 (𝑅 ∈ RingOps → (GId‘𝐻) ∈ 𝑋)
8 ringnegmul.4 . . . . . 6 𝑁 = (inv‘𝐺)
92, 1, 8rngonegcl 38099 . . . . 5 ((𝑅 ∈ RingOps ∧ (GId‘𝐻) ∈ 𝑋) → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
107, 9mpdan 688 . . . 4 (𝑅 ∈ RingOps → (𝑁‘(GId‘𝐻)) ∈ 𝑋)
112, 5, 1rngoass 38078 . . . . 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 38113 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐴𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
16153adant3 1133 . . 3 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁𝐴) = ((𝑁‘(GId‘𝐻))𝐻𝐴))
1716oveq1d 7375 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → ((𝑁𝐴)𝐻𝐵) = (((𝑁‘(GId‘𝐻))𝐻𝐴)𝐻𝐵))
182, 5, 1rngocl 38073 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
19183expb 1121 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
202, 5, 1, 8, 6rngonegmn1l 38113 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴𝐻𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2119, 20syldan 592 . . 3 ((𝑅 ∈ RingOps ∧ (𝐴𝑋𝐵𝑋)) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
22213impb 1115 . 2 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁‘(GId‘𝐻))𝐻(𝐴𝐻𝐵)))
2314, 17, 223eqtr4rd 2783 1 ((𝑅 ∈ RingOps ∧ 𝐴𝑋𝐵𝑋) → (𝑁‘(𝐴𝐻𝐵)) = ((𝑁𝐴)𝐻𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  ran crn 5626  cfv 6493  (class class class)co 7360  1st c1st 7933  2nd c2nd 7934  GIdcgi 30548  invcgn 30549  RingOpscrngo 38066
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 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7317  df-ov 7363  df-1st 7935  df-2nd 7936  df-grpo 30551  df-gid 30552  df-ginv 30553  df-ablo 30603  df-ass 38015  df-exid 38017  df-mgmOLD 38021  df-sgrOLD 38033  df-mndo 38039  df-rngo 38067
This theorem is referenced by:  rngosubdir  38118
  Copyright terms: Public domain W3C validator