| 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 1213 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋) | |
| 2 | simpr3 1215 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋) | |
| 3 | ngpsubcan.x | . . . . 5 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | eqid 2761 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | eqid 2761 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | ngpsubcan.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 7 | 3, 4, 5, 6 | grpsubval 19176 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴 − 𝐶) = (𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 8 | 1, 2, 7 | syl2anc 596 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐶) = (𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 9 | simpr2 1214 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 10 | 3, 4, 5, 6 | grpsubval 19176 | . . . 4 ⊢ ((𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵 − 𝐶) = (𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 11 | 9, 2, 10 | syl2anc 596 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 − 𝐶) = (𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) |
| 12 | 8, 11 | oveq12d 7430 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐶)𝐷(𝐵 − 𝐶)) = ((𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))𝐷(𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶)))) |
| 13 | simpl 488 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ NrmGrp) | |
| 14 | ngpgrp 24898 | . . . 4 ⊢ (𝐺 ∈ NrmGrp → 𝐺 ∈ Grp) | |
| 15 | 3, 5 | grpinvcl 19178 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘𝐶) ∈ 𝑋) |
| 16 | 14, 2, 15 | syl2an2r 698 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((invg‘𝐺)‘𝐶) ∈ 𝑋) |
| 17 | ngpsubcan.d | . . . 4 ⊢ 𝐷 = (dist‘𝐺) | |
| 18 | 3, 4, 17 | ngprcan 24909 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ ((invg‘𝐺)‘𝐶) ∈ 𝑋)) → ((𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))𝐷(𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) = (𝐴𝐷𝐵)) |
| 19 | 13, 1, 9, 16, 18 | syl13anc 1399 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴(+g‘𝐺)((invg‘𝐺)‘𝐶))𝐷(𝐵(+g‘𝐺)((invg‘𝐺)‘𝐶))) = (𝐴𝐷𝐵)) |
| 20 | 12, 19 | eqtrd 2796 | 1 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐶)𝐷(𝐵 − 𝐶)) = (𝐴𝐷𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 +gcplusg 17408 distcds 17417 Grpcgrp 19124 invgcminusg 19125 -gcsg 19126 NrmGrpcngp 24876 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-map 8833 df-en 8958 df-dom 8959 df-sdom 8960 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-n0 12588 df-z 12675 df-uz 12947 df-q 13057 df-rp 13102 df-xneg 13222 df-xadd 13223 df-xmul 13224 df-0g 17592 df-topgen 17594 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 df-sbg 19129 df-psmet 21650 df-xmet 21651 df-met 21652 df-bl 21653 df-mopn 21654 df-top 23192 df-topon 23209 df-topsp 23231 df-bases 23244 df-xms 24619 df-ms 24620 df-nm 24881 df-ngp 24882 |
| This theorem is used by: ngptgp 24935 |
| Copyright terms: Public domain | W3C validator |