![]() |
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 2798 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
2 | 1 | opprring 19377 | . . . . 5 ⊢ (𝑅 ∈ Ring → (oppr‘𝑅) ∈ Ring) |
3 | 2 | adantr 484 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (oppr‘𝑅) ∈ Ring) |
4 | simpr1 1191 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑁 ∈ ℤ) | |
5 | simpr3 1193 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
6 | simpr2 1192 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
7 | mulgass3.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
8 | 1, 7 | opprbas 19375 | . . . . 5 ⊢ 𝐵 = (Base‘(oppr‘𝑅)) |
9 | eqid 2798 | . . . . 5 ⊢ (.g‘(oppr‘𝑅)) = (.g‘(oppr‘𝑅)) | |
10 | eqid 2798 | . . . . 5 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)) | |
11 | 8, 9, 10 | mulgass2 19347 | . . . 4 ⊢ (((oppr‘𝑅) ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋))) |
12 | 3, 4, 5, 6, 11 | syl13anc 1369 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋))) |
13 | mulgass3.t | . . . 4 ⊢ × = (.r‘𝑅) | |
14 | 7, 13, 1, 10 | opprmul 19372 | . . 3 ⊢ ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌)) |
15 | 7, 13, 1, 10 | opprmul 19372 | . . . 4 ⊢ (𝑌(.r‘(oppr‘𝑅))𝑋) = (𝑋 × 𝑌) |
16 | 15 | oveq2i 7146 | . . 3 ⊢ (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌)) |
17 | 12, 14, 16 | 3eqtr3g 2856 | . 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 3939 | . . . . . 6 ⊢ 𝐵 ⊆ V | |
22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 ⊆ V) |
23 | ovexd 7170 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) ∈ V) | |
24 | eqid 2798 | . . . . . . . 8 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
25 | 1, 24 | oppradd 19376 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘(oppr‘𝑅)) |
26 | 25 | oveqi 7148 | . . . . . 6 ⊢ (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦) |
27 | 26 | a1i 11 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦)) |
28 | 18, 9, 19, 20, 22, 23, 27 | mulgpropd 18261 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → · = (.g‘(oppr‘𝑅))) |
29 | 28 | oveqd 7152 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr‘𝑅))𝑌)) |
30 | 29 | oveq2d 7151 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌))) |
31 | 28 | oveqd 7152 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌))) |
32 | 17, 30, 31 | 3eqtr4d 2843 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ⊆ wss 3881 ‘cfv 6324 (class class class)co 7135 ℤcz 11969 Basecbs 16475 +gcplusg 16557 .rcmulr 16558 .gcmg 18216 Ringcrg 19290 opprcoppr 19368 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-tpos 7875 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-seq 13365 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-plusg 16570 df-mulr 16571 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-mulg 18217 df-mgp 19233 df-ur 19245 df-ring 19292 df-oppr 19369 |
This theorem is referenced by: zlmassa 20588 |
Copyright terms: Public domain | W3C validator |