| 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 2761 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 2 | 1 | opprring 20557 | . . . . 5 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (oppr‘𝑅) ∈ Ring) |
| 4 | simpr1 1213 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑁 ∈ ℤ) | |
| 5 | simpr3 1215 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 6 | simpr2 1214 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 7 | mulgass3.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 8 | 1, 7 | opprbas 20553 | . . . . 5 ⊢ 𝐵 = (Base‘(oppr‘𝑅)) |
| 9 | eqid 2761 | . . . . 5 ⊢ (.g‘(oppr‘𝑅)) = (.g‘(oppr‘𝑅)) | |
| 10 | eqid 2761 | . . . . 5 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)) | |
| 11 | 8, 9, 10 | mulgass2 20520 | . . . 4 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋))) |
| 12 | 3, 4, 5, 6, 11 | syl13anc 1399 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋))) |
| 13 | mulgass3.t | . . . 4 ⊢ × = (.r‘𝑅) | |
| 14 | 7, 13, 1, 10 | opprmul 20550 | . . 3 ⊢ ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌)) |
| 15 | 7, 13, 1, 10 | opprmul 20550 | . . . 4 ⊢ (𝑌(.r‘(oppr‘𝑅))𝑋) = (𝑋 × 𝑌) |
| 16 | 15 | oveq2i 7423 | . . 3 ⊢ (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌)) |
| 17 | 12, 14, 16 | 3eqtr3g 2819 | . 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 3955 | . . . . . 6 ⊢ 𝐵 ⊆ V | |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 ⊆ V) |
| 23 | ovexd 7447 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) ∈ V) | |
| 24 | eqid 2761 | . . . . . . . 8 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 25 | 1, 24 | oppradd 20554 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘(oppr‘𝑅)) |
| 26 | 25 | oveqi 7425 | . . . . . 6 ⊢ (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦) |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦)) |
| 28 | 18, 9, 19, 20, 22, 23, 27 | mulgpropd 19306 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → · = (.g‘(oppr‘𝑅))) |
| 29 | 28 | oveqd 7429 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr‘𝑅))𝑌)) |
| 30 | 29 | oveq2d 7428 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌))) |
| 31 | 28 | oveqd 7429 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌))) |
| 32 | 17, 30, 31 | 3eqtr4d 2806 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ⊆ wss 3899 ‘cfv 6531 (class class class)co 7412 ℤcz 12674 Basecbs 17367 +gcplusg 17408 .rcmulr 17409 .gcmg 19257 Ringcrg 20439 opprcoppr 20546 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-tpos 8227 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-fz 13621 df-seq 14125 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-plusg 17421 df-mulr 17422 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 df-mulg 19258 df-cmn 19976 df-abl 19977 df-mgp 20341 df-rng 20355 df-ur 20388 df-ring 20441 df-oppr 20547 |
| This theorem is used by: zlmassa 22191 psdvsca 22465 psdmul 22467 elrgspnlem2 33786 |
| Copyright terms: Public domain | W3C validator |