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

Theorem mulgass3 13717
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 2196 . . . . . 6 (oppr𝑅) = (oppr𝑅)
21opprring 13711 . . . . 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 13707 . . . . . 6 (𝑅 ∈ Ring → 𝐵 = (Base‘(oppr𝑅)))
87adantr 276 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘(oppr𝑅)))
95, 8eleqtrd 2275 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑌 ∈ (Base‘(oppr𝑅)))
10 simpr2 1006 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋𝐵)
1110, 8eleqtrd 2275 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝑋 ∈ (Base‘(oppr𝑅)))
12 eqid 2196 . . . . 5 (Base‘(oppr𝑅)) = (Base‘(oppr𝑅))
13 eqid 2196 . . . . 5 (.g‘(oppr𝑅)) = (.g‘(oppr𝑅))
14 eqid 2196 . . . . 5 (.r‘(oppr𝑅)) = (.r‘(oppr𝑅))
1512, 13, 14mulgass2 13690 . . . 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 13637 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (oppr𝑅) ∈ Grp)
1912, 13, 18, 4, 9mulgcld 13350 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ (Base‘(oppr𝑅)))
2019, 8eleqtrrd 2276 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))𝑌) ∈ 𝐵)
21 mulgass3.t . . . . 5 × = (.r𝑅)
226, 21, 1, 14opprmulg 13703 . . . 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 13703 . . . . 5 ((𝑅 ∈ Ring ∧ 𝑌𝐵𝑋𝐵) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2517, 5, 10, 24syl3anc 1249 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑌(.r‘(oppr𝑅))𝑋) = (𝑋 × 𝑌))
2625oveq2d 5941 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁(.g‘(oppr𝑅))(𝑌(.r‘(oppr𝑅))𝑋)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
2716, 23, 263eqtr3d 2237 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
28 mulgass3.m . . . . . 6 · = (.g𝑅)
2928a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g𝑅))
30 eqidd 2197 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (.g‘(oppr𝑅)) = (.g‘(oppr𝑅)))
316a1i 9 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵 = (Base‘𝑅))
32 ssidd 3205 . . . . 5 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → 𝐵𝐵)
33 eqid 2196 . . . . . . . 8 (+g𝑅) = (+g𝑅)
346, 33ringacl 13662 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑥𝐵𝑦𝐵) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
35343expb 1206 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
3635adantlr 477 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) ∈ 𝐵)
371, 33oppraddg 13708 . . . . . . 7 (𝑅 ∈ Ring → (+g𝑅) = (+g‘(oppr𝑅)))
3837oveqdr 5953 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
3938adantr 276 . . . . 5 (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝑅)𝑦) = (𝑥(+g‘(oppr𝑅))𝑦))
4029, 30, 17, 3, 31, 8, 32, 36, 39mulgpropdg 13370 . . . 4 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → · = (.g‘(oppr𝑅)))
4140oveqd 5942 . . 3 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr𝑅))𝑌))
4241oveq2d 5941 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr𝑅))𝑌)))
4340oveqd 5942 . 2 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr𝑅))(𝑋 × 𝑌)))
4427, 42, 433eqtr4d 2239 1 ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋𝐵𝑌𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2167  cfv 5259  (class class class)co 5925  cz 9343  Basecbs 12703  +gcplusg 12780  .rcmulr 12781  .gcmg 13325  Ringcrg 13628  opprcoppr 13699
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-ltadd 8012
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 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-tpos 6312  df-recs 6372  df-frec 6458  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-2 9066  df-3 9067  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-seqfrec 10557  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-mulg 13326  df-mgp 13553  df-ur 13592  df-ring 13630  df-oppr 13700
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator