| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mulgsubdi | Structured version Visualization version GIF version | ||
| Description: Group multiple of a difference. (Contributed by Mario Carneiro, 13-Dec-2014.) |
| Ref | Expression |
|---|---|
| mulgsubdi.b | ⊢ 𝐵 = (Base‘𝐺) |
| mulgsubdi.t | ⊢ · = (.g‘𝐺) |
| mulgsubdi.d | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| mulgsubdi | ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋 − 𝑌)) = ((𝑀 · 𝑋) − (𝑀 · 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 ∈ Abel) | |
| 2 | simpr1 1196 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑀 ∈ ℤ) | |
| 3 | simpr2 1197 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 4 | ablgrp 19760 | . . . . . 6 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 5 | 4 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 ∈ Grp) |
| 6 | simpr3 1198 | . . . . 5 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 7 | mulgsubdi.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 8 | eqid 2736 | . . . . . 6 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 9 | 7, 8 | grpinvcl 18963 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 10 | 5, 6, 9 | syl2anc 585 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 11 | mulgsubdi.t | . . . . 5 ⊢ · = (.g‘𝐺) | |
| 12 | eqid 2736 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 13 | 7, 11, 12 | mulgdi 19801 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵)) → (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)(𝑀 · ((invg‘𝐺)‘𝑌)))) |
| 14 | 1, 2, 3, 10, 13 | syl13anc 1375 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)(𝑀 · ((invg‘𝐺)‘𝑌)))) |
| 15 | 7, 11, 8 | mulginvcom 19075 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑌 ∈ 𝐵) → (𝑀 · ((invg‘𝐺)‘𝑌)) = ((invg‘𝐺)‘(𝑀 · 𝑌))) |
| 16 | 5, 2, 6, 15 | syl3anc 1374 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · ((invg‘𝐺)‘𝑌)) = ((invg‘𝐺)‘(𝑀 · 𝑌))) |
| 17 | 16 | oveq2d 7383 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(𝑀 · ((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 18 | 14, 17 | eqtrd 2771 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 19 | mulgsubdi.d | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 20 | 7, 12, 8, 19 | grpsubval 18961 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 21 | 3, 6, 20 | syl2anc 585 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 22 | 21 | oveq2d 7383 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋 − 𝑌)) = (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)))) |
| 23 | 7, 11 | mulgcl 19067 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑀 · 𝑋) ∈ 𝐵) |
| 24 | 5, 2, 3, 23 | syl3anc 1374 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · 𝑋) ∈ 𝐵) |
| 25 | 7, 11 | mulgcl 19067 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑌 ∈ 𝐵) → (𝑀 · 𝑌) ∈ 𝐵) |
| 26 | 5, 2, 6, 25 | syl3anc 1374 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · 𝑌) ∈ 𝐵) |
| 27 | 7, 12, 8, 19 | grpsubval 18961 | . . 3 ⊢ (((𝑀 · 𝑋) ∈ 𝐵 ∧ (𝑀 · 𝑌) ∈ 𝐵) → ((𝑀 · 𝑋) − (𝑀 · 𝑌)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 28 | 24, 26, 27 | syl2anc 585 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑀 · 𝑋) − (𝑀 · 𝑌)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 29 | 18, 22, 28 | 3eqtr4d 2781 | 1 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋 − 𝑌)) = ((𝑀 · 𝑋) − (𝑀 · 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6498 (class class class)co 7367 ℤcz 12524 Basecbs 17179 +gcplusg 17220 Grpcgrp 18909 invgcminusg 18910 -gcsg 18911 .gcmg 19043 Abelcabl 19756 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 df-fzo 13609 df-seq 13964 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-sbg 18914 df-mulg 19044 df-cmn 19757 df-abl 19758 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |