![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > mulgsubdir | GIF version |
Description: Distribution of group multiples over subtraction for group elements, subdir 8407 analog. (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 9351 | . . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
2 | mulgsubdir.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | mulgsubdir.t | . . . 4 ⊢ · = (.g‘𝐺) | |
4 | eqid 2193 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
5 | 2, 3, 4 | mulgdir 13227 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ -𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋))) |
6 | 1, 5 | syl3anr2 1302 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋))) |
7 | simpr1 1005 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑀 ∈ ℤ) | |
8 | 7 | zcnd 9443 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑀 ∈ ℂ) |
9 | simpr2 1006 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑁 ∈ ℤ) | |
10 | 9 | zcnd 9443 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑁 ∈ ℂ) |
11 | 8, 10 | negsubd 8338 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑀 + -𝑁) = (𝑀 − 𝑁)) |
12 | 11 | oveq1d 5934 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 − 𝑁) · 𝑋)) |
13 | eqid 2193 | . . . . . 6 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
14 | 2, 3, 13 | mulgneg 13213 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (-𝑁 · 𝑋) = ((invg‘𝐺)‘(𝑁 · 𝑋))) |
15 | 14 | 3adant3r1 1214 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (-𝑁 · 𝑋) = ((invg‘𝐺)‘(𝑁 · 𝑋))) |
16 | 15 | oveq2d 5935 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
17 | 2, 3 | mulgcl 13212 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑀 · 𝑋) ∈ 𝐵) |
18 | 17 | 3adant3r2 1215 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑀 · 𝑋) ∈ 𝐵) |
19 | 2, 3 | mulgcl 13212 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) ∈ 𝐵) |
20 | 19 | 3adant3r1 1214 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑁 · 𝑋) ∈ 𝐵) |
21 | mulgsubdir.d | . . . . 5 ⊢ − = (-g‘𝐺) | |
22 | 2, 4, 13, 21 | grpsubval 13121 | . . . 4 ⊢ (((𝑀 · 𝑋) ∈ 𝐵 ∧ (𝑁 · 𝑋) ∈ 𝐵) → ((𝑀 · 𝑋) − (𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
23 | 18, 20, 22 | syl2anc 411 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋) − (𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
24 | 16, 23 | eqtr4d 2229 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋)) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
25 | 6, 12, 24 | 3eqtr3d 2234 | 1 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 − 𝑁) · 𝑋) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ‘cfv 5255 (class class class)co 5919 + caddc 7877 − cmin 8192 -cneg 8193 ℤcz 9320 Basecbs 12621 +gcplusg 12698 Grpcgrp 13075 invgcminusg 13076 -gcsg 13077 .gcmg 13192 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-addcom 7974 ax-addass 7976 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-0id 7982 ax-rnegex 7983 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-ltadd 7990 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-frec 6446 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-inn 8985 df-2 9043 df-n0 9244 df-z 9321 df-uz 9596 df-fz 10078 df-seqfrec 10522 df-ndx 12624 df-slot 12625 df-base 12627 df-plusg 12711 df-0g 12872 df-mgm 12942 df-sgrp 12988 df-mnd 13001 df-grp 13078 df-minusg 13079 df-sbg 13080 df-mulg 13193 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |