| 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 8548 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 9493 | . . 3 ⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | |
| 2 | mulgsubdir.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | mulgsubdir.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 4 | eqid 2229 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | 2, 3, 4 | mulgdir 13712 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ -𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋))) |
| 6 | 1, 5 | syl3anr2 1324 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋))) |
| 7 | simpr1 1027 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑀 ∈ ℤ) | |
| 8 | 7 | zcnd 9586 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑀 ∈ ℂ) |
| 9 | simpr2 1028 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑁 ∈ ℤ) | |
| 10 | 9 | zcnd 9586 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → 𝑁 ∈ ℂ) |
| 11 | 8, 10 | negsubd 8479 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑀 + -𝑁) = (𝑀 − 𝑁)) |
| 12 | 11 | oveq1d 6025 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 + -𝑁) · 𝑋) = ((𝑀 − 𝑁) · 𝑋)) |
| 13 | eqid 2229 | . . . . . 6 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 14 | 2, 3, 13 | mulgneg 13698 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (-𝑁 · 𝑋) = ((invg‘𝐺)‘(𝑁 · 𝑋))) |
| 15 | 14 | 3adant3r1 1236 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (-𝑁 · 𝑋) = ((invg‘𝐺)‘(𝑁 · 𝑋))) |
| 16 | 15 | oveq2d 6026 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
| 17 | 2, 3 | mulgcl 13697 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑀 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑀 · 𝑋) ∈ 𝐵) |
| 18 | 17 | 3adant3r2 1237 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑀 · 𝑋) ∈ 𝐵) |
| 19 | 2, 3 | mulgcl 13697 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑁 · 𝑋) ∈ 𝐵) |
| 20 | 19 | 3adant3r1 1236 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → (𝑁 · 𝑋) ∈ 𝐵) |
| 21 | mulgsubdir.d | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 22 | 2, 4, 13, 21 | grpsubval 13600 | . . . 4 ⊢ (((𝑀 · 𝑋) ∈ 𝐵 ∧ (𝑁 · 𝑋) ∈ 𝐵) → ((𝑀 · 𝑋) − (𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
| 23 | 18, 20, 22 | syl2anc 411 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋) − (𝑁 · 𝑋)) = ((𝑀 · 𝑋)(+g‘𝐺)((invg‘𝐺)‘(𝑁 · 𝑋)))) |
| 24 | 16, 23 | eqtr4d 2265 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 · 𝑋)(+g‘𝐺)(-𝑁 · 𝑋)) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
| 25 | 6, 12, 24 | 3eqtr3d 2270 | 1 ⊢ ((𝐺 ∈ Grp ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵)) → ((𝑀 − 𝑁) · 𝑋) = ((𝑀 · 𝑋) − (𝑁 · 𝑋))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5321 (class class class)co 6010 + caddc 8018 − cmin 8333 -cneg 8334 ℤcz 9462 Basecbs 13053 +gcplusg 13131 Grpcgrp 13554 invgcminusg 13555 -gcsg 13556 .gcmg 13677 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-iinf 4681 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-addcom 8115 ax-addass 8117 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-0id 8123 ax-rnegex 8124 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-ltadd 8131 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4385 df-iord 4458 df-on 4460 df-ilim 4461 df-suc 4463 df-iom 4684 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-recs 6462 df-frec 6548 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-inn 9127 df-2 9185 df-n0 9386 df-z 9463 df-uz 9739 df-fz 10222 df-seqfrec 10687 df-ndx 13056 df-slot 13057 df-base 13059 df-plusg 13144 df-0g 13312 df-mgm 13410 df-sgrp 13456 df-mnd 13471 df-grp 13557 df-minusg 13558 df-sbg 13559 df-mulg 13678 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |