| 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 2762 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 3 | eqid 2762 | . . . . 5 ⊢ (invg‘𝑅) = (invg‘𝑅) | |
| 4 | abvsubtri.p | . . . . 5 ⊢ − = (-g‘𝑅) | |
| 5 | 1, 2, 3, 4 | grpsubval 19027 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) |
| 6 | 5 | 3adant1 1143 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) |
| 7 | 6 | fveq2d 6871 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 − 𝑌)) = (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌)))) |
| 8 | abv0.a | . . . . . . . 8 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 9 | 8 | abvrcl 20862 | . . . . . . 7 ⊢ (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring) |
| 10 | 9 | 3ad2ant1 1146 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑅 ∈ Ring) |
| 11 | ringgrp 20288 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 12 | 10, 11 | syl 17 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑅 ∈ Grp) |
| 13 | simp3 1151 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 14 | 1, 3 | grpinvcl 19029 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝑅)‘𝑌) ∈ 𝐵) |
| 15 | 12, 13, 14 | syl2anc 593 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝑅)‘𝑌) ∈ 𝐵) |
| 16 | 8, 1, 2 | abvtri 20871 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝑅)‘𝑌) ∈ 𝐵) → (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) ≤ ((𝐹‘𝑋) + (𝐹‘((invg‘𝑅)‘𝑌)))) |
| 17 | 15, 16 | syld3an3 1428 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) ≤ ((𝐹‘𝑋) + (𝐹‘((invg‘𝑅)‘𝑌)))) |
| 18 | 8, 1, 3 | abvneg 20875 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐹‘((invg‘𝑅)‘𝑌)) = (𝐹‘𝑌)) |
| 19 | 18 | 3adant2 1144 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘((invg‘𝑅)‘𝑌)) = (𝐹‘𝑌)) |
| 20 | 19 | oveq2d 7412 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝐹‘𝑋) + (𝐹‘((invg‘𝑅)‘𝑌))) = ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| 21 | 17, 20 | breqtrd 5126 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋(+g‘𝑅)((invg‘𝑅)‘𝑌))) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| 22 | 7, 21 | eqbrtrd 5122 | 1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 − 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 class class class wbr 5100 ‘cfv 6521 (class class class)co 7396 + caddc 11076 ≤ cle 11217 Basecbs 17245 +gcplusg 17286 Grpcgrp 18975 invgcminusg 18976 -gcsg 18977 Ringcrg 20283 AbsValcabv 20857 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-map 8810 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-n0 12482 df-z 12569 df-uz 12840 df-ico 13355 df-seq 14015 df-exp 14075 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-plusg 17299 df-0g 17470 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-grp 18978 df-minusg 18979 df-sbg 18980 df-cmn 19822 df-abl 19823 df-mgp 20187 df-rng 20199 df-ur 20232 df-ring 20285 df-abv 20858 |
| This theorem is referenced by: abvmet 24635 |
| Copyright terms: Public domain | W3C validator |