MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  abvtri Structured version   Visualization version   GIF version

Theorem abvtri 21072
Description: An absolute value satisfies the triangle inequality. (Contributed by Mario Carneiro, 8-Sep-2014.)
Hypotheses
Ref Expression
abvf.a 𝐴 = (AbsVal‘𝑅)
abvf.b 𝐵 = (Base‘𝑅)
abvtri.p + = (+g‘𝑅)
Assertion
Ref Expression
abvtri ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌)))

Proof of Theorem abvtri
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 abvf.a . . . . . . 7 𝐴 = (AbsVal‘𝑅)
21abvrcl 21063 . . . . . 6 (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring)
3 abvf.b . . . . . . 7 𝐵 = (Base‘𝑅)
4 abvtri.p . . . . . . 7 + = (+g‘𝑅)
5 eqid 2761 . . . . . . 7 (.r‘𝑅) = (.r‘𝑅)
6 eqid 2761 . . . . . . 7 (0g‘𝑅) = (0g‘𝑅)
71, 3, 4, 5, 6isabv 21061 . . . . . 6 (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))
82, 7syl 18 . . . . 5 (𝐹 ∈ 𝐴 → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))
98ibi 270 . . . 4 (𝐹 ∈ 𝐴 → (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
10 simpr 490 . . . . . . 7 (((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))) → (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
1110ralimi 3100 . . . . . 6 (∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))) → ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
1211adantl 487 . . . . 5 ((((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
1312ralimi 3100 . . . 4 (∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
149, 13simpl2im 513 . . 3 (𝐹 ∈ 𝐴 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
15 fvoveq1 7441 . . . . 5 (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦)))
16 fveq2 6883 . . . . . 6 (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
1716oveq1d 7433 . . . . 5 (𝑥 = 𝑋 → ((𝐹‘𝑥) + (𝐹‘𝑦)) = ((𝐹‘𝑋) + (𝐹‘𝑦)))
1815, 17breq12d 5116 . . . 4 (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑦))))
19 oveq2 7426 . . . . . 6 (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌))
2019fveq2d 6887 . . . . 5 (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌)))
21 fveq2 6883 . . . . . 6 (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
2221oveq2d 7434 . . . . 5 (𝑦 = 𝑌 → ((𝐹‘𝑋) + (𝐹‘𝑦)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))
2320, 22breq12d 5116 . . . 4 (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
2418, 23rspc2v 3587 . . 3 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
2514, 24syl5com 32 . 2 (𝐹 ∈ 𝐴 → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
26253impib 1134 1 ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   class class class wbr 5103  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  0cc0 11193   + caddc 11196   · cmul 11198  +∞cpnf 11333   ≤ cle 11337  [,)cico 13471  Basecbs 17380  +gcplusg 17421  .rcmulr 17422  0gc0g 17603  Ringcrg 20452  AbsValcabv 21058
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 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  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-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-map 8842  df-abv 21059
This theorem is used by:  abvsubtri  21077  abvres  21081  abvcxp  27935  qabvle  27945  ostth2lem2  27954  ostth3  27958
  Copyright terms: Public domain W3C validator