| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nmtri2 | Structured version Visualization version GIF version | ||
| Description: Triangle inequality for the norm of two subtractions. (Contributed by NM, 24-Feb-2008.) (Revised by AV, 8-Oct-2021.) |
| Ref | Expression |
|---|---|
| nmtri2.x | ⊢ 𝑋 = (Base‘𝐺) |
| nmtri2.n | ⊢ 𝑁 = (norm‘𝐺) |
| nmtri2.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| nmtri2 | ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑁‘(𝐴 − 𝐶)) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ngpgrp 24771 | . . . 4 ⊢ (𝐺 ∈ NrmGrp → 𝐺 ∈ Grp) | |
| 2 | nmtri2.x | . . . . . 6 ⊢ 𝑋 = (Base‘𝐺) | |
| 3 | eqid 2766 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | nmtri2.m | . . . . . 6 ⊢ − = (-g‘𝐺) | |
| 5 | 2, 3, 4 | grpnpncan 19111 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶)) = (𝐴 − 𝐶)) |
| 6 | 5 | eqcomd 2772 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐶) = ((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) |
| 7 | 1, 6 | sylan 592 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐶) = ((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) |
| 8 | 7 | fveq2d 6889 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑁‘(𝐴 − 𝐶)) = (𝑁‘((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶)))) |
| 9 | simpl 488 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ NrmGrp) | |
| 10 | 1 | adantr 486 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐺 ∈ Grp) |
| 11 | simpr1 1213 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ 𝑋) | |
| 12 | simpr2 1214 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 13 | 2, 4 | grpsubcl 19096 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 − 𝐵) ∈ 𝑋) |
| 14 | 10, 11, 12, 13 | syl3anc 1398 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐵) ∈ 𝑋) |
| 15 | simpr3 1215 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋) | |
| 16 | 2, 4 | grpsubcl 19096 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵 − 𝐶) ∈ 𝑋) |
| 17 | 10, 12, 15, 16 | syl3anc 1398 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 − 𝐶) ∈ 𝑋) |
| 18 | nmtri2.n | . . . 4 ⊢ 𝑁 = (norm‘𝐺) | |
| 19 | 2, 18, 3 | nmtri 24798 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 − 𝐵) ∈ 𝑋 ∧ (𝐵 − 𝐶) ∈ 𝑋) → (𝑁‘((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| 20 | 9, 14, 17, 19 | syl3anc 1398 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑁‘((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| 21 | 8, 20 | eqbrtrd 5136 | 1 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑁‘(𝐴 − 𝐶)) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 class class class wbr 5112 ‘cfv 6540 (class class class)co 7416 + caddc 11113 ≤ cle 11254 Basecbs 17279 +gcplusg 17320 Grpcgrp 19010 -gcsg 19012 normcnm 24748 NrmGrpcngp 24749 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5260 ax-nul 5272 ax-pow 5339 ax-pr 5407 ax-un 7738 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4876 df-iun 4961 df-br 5113 df-opab 5177 df-mpt 5196 df-tr 5222 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-sup 9404 df-inf 9405 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11453 df-neg 11454 df-div 11882 df-nn 12244 df-2 12313 df-n0 12515 df-z 12602 df-uz 12873 df-q 12983 df-rp 13027 df-xneg 13147 df-xadd 13148 df-xmul 13149 df-0g 17504 df-topgen 17506 df-mgm 18708 df-sgrp 18787 df-mnd 18803 df-grp 19013 df-minusg 19014 df-sbg 19015 df-psmet 21529 df-xmet 21530 df-met 21531 df-bl 21532 df-mopn 21533 df-top 23066 df-topon 23083 df-topsp 23105 df-bases 23118 df-xms 24492 df-ms 24493 df-nm 24754 df-ngp 24755 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |