Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rngsubdir | Structured version Visualization version GIF version |
Description: Ring multiplication distributes over subtraction. (subdir 11063 analog.) (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 2-Jul-2014.) |
Ref | Expression |
---|---|
ringsubdi.b | ⊢ 𝐵 = (Base‘𝑅) |
ringsubdi.t | ⊢ · = (.r‘𝑅) |
ringsubdi.m | ⊢ − = (-g‘𝑅) |
ringsubdi.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
ringsubdi.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
ringsubdi.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
ringsubdi.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
Ref | Expression |
---|---|
rngsubdir | ⊢ (𝜑 → ((𝑋 − 𝑌) · 𝑍) = ((𝑋 · 𝑍) − (𝑌 · 𝑍))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ringsubdi.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
2 | ringsubdi.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
3 | ringgrp 19233 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
4 | 1, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Grp) |
5 | ringsubdi.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
6 | ringsubdi.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
7 | eqid 2821 | . . . . . 6 ⊢ (invg‘𝑅) = (invg‘𝑅) | |
8 | 6, 7 | grpinvcl 18091 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝑅)‘𝑌) ∈ 𝐵) |
9 | 4, 5, 8 | syl2anc 584 | . . . 4 ⊢ (𝜑 → ((invg‘𝑅)‘𝑌) ∈ 𝐵) |
10 | ringsubdi.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
11 | eqid 2821 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
12 | ringsubdi.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
13 | 6, 11, 12 | ringdir 19248 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ ((invg‘𝑅)‘𝑌) ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌)) · 𝑍) = ((𝑋 · 𝑍)(+g‘𝑅)(((invg‘𝑅)‘𝑌) · 𝑍))) |
14 | 1, 2, 9, 10, 13 | syl13anc 1364 | . . 3 ⊢ (𝜑 → ((𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌)) · 𝑍) = ((𝑋 · 𝑍)(+g‘𝑅)(((invg‘𝑅)‘𝑌) · 𝑍))) |
15 | 6, 12, 7, 1, 5, 10 | ringmneg1 19277 | . . . 4 ⊢ (𝜑 → (((invg‘𝑅)‘𝑌) · 𝑍) = ((invg‘𝑅)‘(𝑌 · 𝑍))) |
16 | 15 | oveq2d 7161 | . . 3 ⊢ (𝜑 → ((𝑋 · 𝑍)(+g‘𝑅)(((invg‘𝑅)‘𝑌) · 𝑍)) = ((𝑋 · 𝑍)(+g‘𝑅)((invg‘𝑅)‘(𝑌 · 𝑍)))) |
17 | 14, 16 | eqtrd 2856 | . 2 ⊢ (𝜑 → ((𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌)) · 𝑍) = ((𝑋 · 𝑍)(+g‘𝑅)((invg‘𝑅)‘(𝑌 · 𝑍)))) |
18 | ringsubdi.m | . . . . 5 ⊢ − = (-g‘𝑅) | |
19 | 6, 11, 7, 18 | grpsubval 18089 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) |
20 | 2, 5, 19 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑌) = (𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) |
21 | 20 | oveq1d 7160 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑌) · 𝑍) = ((𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌)) · 𝑍)) |
22 | 6, 12 | ringcl 19242 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 · 𝑍) ∈ 𝐵) |
23 | 1, 2, 10, 22 | syl3anc 1363 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑍) ∈ 𝐵) |
24 | 6, 12 | ringcl 19242 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 · 𝑍) ∈ 𝐵) |
25 | 1, 5, 10, 24 | syl3anc 1363 | . . 3 ⊢ (𝜑 → (𝑌 · 𝑍) ∈ 𝐵) |
26 | 6, 11, 7, 18 | grpsubval 18089 | . . 3 ⊢ (((𝑋 · 𝑍) ∈ 𝐵 ∧ (𝑌 · 𝑍) ∈ 𝐵) → ((𝑋 · 𝑍) − (𝑌 · 𝑍)) = ((𝑋 · 𝑍)(+g‘𝑅)((invg‘𝑅)‘(𝑌 · 𝑍)))) |
27 | 23, 25, 26 | syl2anc 584 | . 2 ⊢ (𝜑 → ((𝑋 · 𝑍) − (𝑌 · 𝑍)) = ((𝑋 · 𝑍)(+g‘𝑅)((invg‘𝑅)‘(𝑌 · 𝑍)))) |
28 | 17, 21, 27 | 3eqtr4d 2866 | 1 ⊢ (𝜑 → ((𝑋 − 𝑌) · 𝑍) = ((𝑋 · 𝑍) − (𝑌 · 𝑍))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 ∈ wcel 2105 ‘cfv 6349 (class class class)co 7145 Basecbs 16473 +gcplusg 16555 .rcmulr 16556 Grpcgrp 18043 invgcminusg 18044 -gcsg 18045 Ringcrg 19228 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7450 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 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4833 df-iun 4914 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7569 df-1st 7680 df-2nd 7681 df-wrecs 7938 df-recs 7999 df-rdg 8037 df-er 8279 df-en 8499 df-dom 8500 df-sdom 8501 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11628 df-2 11689 df-ndx 16476 df-slot 16477 df-base 16479 df-sets 16480 df-plusg 16568 df-0g 16705 df-mgm 17842 df-sgrp 17891 df-mnd 17902 df-grp 18046 df-minusg 18047 df-sbg 18048 df-mgp 19171 df-ur 19183 df-ring 19230 |
This theorem is referenced by: 2idlcpbl 19937 cpmadugsumfi 21415 nrgdsdir 23204 nrginvrcnlem 23229 orngrmulle 30807 lidldomn1 44090 |
Copyright terms: Public domain | W3C validator |