ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulgass3 GIF version

Theorem mulgass3 13581
Description: An associative property between group multiple and ring multiplication. (Contributed by Mario Carneiro, 14-Jun-2015.)
Hypotheses
Ref Expression
mulgass3.b 𝐵 = (Base‘𝑅)
mulgass3.m · = (.g𝑅)
mulgass3.t × = (.r𝑅)
Assertion
Ref Expression
mulgass3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌)))

Proof of Theorem mulgass3
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2193 . . . . . 6 (oppr𝑅) = (oppr𝑅)
21opprring 13575 . . . . 5 (𝑅 ∈ Ring → (oppr𝑅) ∈ Ring)
32adantr 276 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Ring)
4 simpr1 1005 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑁 ∈ ℤ)
5 simpr3 1007 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌𝐵)
6 mulgass3.b . . . . . . 7 𝐵 = (Base‘𝑅)
71, 6opprbasg 13571 . . . . . 6 (𝑅 ∈ Ring → 𝐵 = (Base‘(oppr𝑅)))
87adantr 276 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘(oppr𝑅)))
95, 8eleqtrd 2272 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌 ∈ (Base‘(oppr𝑅)))
10 simpr2 1006 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋𝐵)
1110, 8eleqtrd 2272 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋 ∈ (Base‘(oppr𝑅)))
12 eqid 2193 . . . . 5 (Base‘(oppr𝑅)) = (Base‘(oppr𝑅))
13 eqid 2193 . . . . 5 (.g‘(oppr𝑅)) = (.g‘(oppr𝑅))
14 eqid 2193 . . . . 5 (.r‘(oppr𝑅)) = (.r‘(oppr𝑅))
1512, 13, 14mulgass2 13554 . . . 4 (((oppr𝑅) ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑌 ∈ (Base‘(oppr𝑅)) ∧ 𝑋 ∈ (Base‘(oppr𝑅)))) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)))
163, 4, 9, 11, 15syl13anc 1251 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)))
17 simpl 109 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑅 ∈ Ring)
183ringgrpd 13501 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Grp)
1912, 13, 18, 4, 9mulgcld 13214 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ (Base‘(oppr𝑅)))
2019, 8eleqtrrd 2273 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵)
21 mulgass3.t . . . . 5 × = (.r𝑅)
226, 21, 1, 14opprmulg 13567 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵𝑋𝐵) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
2317, 20, 10, 22syl3anc 1249 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
246, 21, 1, 14opprmulg 13567 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑌𝐵𝑋𝐵) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2517, 5, 10, 24syl3anc 1249 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2625oveq2d 5934 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
2716, 23, 263eqtr3d 2234 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
28 mulgass3.m . . . . . 6 · = (.g𝑅)
2928a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g𝑅))
30 eqidd 2194 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (.g‘(oppr𝑅)) = (.g‘(oppr𝑅)))
316a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘𝑅))
32 ssidd 3200 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵𝐵)
33 eqid 2193 . . . . . . . 8 (+g𝑅) = (+g𝑅)
346, 33ringacl 13526 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑥𝐵𝑦𝐵) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
35343expb 1206 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
3635adantlr 477 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
371, 33oppraddg 13572 . . . . . . 7 (𝑅 ∈ Ring → (+g𝑅) = (+g‘(oppr𝑅)))
3837oveqdr 5946 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
3938adantr 276 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
4029, 30, 17, 3, 31, 8, 32, 36, 39mulgpropdg 13234 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g‘(oppr𝑅)))
4140oveqd 5935 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr𝑅))𝑌))
4241oveq2d 5934 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
4340oveqd 5935 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
4427, 42, 433eqtr4d 2236 1 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2164  cfv 5254  (class class class)co 5918  cz 9317  Basecbs 12618  +gcplusg 12695  .rcmulr 12696  .gcmg 13189  Ringcrg 13492  opprcoppr 13563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-iinf 4620  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-ltadd 7988
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-if 3558  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-ilim 4400  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-tpos 6298  df-recs 6358  df-frec 6444  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-inn 8983  df-2 9041  df-3 9042  df-n0 9241  df-z 9318  df-uz 9593  df-fz 10075  df-seqfrec 10519  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-plusg 12708  df-mulr 12709  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075  df-minusg 13076  df-mulg 13190  df-mgp 13417  df-ur 13456  df-ring 13494  df-oppr 13564
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator