| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abvsubtri | Structured version Visualization version GIF version | ||
| Description: An absolute value satisfies the triangle inequality. (Contributed by Mario Carneiro, 4-Oct-2015.) |
| Ref | Expression |
|---|---|
| abv0.a | ⊢ 𝐴 = (AbsVal‘𝑅) |
| abvneg.b | ⊢ 𝐵 = (Base‘𝑅) |
| abvsubtri.p | ⊢ − = (-g‘𝑅) |
| Ref | Expression |
|---|---|
| abvsubtri | ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 − 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abvneg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | eqid 2729 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 3 | eqid 2729 | . . . . 5 ⊢ (invg‘𝑅) = (invg‘𝑅) | |
| 4 | abvsubtri.p | . . . . 5 ⊢ − = (-g‘𝑅) | |
| 5 | 1, 2, 3, 4 | grpsubval 18917 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) |
| 6 | 5 | 3adant1 1130 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) |
| 7 | 6 | fveq2d 6862 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 − 𝑌)) = (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌)))) |
| 8 | abv0.a | . . . . . . . 8 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 9 | 8 | abvrcl 20722 | . . . . . . 7 ⊢ (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring) |
| 10 | 9 | 3ad2ant1 1133 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑅 ∈ Ring) |
| 11 | ringgrp 20147 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 12 | 10, 11 | syl 17 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 13 | simp3 1138 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 14 | 1, 3 | grpinvcl 18919 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝑅)‘𝑌) ∈ 𝐵) |
| 15 | 12, 13, 14 | syl2anc 584 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝑅)‘𝑌) ∈ 𝐵) |
| 16 | 8, 1, 2 | abvtri 20731 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝑅)‘𝑌) ∈ 𝐵) → (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) ≤ ((𝐹‘𝑋) + (𝐹‘((invg‘𝑅)‘𝑌)))) |
| 17 | 15, 16 | syld3an3 1411 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) ≤ ((𝐹‘𝑋) + (𝐹‘((invg‘𝑅)‘𝑌)))) |
| 18 | 8, 1, 3 | abvneg 20735 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐹‘((invg‘𝑅)‘𝑌)) = (𝐹‘𝑌)) |
| 19 | 18 | 3adant2 1131 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘((invg‘𝑅)‘𝑌)) = (𝐹‘𝑌)) |
| 20 | 19 | oveq2d 7403 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝐹‘𝑋) + (𝐹‘((invg‘𝑅)‘𝑌))) = ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| 21 | 17, 20 | breqtrd 5133 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| 22 | 7, 21 | eqbrtrd 5129 | 1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 − 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 class class class wbr 5107 ‘cfv 6511 (class class class)co 7387 + caddc 11071 ≤ cle 11209 Basecbs 17179 +gcplusg 17220 Grpcgrp 18865 invgcminusg 18866 -gcsg 18867 Ringcrg 20142 AbsValcabv 20717 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-n0 12443 df-z 12530 df-uz 12794 df-ico 13312 df-seq 13967 df-exp 14027 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-0g 17404 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18868 df-minusg 18869 df-sbg 18870 df-cmn 19712 df-abl 19713 df-mgp 20050 df-rng 20062 df-ur 20091 df-ring 20144 df-abv 20718 |
| This theorem is referenced by: abvmet 24463 |
| Copyright terms: Public domain | W3C validator |