| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulgass3 | Structured version Visualization version GIF version | ||
| Description: An associative property between group multiple and ring multiplication. (Contributed by Mario Carneiro, 14-Jun-2015.) |
| Ref | Expression |
|---|---|
| mulgass3.b | ⊢ 𝐵 = (Base‘𝑅) |
| mulgass3.m | ⊢ · = (.g‘𝑅) |
| mulgass3.t | ⊢ × = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| mulgass3 | ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2729 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 2 | 1 | opprring 20256 | . . . . 5 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
| 3 | 2 | adantr 480 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (oppr‘𝑅) ∈ Ring) |
| 4 | simpr1 1195 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑁 ∈ ℤ) | |
| 5 | simpr3 1197 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 6 | simpr2 1196 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 7 | mulgass3.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 8 | 1, 7 | opprbas 20252 | . . . . 5 ⊢ 𝐵 = (Base‘(oppr‘𝑅)) |
| 9 | eqid 2729 | . . . . 5 ⊢ (.g‘(oppr‘𝑅)) = (.g‘(oppr‘𝑅)) | |
| 10 | eqid 2729 | . . . . 5 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)) | |
| 11 | 8, 9, 10 | mulgass2 20218 | . . . 4 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋))) |
| 12 | 3, 4, 5, 6, 11 | syl13anc 1374 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋))) |
| 13 | mulgass3.t | . . . 4 ⊢ × = (.r‘𝑅) | |
| 14 | 7, 13, 1, 10 | opprmul 20249 | . . 3 ⊢ ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌)) |
| 15 | 7, 13, 1, 10 | opprmul 20249 | . . . 4 ⊢ (𝑌(.r‘(oppr‘𝑅))𝑋) = (𝑋 × 𝑌) |
| 16 | 15 | oveq2i 7398 | . . 3 ⊢ (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌)) |
| 17 | 12, 14, 16 | 3eqtr3g 2787 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌))) |
| 18 | mulgass3.m | . . . . 5 ⊢ · = (.g‘𝑅) | |
| 19 | 7 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 = (Base‘𝑅)) |
| 20 | 8 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 = (Base‘(oppr‘𝑅))) |
| 21 | ssv 3971 | . . . . . 6 ⊢ 𝐵 ⊆ V | |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 ⊆ V) |
| 23 | ovexd 7422 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) ∈ V) | |
| 24 | eqid 2729 | . . . . . . . 8 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 25 | 1, 24 | oppradd 20253 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘(oppr‘𝑅)) |
| 26 | 25 | oveqi 7400 | . . . . . 6 ⊢ (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦) |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦)) |
| 28 | 18, 9, 19, 20, 22, 23, 27 | mulgpropd 19048 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → · = (.g‘(oppr‘𝑅))) |
| 29 | 28 | oveqd 7404 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr‘𝑅))𝑌)) |
| 30 | 29 | oveq2d 7403 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌))) |
| 31 | 28 | oveqd 7404 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌))) |
| 32 | 17, 30, 31 | 3eqtr4d 2774 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 Vcvv 3447 ⊆ wss 3914 ‘cfv 6511 (class class class)co 7387 ℤcz 12529 Basecbs 17179 +gcplusg 17220 .rcmulr 17221 .gcmg 18999 Ringcrg 20142 opprcoppr 20245 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-tpos 8205 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-fz 13469 df-seq 13967 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-mulr 17234 df-0g 17404 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18868 df-minusg 18869 df-mulg 19000 df-cmn 19712 df-abl 19713 df-mgp 20050 df-rng 20062 df-ur 20091 df-ring 20144 df-oppr 20246 |
| This theorem is referenced by: zlmassa 21812 psdvsca 22051 psdmul 22053 elrgspnlem2 33194 |
| Copyright terms: Public domain | W3C validator |