Theorem abvtri 21130

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.

Step	Hyp	Ref	Expression
1		abvf.a	. . . . . . 7 ⊢ 𝐴 = (AbsVal‘𝑅)
2	1	abvrcl 21121	. . . . . 6 ⊢ (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring)
3		abvf.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑅)
4		abvtri.p	. . . . . . 7 ⊢ + = (+g‘𝑅)
5		eqid 2763	. . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅)
6		eqid 2763	. . . . . . 7 ⊢ (0g‘𝑅) = (0g‘𝑅)
7	1, 3, 4, 5, 6	isabv 21119	. . . . . 6 ⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))
8	2, 7	syl 18	. . . . 5 ⊢ (𝐹 ∈ 𝐴 → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))
9	8	ibi 270	. . . 4 ⊢ (𝐹 ∈ 𝐴 → (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
10		simpr 490	. . . . . . 7 ⊢ (((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))) → (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
11	10	ralimi 3103	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))) → ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
12	11	adantl 487	. . . . 5 ⊢ ((((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
13	12	ralimi 3103	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
14	9, 13	simpl2im 513	. . 3 ⊢ (𝐹 ∈ 𝐴 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
15		fvoveq1 7474	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦)))
16		fveq2 6916	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
17	16	oveq1d 7466	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) + (𝐹‘𝑦)) = ((𝐹‘𝑋) + (𝐹‘𝑦)))
18	15, 17	breq12d 5121	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑦))))
19		oveq2 7459	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌))
20	19	fveq2d 6920	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌)))
21		fveq2 6916	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
22	21	oveq2d 7467	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) + (𝐹‘𝑦)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))
23	20, 22	breq12d 5121	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
24	18, 23	rspc2v 3590	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
25	14, 24	syl5com 32	. 2 ⊢ (𝐹 ∈ 𝐴 → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
26	25	3impib 1134	1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5108  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  0cc0 11239   + caddc 11242   · cmul 11244  +∞cpnf 11379   ≤ cle 11383  [,)cico 13518  Basecbs 17431  +_gcplusg 17472  ._rcmulr 17473  0_gc0g 17660  Ringcrg 20510  AbsValcabv 21116

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-abv 21117

This theorem is used by:  abvsubtri  21135  abvres  21139  abvcxp  27999  qabvle  28009  ostth2lem2  28018  ostth3  28022