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

Theorem mulgass3 14104
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 2231 . . . . . 6 (oppr𝑅) = (oppr𝑅)
21opprring 14098 . . . . 5 (𝑅 ∈ Ring → (oppr𝑅) ∈ Ring)
32adantr 276 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Ring)
4 simpr1 1029 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑁 ∈ ℤ)
5 simpr3 1031 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌𝐵)
6 mulgass3.b . . . . . . 7 𝐵 = (Base‘𝑅)
71, 6opprbasg 14094 . . . . . 6 (𝑅 ∈ Ring → 𝐵 = (Base‘(oppr𝑅)))
87adantr 276 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘(oppr𝑅)))
95, 8eleqtrd 2310 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌 ∈ (Base‘(oppr𝑅)))
10 simpr2 1030 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋𝐵)
1110, 8eleqtrd 2310 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋 ∈ (Base‘(oppr𝑅)))
12 eqid 2231 . . . . 5 (Base‘(oppr𝑅)) = (Base‘(oppr𝑅))
13 eqid 2231 . . . . 5 (.g‘(oppr𝑅)) = (.g‘(oppr𝑅))
14 eqid 2231 . . . . 5 (.r‘(oppr𝑅)) = (.r‘(oppr𝑅))
1512, 13, 14mulgass2 14077 . . . 4 (((oppr𝑅) ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑌 ∈ (Base‘(oppr𝑅)) ∧ 𝑋 ∈ (Base‘(oppr𝑅)))) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)))
163, 4, 9, 11, 15syl13anc 1275 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)))
17 simpl 109 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑅 ∈ Ring)
183ringgrpd 14024 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Grp)
1912, 13, 18, 4, 9mulgcld 13736 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ (Base‘(oppr𝑅)))
2019, 8eleqtrrd 2311 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵)
21 mulgass3.t . . . . 5 × = (.r𝑅)
226, 21, 1, 14opprmulg 14090 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵𝑋𝐵) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
2317, 20, 10, 22syl3anc 1273 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
246, 21, 1, 14opprmulg 14090 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑌𝐵𝑋𝐵) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2517, 5, 10, 24syl3anc 1273 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2625oveq2d 6034 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
2716, 23, 263eqtr3d 2272 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
28 mulgass3.m . . . . . 6 · = (.g𝑅)
2928a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g𝑅))
30 eqidd 2232 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (.g‘(oppr𝑅)) = (.g‘(oppr𝑅)))
316a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘𝑅))
32 ssidd 3248 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵𝐵)
33 eqid 2231 . . . . . . . 8 (+g𝑅) = (+g𝑅)
346, 33ringacl 14049 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑥𝐵𝑦𝐵) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
35343expb 1230 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
3635adantlr 477 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
371, 33oppraddg 14095 . . . . . . 7 (𝑅 ∈ Ring → (+g𝑅) = (+g‘(oppr𝑅)))
3837oveqdr 6046 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
3938adantr 276 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
4029, 30, 17, 3, 31, 8, 32, 36, 39mulgpropdg 13756 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g‘(oppr𝑅)))
4140oveqd 6035 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr𝑅))𝑌))
4241oveq2d 6034 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
4340oveqd 6035 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
4427, 42, 433eqtr4d 2274 1 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1004   = wceq 1397  wcel 2202  cfv 5326  (class class class)co 6018  cz 9479  Basecbs 13087  +gcplusg 13165  .rcmulr 13166  .gcmg 13711  Ringcrg 14015  opprcoppr 14086
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-tpos 6411  df-recs 6471  df-frec 6557  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-inn 9144  df-2 9202  df-3 9203  df-n0 9403  df-z 9480  df-uz 9756  df-fz 10244  df-seqfrec 10711  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-plusg 13178  df-mulr 13179  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-grp 13591  df-minusg 13592  df-mulg 13712  df-mgp 13940  df-ur 13979  df-ring 14017  df-oppr 14087
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator