| 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 2766 | . . . . . 6 ⊢ (oppr‘𝑅) = (oppr‘𝑅) | |
| 2 | 1 | opprring 20462 | . . . . 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 20458 | . . . . 5 ⊢ 𝐵 = (Base‘(oppr‘𝑅)) |
| 9 | eqid 2766 | . . . . 5 ⊢ (.g‘(oppr‘𝑅)) = (.g‘(oppr‘𝑅)) | |
| 10 | eqid 2766 | . . . . 5 ⊢ (.r‘(oppr‘𝑅)) = (.r‘(oppr‘𝑅)) | |
| 11 | 8, 9, 10 | mulgass2 20425 | . . . 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 20455 | . . 3 ⊢ ((𝑁(.g‘(oppr‘𝑅))𝑌)(.r‘(oppr‘𝑅))𝑋) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌)) |
| 15 | 7, 13, 1, 10 | opprmul 20455 | . . . 4 ⊢ (𝑌(.r‘(oppr‘𝑅))𝑋) = (𝑋 × 𝑌) |
| 16 | 15 | oveq2i 7434 | . . 3 ⊢ (𝑁(.g‘(oppr‘𝑅))(𝑌(.r‘(oppr‘𝑅))𝑋)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌)) |
| 17 | 12, 14, 16 | 3eqtr3g 2824 | . 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 3964 | . . . . . 6 ⊢ 𝐵 ⊆ V | |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐵 ⊆ V) |
| 23 | ovexd 7458 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) ∈ V) | |
| 24 | eqid 2766 | . . . . . . . 8 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 25 | 1, 24 | oppradd 20459 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘(oppr‘𝑅)) |
| 26 | 25 | oveqi 7436 | . . . . . 6 ⊢ (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦) |
| 27 | 26 | a1i 11 | . . . . 5 ⊢ (((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘(oppr‘𝑅))𝑦)) |
| 28 | 18, 9, 19, 20, 22, 23, 27 | mulgpropd 19213 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → · = (.g‘(oppr‘𝑅))) |
| 29 | 28 | oveqd 7440 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · 𝑌) = (𝑁(.g‘(oppr‘𝑅))𝑌)) |
| 30 | 29 | oveq2d 7439 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑋 × (𝑁(.g‘(oppr‘𝑅))𝑌))) |
| 31 | 28 | oveqd 7440 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 · (𝑋 × 𝑌)) = (𝑁(.g‘(oppr‘𝑅))(𝑋 × 𝑌))) |
| 32 | 17, 30, 31 | 3eqtr4d 2811 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 × (𝑁 · 𝑌)) = (𝑁 · (𝑋 × 𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 Vcvv 3458 ⊆ wss 3908 ‘cfv 6543 (class class class)co 7423 ℤcz 12609 Basecbs 17294 +gcplusg 17335 .rcmulr 17336 .gcmg 19164 Ringcrg 20346 opprcoppr 20451 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-tpos 8231 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-fz 13554 df-seq 14058 df-sets 17249 df-slot 17267 df-ndx 17279 df-base 17295 df-plusg 17348 df-mulr 17349 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-grp 19034 df-minusg 19035 df-mulg 19165 df-cmn 19883 df-abl 19884 df-mgp 20248 df-rng 20262 df-ur 20295 df-ring 20348 df-oppr 20452 |
| This theorem is used by: zlmassa 22090 psdvsca 22364 psdmul 22366 elrgspnlem2 33594 |
| Copyright terms: Public domain | W3C validator |