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

Theorem mulgass3 14069
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 2229 . . . . . 6 (oppr𝑅) = (oppr𝑅)
21opprring 14063 . . . . 5 (𝑅 ∈ Ring → (oppr𝑅) ∈ Ring)
32adantr 276 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Ring)
4 simpr1 1027 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑁 ∈ ℤ)
5 simpr3 1029 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌𝐵)
6 mulgass3.b . . . . . . 7 𝐵 = (Base‘𝑅)
71, 6opprbasg 14059 . . . . . 6 (𝑅 ∈ Ring → 𝐵 = (Base‘(oppr𝑅)))
87adantr 276 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘(oppr𝑅)))
95, 8eleqtrd 2308 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌 ∈ (Base‘(oppr𝑅)))
10 simpr2 1028 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋𝐵)
1110, 8eleqtrd 2308 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋 ∈ (Base‘(oppr𝑅)))
12 eqid 2229 . . . . 5 (Base‘(oppr𝑅)) = (Base‘(oppr𝑅))
13 eqid 2229 . . . . 5 (.g‘(oppr𝑅)) = (.g‘(oppr𝑅))
14 eqid 2229 . . . . 5 (.r‘(oppr𝑅)) = (.r‘(oppr𝑅))
1512, 13, 14mulgass2 14042 . . . 4 (((oppr𝑅) ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑌 ∈ (Base‘(oppr𝑅)) ∧ 𝑋 ∈ (Base‘(oppr𝑅)))) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)))
163, 4, 9, 11, 15syl13anc 1273 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)))
17 simpl 109 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑅 ∈ Ring)
183ringgrpd 13989 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Grp)
1912, 13, 18, 4, 9mulgcld 13702 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ (Base‘(oppr𝑅)))
2019, 8eleqtrrd 2309 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵)
21 mulgass3.t . . . . 5 × = (.r𝑅)
226, 21, 1, 14opprmulg 14055 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵𝑋𝐵) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
2317, 20, 10, 22syl3anc 1271 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → ((𝑁(.g‘(oppr𝑅))𝑌)(.r‘(oppr𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
246, 21, 1, 14opprmulg 14055 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑌𝐵𝑋𝐵) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2517, 5, 10, 24syl3anc 1271 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2625oveq2d 6026 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
2716, 23, 263eqtr3d 2270 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
28 mulgass3.m . . . . . 6 · = (.g𝑅)
2928a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g𝑅))
30 eqidd 2230 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (.g‘(oppr𝑅)) = (.g‘(oppr𝑅)))
316a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘𝑅))
32 ssidd 3245 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵𝐵)
33 eqid 2229 . . . . . . . 8 (+g𝑅) = (+g𝑅)
346, 33ringacl 14014 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑥𝐵𝑦𝐵) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
35343expb 1228 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
3635adantlr 477 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
371, 33oppraddg 14060 . . . . . . 7 (𝑅 ∈ Ring → (+g𝑅) = (+g‘(oppr𝑅)))
3837oveqdr 6038 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
3938adantr 276 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
4029, 30, 17, 3, 31, 8, 32, 36, 39mulgpropdg 13722 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g‘(oppr𝑅)))
4140oveqd 6027 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr𝑅))𝑌))
4241oveq2d 6026 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
4340oveqd 6027 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
4427, 42, 433eqtr4d 2272 1 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1002   = wceq 1395  wcel 2200  cfv 5321  (class class class)co 6010  cz 9462  Basecbs 13053  +gcplusg 13131  .rcmulr 13132  .gcmg 13677  Ringcrg 13980  opprcoppr 14051
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-addass 8117  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-0id 8123  ax-rnegex 8124  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-ltadd 8131
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-iord 4458  df-on 4460  df-ilim 4461  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-tpos 6402  df-recs 6462  df-frec 6548  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-inn 9127  df-2 9185  df-3 9186  df-n0 9386  df-z 9463  df-uz 9739  df-fz 10222  df-seqfrec 10687  df-ndx 13056  df-slot 13057  df-base 13059  df-sets 13060  df-plusg 13144  df-mulr 13145  df-0g 13312  df-mgm 13410  df-sgrp 13456  df-mnd 13471  df-grp 13557  df-minusg 13558  df-mulg 13678  df-mgp 13905  df-ur 13944  df-ring 13982  df-oppr 14052
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator