Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulgsubdir | Structured version Visualization version GIF version |
Description: Subtraction of a group element from itself. (Contributed by Mario Carneiro, 13-Dec-2014.) |
Ref | Expression |
---|---|
mulgsubdir.b | ⊢ 𝐵 = (Base‘𝐺) |
mulgsubdir.t | ⊢ · = (.g‘𝐺) |
mulgsubdir.d | ⊢ − = (-g‘𝐺) |
Ref | Expression |
---|---|
mulgsubdir | ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 − 𝑁) · 𝑋) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | znegcl 12005 | . . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
2 | mulgsubdir.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | mulgsubdir.t | . . . 4 ⊢ · = (.g‘𝐺) | |
4 | eqid 2818 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
5 | 2, 3, 4 | mulgdir 18197 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ -𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋))) |
6 | 1, 5 | syl3anr2 1409 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋))) |
7 | simpr1 1186 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑀 ∈ ℤ) | |
8 | 7 | zcnd 12076 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑀 ∈ ℂ) |
9 | simpr2 1187 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑁 ∈ ℤ) | |
10 | 9 | zcnd 12076 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑁 ∈ ℂ) |
11 | 8, 10 | negsubd 10991 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑀 + -𝑁) = (𝑀 − 𝑁)) |
12 | 11 | oveq1d 7160 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 − 𝑁) · 𝑋)) |
13 | eqid 2818 | . . . . . 6 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
14 | 2, 3, 13 | mulgneg 18184 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (-𝑁 · 𝑋) = ((invg‘𝐺)‘(𝑁 · 𝑋))) |
15 | 14 | 3adant3r1 1174 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (-𝑁 · 𝑋) = ((invg‘𝐺)‘(𝑁 · 𝑋))) |
16 | 15 | oveq2d 7161 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
17 | 2, 3 | mulgcl 18183 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑀 · 𝑋) ∈ 𝐵) |
18 | 17 | 3adant3r2 1175 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑀 · 𝑋) ∈ 𝐵) |
19 | 2, 3 | mulgcl 18183 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) ∈ 𝐵) |
20 | 19 | 3adant3r1 1174 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑁 · 𝑋) ∈ 𝐵) |
21 | mulgsubdir.d | . . . . 5 ⊢ − = (-g‘𝐺) | |
22 | 2, 4, 13, 21 | grpsubval 18087 | . . . 4 ⊢ (((𝑀 · 𝑋) ∈ 𝐵 ∧ (𝑁 · 𝑋) ∈ 𝐵) → ((𝑀 · 𝑋) − (𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
23 | 18, 20, 22 | syl2anc 584 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋) − (𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
24 | 16, 23 | eqtr4d 2856 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋)) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
25 | 6, 12, 24 | 3eqtr3d 2861 | 1 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 − 𝑁) · 𝑋) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ‘cfv 6348 (class class class)co 7145 + caddc 10528 − cmin 10858 -cneg 10859 ℤcz 11969 Basecbs 16471 +gcplusg 16553 Grpcgrp 18041 invgcminusg 18042 -gcsg 18043 .gcmg 18162 |
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 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
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 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-seq 13358 df-0g 16703 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-grp 18044 df-minusg 18045 df-sbg 18046 df-mulg 18163 |
This theorem is referenced by: odmod 18603 odcong 18606 gexdvds 18638 archiabllem1a 30747 |
Copyright terms: Public domain | W3C validator |