Theorem abvtri 18830

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	. . . . . . . 8 ⊢ 𝐴 = (AbsVal‘𝑅)
2	1	abvrcl 18821	. . . . . . 7 ⊢ (𝐹 ∈ 𝐴 → 𝑅 ∈ Ring)
3		abvf.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
4		abvtri.p	. . . . . . . 8 ⊢ + = (+g‘𝑅)
5		eqid 2622	. . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅)
6		eqid 2622	. . . . . . . 8 ⊢ (0g‘𝑅) = (0g‘𝑅)
7	1, 3, 4, 5, 6	isabv 18819	. . . . . . 7 ⊢ (𝑅 ∈ Ring → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))
8	2, 7	syl 17	. . . . . 6 ⊢ (𝐹 ∈ 𝐴 → (𝐹 ∈ 𝐴 ↔ (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))))
9	8	ibi 256	. . . . 5 ⊢ (𝐹 ∈ 𝐴 → (𝐹:𝐵⟶(0[,)+∞) ∧ ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))))))
10	9	simprd 479	. . . 4 ⊢ (𝐹 ∈ 𝐴 → ∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))))
11		simpr 477	. . . . . . 7 ⊢ (((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))) → (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
12	11	ralimi 2952	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦))) → ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
13	12	adantl 482	. . . . 5 ⊢ ((((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
14	13	ralimi 2952	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 (((𝐹‘𝑥) = 0 ↔ 𝑥 = (0g‘𝑅)) ∧ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝑥(.r‘𝑅)𝑦)) = ((𝐹‘𝑥) · (𝐹‘𝑦)) ∧ (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
15	10, 14	syl 17	. . 3 ⊢ (𝐹 ∈ 𝐴 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)))
16		oveq1 6657	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 + 𝑦) = (𝑋 + 𝑦))
17	16	fveq2d 6195	. . . . 5 ⊢ (𝑥 = 𝑋 → (𝐹‘(𝑥 + 𝑦)) = (𝐹‘(𝑋 + 𝑦)))
18		fveq2 6191	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
19	18	oveq1d 6665	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) + (𝐹‘𝑦)) = ((𝐹‘𝑋) + (𝐹‘𝑦)))
20	17, 19	breq12d 4666	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑦)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑦))))
21		oveq2 6658	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 + 𝑦) = (𝑋 + 𝑌))
22	21	fveq2d 6195	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝐹‘(𝑋 + 𝑦)) = (𝐹‘(𝑋 + 𝑌)))
23		fveq2 6191	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
24	23	oveq2d 6666	. . . . 5 ⊢ (𝑦 = 𝑌 → ((𝐹‘𝑋) + (𝐹‘𝑦)) = ((𝐹‘𝑋) + (𝐹‘𝑌)))
25	22, 24	breq12d 4666	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝑋 + 𝑦)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑦)) ↔ (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
26	20, 25	rspc2v 3322	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 + 𝑦)) ≤ ((𝐹‘𝑥) + (𝐹‘𝑦)) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
27	15, 26	syl5com 31	. 2 ⊢ (𝐹 ∈ 𝐴 → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌))))
28	27	3impib 1262	1 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 + 𝑌)) ≤ ((𝐹‘𝑋) + (𝐹‘𝑌)))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  ∀wral 2912   class class class wbr 4653  ⟶wf 5884  ‘cfv 5888  (class class class)co 6650  0cc0 9936   + caddc 9939   · cmul 9941  +∞cpnf 10071   ≤ cle 10075  [,)cico 12177  Basecbs 15857  +_gcplusg 15941  ._rcmulr 15942  0_gc0g 16100  Ringcrg 18547  AbsValcabv 18816

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-map 7859  df-abv 18817

This theorem is referenced by:  abvsubtri  18835  abvres  18839  abvcxp  25304  qabvle  25314  ostth2lem2  25323  ostth3  25327