| 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 24824 | . . . 4 ⊢ (𝐺 ∈ NrmGrp → 𝐺 ∈ Grp) | |
| 2 | nmtri2.x | . . . . . 6 ⊢ 𝑋 = (Base‘𝐺) | |
| 3 | eqid 2762 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | nmtri2.m | . . . . . 6 ⊢ − = (-g‘𝐺) | |
| 5 | 2, 3, 4 | grpnpncan 19157 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶)) = (𝐴 − 𝐶)) |
| 6 | 5 | eqcomd 2768 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐶) = ((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) |
| 7 | 1, 6 | sylan 592 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐶) = ((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) |
| 8 | 7 | fveq2d 6886 | . 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 19142 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 − 𝐵) ∈ 𝑋) |
| 14 | 10, 11, 12, 13 | syl3anc 1398 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 − 𝐵) ∈ 𝑋) |
| 15 | simpr3 1215 | . . . 4 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐶 ∈ 𝑋) | |
| 16 | 2, 4 | grpsubcl 19142 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵 − 𝐶) ∈ 𝑋) |
| 17 | 10, 12, 15, 16 | syl3anc 1398 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵 − 𝐶) ∈ 𝑋) |
| 18 | nmtri2.n | . . . 4 ⊢ 𝑁 = (norm‘𝐺) | |
| 19 | 2, 18, 3 | nmtri 24851 | . . 3 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 − 𝐵) ∈ 𝑋 ∧ (𝐵 − 𝐶) ∈ 𝑋) → (𝑁‘((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| 20 | 9, 14, 17, 19 | syl3anc 1398 | . 2 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑁‘((𝐴 − 𝐵)(+g‘𝐺)(𝐵 − 𝐶))) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| 21 | 8, 20 | eqbrtrd 5131 | 1 ⊢ ((𝐺 ∈ NrmGrp ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝑁‘(𝐴 − 𝐶)) ≤ ((𝑁‘(𝐴 − 𝐵)) + (𝑁‘(𝐵 − 𝐶)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 + caddc 11128 ≤ cle 11269 Basecbs 17303 +gcplusg 17344 Grpcgrp 19056 -gcsg 19058 normcnm 24801 NrmGrpcngp 24802 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 ax-pre-sup 11203 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-inf 9416 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-div 11897 df-nn 12259 df-2 12328 df-n0 12530 df-z 12617 df-uz 12889 df-q 12999 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-0g 17528 df-topgen 17530 df-mgm 18732 df-sgrp 18821 df-mnd 18837 df-grp 19059 df-minusg 19060 df-sbg 19061 df-psmet 21576 df-xmet 21577 df-met 21578 df-bl 21579 df-mopn 21580 df-top 23118 df-topon 23135 df-topsp 23157 df-bases 23170 df-xms 24545 df-ms 24546 df-nm 24807 df-ngp 24808 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |