| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ngpsubcan | Structured version Visualization version GIF version | ||
| Description: Cancel right subtraction inside a distance calculation. (Contributed by Mario Carneiro, 4-Oct-2015.) |
| Ref | Expression |
|---|---|
| ngpsubcan.x | ⊢ 𝑋 = (Base‘𝐺) |
| ngpsubcan.m | ⊢ − = (-g‘𝐺) |
| ngpsubcan.d | ⊢ 𝐷 = (dist‘𝐺) |
| Ref | Expression |
|---|---|
| ngpsubcan | ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐶)𝐷(𝐵 − 𝐶)) = (𝐴𝐷𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr1 1195 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋) | |
| 2 | simpr3 1197 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋) | |
| 3 | ngpsubcan.x | . . . . 5 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | eqid 2736 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | eqid 2736 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | ngpsubcan.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 7 | 3, 4, 5, 6 | grpsubval 18915 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴 − 𝐶) = (𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 8 | 1, 2, 7 | syl2anc 584 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐶) = (𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 9 | simpr2 1196 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 10 | 3, 4, 5, 6 | grpsubval 18915 | . . . 4 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵 − 𝐶) = (𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 11 | 9, 2, 10 | syl2anc 584 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 − 𝐶) = (𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 12 | 8, 11 | oveq12d 7376 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐶)𝐷(𝐵 − 𝐶)) = ((𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))𝐷(𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶)))) |
| 13 | simpl 482 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ NrmGrp) | |
| 14 | ngpgrp 24543 | . . . 4 ⊢ (𝐺 ∈ NrmGrp → 𝐺 ∈ Grp) | |
| 15 | 3, 5 | grpinvcl 18917 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘𝐶) ∈ 𝑋) |
| 16 | 14, 2, 15 | syl2an2r 685 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((invg‘𝐺)‘𝐶) ∈ 𝑋) |
| 17 | ngpsubcan.d | . . . 4 ⊢ 𝐷 = (dist‘𝐺) | |
| 18 | 3, 4, 17 | ngprcan 24554 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((invg‘𝐺)‘𝐶) ∈ 𝑋)) → ((𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))𝐷(𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) = (𝐴𝐷𝐵)) |
| 19 | 13, 1, 9, 16, 18 | syl13anc 1374 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))𝐷(𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) = (𝐴𝐷𝐵)) |
| 20 | 12, 19 | eqtrd 2771 | 1 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐶)𝐷(𝐵 − 𝐶)) = (𝐴𝐷𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 distcds 17186 Grpcgrp 18863 invgcminusg 18864 -gcsg 18865 NrmGrpcngp 24521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-n0 12402 df-z 12489 df-uz 12752 df-q 12862 df-rp 12906 df-xneg 13026 df-xadd 13027 df-xmul 13028 df-0g 17361 df-topgen 17363 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 df-psmet 21301 df-xmet 21302 df-met 21303 df-bl 21304 df-mopn 21305 df-top 22838 df-topon 22855 df-topsp 22877 df-bases 22890 df-xms 24264 df-ms 24265 df-nm 24526 df-ngp 24527 |
| This theorem is referenced by: ngptgp 24580 |
| Copyright terms: Public domain | W3C validator |