| 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 1195 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑀 ∈ ℤ) | |
| 3 | simpr2 1196 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 4 | ablgrp 19722 | . . . . . 6 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 5 | 4 | adantr 480 | . . . . 5 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 ∈ Grp) |
| 6 | simpr3 1197 | . . . . 5 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 7 | mulgsubdi.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 8 | eqid 2730 | . . . . . 6 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 9 | 7, 8 | grpinvcl 18926 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 10 | 5, 6, 9 | syl2anc 584 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 11 | mulgsubdi.t | . . . . 5 ⊢ · = (.g‘𝐺) | |
| 12 | eqid 2730 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 13 | 7, 11, 12 | mulgdi 19763 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵)) → (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)(𝑀 · ((invg‘𝐺)‘𝑌)))) |
| 14 | 1, 2, 3, 10, 13 | syl13anc 1374 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)(𝑀 · ((invg‘𝐺)‘𝑌)))) |
| 15 | 7, 11, 8 | mulginvcom 19038 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑌 ∈ 𝐵) → (𝑀 · ((invg‘𝐺)‘𝑌)) = ((invg‘𝐺)‘(𝑀 · 𝑌))) |
| 16 | 5, 2, 6, 15 | syl3anc 1373 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · ((invg‘𝐺)‘𝑌)) = ((invg‘𝐺)‘(𝑀 · 𝑌))) |
| 17 | 16 | oveq2d 7406 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(𝑀 · ((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 18 | 14, 17 | eqtrd 2765 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 19 | mulgsubdi.d | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 20 | 7, 12, 8, 19 | grpsubval 18924 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 21 | 3, 6, 20 | syl2anc 584 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 22 | 21 | oveq2d 7406 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋 − 𝑌)) = (𝑀 · (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)))) |
| 23 | 7, 11 | mulgcl 19030 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑀 · 𝑋) ∈ 𝐵) |
| 24 | 5, 2, 3, 23 | syl3anc 1373 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · 𝑋) ∈ 𝐵) |
| 25 | 7, 11 | mulgcl 19030 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑌 ∈ 𝐵) → (𝑀 · 𝑌) ∈ 𝐵) |
| 26 | 5, 2, 6, 25 | syl3anc 1373 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · 𝑌) ∈ 𝐵) |
| 27 | 7, 12, 8, 19 | grpsubval 18924 | . . 3 ⊢ (((𝑀 · 𝑋) ∈ 𝐵 ∧ (𝑀 · 𝑌) ∈ 𝐵) → ((𝑀 · 𝑋) − (𝑀 · 𝑌)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 28 | 24, 26, 27 | syl2anc 584 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑀 · 𝑋) − (𝑀 · 𝑌)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑀 · 𝑌)))) |
| 29 | 18, 22, 28 | 3eqtr4d 2775 | 1 ⊢ ((𝐺 ∈ Abel ∧ (𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑀 · (𝑋 − 𝑌)) = ((𝑀 · 𝑋) − (𝑀 · 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6514 (class class class)co 7390 ℤcz 12536 Basecbs 17186 +gcplusg 17227 Grpcgrp 18872 invgcminusg 18873 -gcsg 18874 .gcmg 19006 Abelcabl 19718 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-fzo 13623 df-seq 13974 df-0g 17411 df-mgm 18574 df-sgrp 18653 df-mnd 18669 df-grp 18875 df-minusg 18876 df-sbg 18877 df-mulg 19007 df-cmn 19719 df-abl 19720 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |