rrnmet - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > rrnmet		Structured version Visualization version GIF version

Theorem rrnmet 36686

Description: Euclidean space is a metric space. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 5-Jun-2014.)

**Hypothesis**
Ref	Expression
rrnval.1	⊢ 𝑋 = (ℝ ↑_m 𝐼)

**Assertion**
Ref	Expression
rrnmet	⊢ (𝐼 ∈ Fin → (ℝⁿ‘𝐼) ∈ (Met‘𝑋))

Proof of Theorem rrnmet Dummy variables 𝑘 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 484	. . . . . . 7 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐼 ∈ Fin)
2		simprl 770	. . . . . . . . . . . 12 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ 𝑋)
3		rrnval.1	. . . . . . . . . . . 12 ⊢ 𝑋 = (ℝ ↑_m 𝐼)
4	2, 3	eleqtrdi 2844	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ (ℝ ↑_m 𝐼))
5		elmapi 8840	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℝ ↑_m 𝐼) → 𝑥:𝐼⟶ℝ)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥:𝐼⟶ℝ)
7	6	ffvelcdmda 7084	. . . . . . . . 9 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → (𝑥‘𝑘) ∈ ℝ)
8		simprr 772	. . . . . . . . . . . 12 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
9	8, 3	eleqtrdi 2844	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ (ℝ ↑_m 𝐼))
10		elmapi 8840	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (ℝ ↑_m 𝐼) → 𝑦:𝐼⟶ℝ)
11	9, 10	syl 17	. . . . . . . . . 10 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦:𝐼⟶ℝ)
12	11	ffvelcdmda 7084	. . . . . . . . 9 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → (𝑦‘𝑘) ∈ ℝ)
13	7, 12	resubcld 11639	. . . . . . . 8 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → ((𝑥‘𝑘) − (𝑦‘𝑘)) ∈ ℝ)
14	13	resqcld 14087	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) ∈ ℝ)
15	1, 14	fsumrecl 15677	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) ∈ ℝ)
16	13	sqge0d 14099	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → 0 ≤ (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))
17	1, 14, 16	fsumge0 15738	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 0 ≤ Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))
18	15, 17	resqrtcld 15361	. . . . 5 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) ∈ ℝ)
19	18	ralrimivva 3201	. . . 4 ⊢ (𝐼 ∈ Fin → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) ∈ ℝ)
20		eqid 2733	. . . . 5 ⊢ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)))
21	20	fmpo 8051	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) ∈ ℝ ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))):(𝑋 × 𝑋)⟶ℝ)
22	19, 21	sylib 217	. . 3 ⊢ (𝐼 ∈ Fin → (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))):(𝑋 × 𝑋)⟶ℝ)
23	3	rrnval 36684	. . . 4 ⊢ (𝐼 ∈ Fin → (ℝⁿ‘𝐼) = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))))
24	23	feq1d 6700	. . 3 ⊢ (𝐼 ∈ Fin → ((ℝⁿ‘𝐼):(𝑋 × 𝑋)⟶ℝ ↔ (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑋 ↦ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))):(𝑋 × 𝑋)⟶ℝ))
25	22, 24	mpbird 257	. 2 ⊢ (𝐼 ∈ Fin → (ℝⁿ‘𝐼):(𝑋 × 𝑋)⟶ℝ)
26		sqrt00 15207	. . . . . . . 8 ⊢ ((Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) ∈ ℝ ∧ 0 ≤ Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) → ((√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) = 0 ↔ Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0))
27	15, 17, 26	syl2anc 585	. . . . . . 7 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) = 0 ↔ Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0))
28	1, 14, 16	fsum00 15741	. . . . . . 7 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0 ↔ ∀𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0))
29	27, 28	bitrd 279	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) = 0 ↔ ∀𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0))
30	13	recnd 11239	. . . . . . . . 9 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → ((𝑥‘𝑘) − (𝑦‘𝑘)) ∈ ℂ)
31		sqeq0 14082	. . . . . . . . 9 ⊢ (((𝑥‘𝑘) − (𝑦‘𝑘)) ∈ ℂ → ((((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0 ↔ ((𝑥‘𝑘) − (𝑦‘𝑘)) = 0))
32	30, 31	syl 17	. . . . . . . 8 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → ((((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0 ↔ ((𝑥‘𝑘) − (𝑦‘𝑘)) = 0))
33	7	recnd 11239	. . . . . . . . 9 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → (𝑥‘𝑘) ∈ ℂ)
34	12	recnd 11239	. . . . . . . . 9 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → (𝑦‘𝑘) ∈ ℂ)
35	33, 34	subeq0ad 11578	. . . . . . . 8 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → (((𝑥‘𝑘) − (𝑦‘𝑘)) = 0 ↔ (𝑥‘𝑘) = (𝑦‘𝑘)))
36	32, 35	bitrd 279	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑘 ∈ 𝐼) → ((((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0 ↔ (𝑥‘𝑘) = (𝑦‘𝑘)))
37	36	ralbidva 3176	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (∀𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2) = 0 ↔ ∀𝑘 ∈ 𝐼 (𝑥‘𝑘) = (𝑦‘𝑘)))
38	29, 37	bitrd 279	. . . . 5 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) = 0 ↔ ∀𝑘 ∈ 𝐼 (𝑥‘𝑘) = (𝑦‘𝑘)))
39	3	rrnmval 36685	. . . . . . 7 ⊢ ((𝐼 ∈ Fin ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥(ℝⁿ‘𝐼)𝑦) = (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)))
40	39	3expb 1121	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥(ℝⁿ‘𝐼)𝑦) = (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)))
41	40	eqeq1d 2735	. . . . 5 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥(ℝⁿ‘𝐼)𝑦) = 0 ↔ (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) = 0))
42	6	ffnd 6716	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 Fn 𝐼)
43	11	ffnd 6716	. . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 Fn 𝐼)
44		eqfnfv 7030	. . . . . 6 ⊢ ((𝑥 Fn 𝐼 ∧ 𝑦 Fn 𝐼) → (𝑥 = 𝑦 ↔ ∀𝑘 ∈ 𝐼 (𝑥‘𝑘) = (𝑦‘𝑘)))
45	42, 43, 44	syl2anc 585	. . . . 5 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥 = 𝑦 ↔ ∀𝑘 ∈ 𝐼 (𝑥‘𝑘) = (𝑦‘𝑘)))
46	38, 41, 45	3bitr4d 311	. . . 4 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥(ℝⁿ‘𝐼)𝑦) = 0 ↔ 𝑥 = 𝑦))
47		simpll 766	. . . . . . . 8 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → 𝐼 ∈ Fin)
48	7	adantlr 714	. . . . . . . . 9 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑥‘𝑘) ∈ ℝ)
49		simpr 486	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
50	49, 3	eleqtrdi 2844	. . . . . . . . . . 11 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ (ℝ ↑_m 𝐼))
51		elmapi 8840	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (ℝ ↑_m 𝐼) → 𝑧:𝐼⟶ℝ)
52	50, 51	syl 17	. . . . . . . . . 10 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → 𝑧:𝐼⟶ℝ)
53	52	ffvelcdmda 7084	. . . . . . . . 9 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑧‘𝑘) ∈ ℝ)
54	48, 53	resubcld 11639	. . . . . . . 8 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → ((𝑥‘𝑘) − (𝑧‘𝑘)) ∈ ℝ)
55	12	adantlr 714	. . . . . . . . 9 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑦‘𝑘) ∈ ℝ)
56	53, 55	resubcld 11639	. . . . . . . 8 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → ((𝑧‘𝑘) − (𝑦‘𝑘)) ∈ ℝ)
57	47, 54, 56	trirn 24909	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → (√‘Σ𝑘 ∈ 𝐼 ((((𝑥‘𝑘) − (𝑧‘𝑘)) + ((𝑧‘𝑘) − (𝑦‘𝑘)))↑2)) ≤ ((√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑧‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))))
58	33	adantlr 714	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑥‘𝑘) ∈ ℂ)
59	53	recnd 11239	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑧‘𝑘) ∈ ℂ)
60	34	adantlr 714	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑦‘𝑘) ∈ ℂ)
61	58, 59, 60	npncand 11592	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (((𝑥‘𝑘) − (𝑧‘𝑘)) + ((𝑧‘𝑘) − (𝑦‘𝑘))) = ((𝑥‘𝑘) − (𝑦‘𝑘)))
62	61	oveq1d 7421	. . . . . . . . 9 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → ((((𝑥‘𝑘) − (𝑧‘𝑘)) + ((𝑧‘𝑘) − (𝑦‘𝑘)))↑2) = (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))
63	62	sumeq2dv 15646	. . . . . . . 8 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → Σ𝑘 ∈ 𝐼 ((((𝑥‘𝑘) − (𝑧‘𝑘)) + ((𝑧‘𝑘) − (𝑦‘𝑘)))↑2) = Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2))
64	63	fveq2d 6893	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → (√‘Σ𝑘 ∈ 𝐼 ((((𝑥‘𝑘) − (𝑧‘𝑘)) + ((𝑧‘𝑘) − (𝑦‘𝑘)))↑2)) = (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)))
65		sqsubswap 14079	. . . . . . . . . . 11 ⊢ (((𝑥‘𝑘) ∈ ℂ ∧ (𝑧‘𝑘) ∈ ℂ) → (((𝑥‘𝑘) − (𝑧‘𝑘))↑2) = (((𝑧‘𝑘) − (𝑥‘𝑘))↑2))
66	58, 59, 65	syl2anc 585	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (((𝑥‘𝑘) − (𝑧‘𝑘))↑2) = (((𝑧‘𝑘) − (𝑥‘𝑘))↑2))
67	66	sumeq2dv 15646	. . . . . . . . 9 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑧‘𝑘))↑2) = Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2))
68	67	fveq2d 6893	. . . . . . . 8 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑧‘𝑘))↑2)) = (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)))
69	68	oveq1d 7421	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → ((√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑧‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))) = ((√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))))
70	57, 64, 69	3brtr3d 5179	. . . . . 6 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)) ≤ ((√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))))
71	40	adantr 482	. . . . . 6 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → (𝑥(ℝⁿ‘𝐼)𝑦) = (√‘Σ𝑘 ∈ 𝐼 (((𝑥‘𝑘) − (𝑦‘𝑘))↑2)))
72	3	rrnmval 36685	. . . . . . . . . 10 ⊢ ((𝐼 ∈ Fin ∧ 𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑧(ℝⁿ‘𝐼)𝑥) = (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)))
73	72	3adant3r 1182	. . . . . . . . 9 ⊢ ((𝐼 ∈ Fin ∧ 𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑧(ℝⁿ‘𝐼)𝑥) = (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)))
74	3	rrnmval 36685	. . . . . . . . . 10 ⊢ ((𝐼 ∈ Fin ∧ 𝑧 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑧(ℝⁿ‘𝐼)𝑦) = (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2)))
75	74	3adant3l 1181	. . . . . . . . 9 ⊢ ((𝐼 ∈ Fin ∧ 𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑧(ℝⁿ‘𝐼)𝑦) = (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2)))
76	73, 75	oveq12d 7424	. . . . . . . 8 ⊢ ((𝐼 ∈ Fin ∧ 𝑧 ∈ 𝑋 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦)) = ((√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))))
77	76	3expa 1119	. . . . . . 7 ⊢ (((𝐼 ∈ Fin ∧ 𝑧 ∈ 𝑋) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦)) = ((√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))))
78	77	an32s 651	. . . . . 6 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦)) = ((√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑥‘𝑘))↑2)) + (√‘Σ𝑘 ∈ 𝐼 (((𝑧‘𝑘) − (𝑦‘𝑘))↑2))))
79	70, 71, 78	3brtr4d 5180	. . . . 5 ⊢ (((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑋) → (𝑥(ℝⁿ‘𝐼)𝑦) ≤ ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦)))
80	79	ralrimiva 3147	. . . 4 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ∀𝑧 ∈ 𝑋 (𝑥(ℝⁿ‘𝐼)𝑦) ≤ ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦)))
81	46, 80	jca 513	. . 3 ⊢ ((𝐼 ∈ Fin ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (((𝑥(ℝⁿ‘𝐼)𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥(ℝⁿ‘𝐼)𝑦) ≤ ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦))))
82	81	ralrimivva 3201	. 2 ⊢ (𝐼 ∈ Fin → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥(ℝⁿ‘𝐼)𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥(ℝⁿ‘𝐼)𝑦) ≤ ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦))))
83		ovex 7439	. . . 4 ⊢ (ℝ ↑_m 𝐼) ∈ V
84	3, 83	eqeltri 2830	. . 3 ⊢ 𝑋 ∈ V
85		ismet 23821	. . 3 ⊢ (𝑋 ∈ V → ((ℝⁿ‘𝐼) ∈ (Met‘𝑋) ↔ ((ℝⁿ‘𝐼):(𝑋 × 𝑋)⟶ℝ ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥(ℝⁿ‘𝐼)𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥(ℝⁿ‘𝐼)𝑦) ≤ ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦))))))
86	84, 85	ax-mp 5	. 2 ⊢ ((ℝⁿ‘𝐼) ∈ (Met‘𝑋) ↔ ((ℝⁿ‘𝐼):(𝑋 × 𝑋)⟶ℝ ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥(ℝⁿ‘𝐼)𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥(ℝⁿ‘𝐼)𝑦) ≤ ((𝑧(ℝⁿ‘𝐼)𝑥) + (𝑧(ℝⁿ‘𝐼)𝑦)))))
87	25, 82, 86	sylanbrc 584	1 ⊢ (𝐼 ∈ Fin → (ℝⁿ‘𝐼) ∈ (Met‘𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 Vcvv 3475 class class class wbr 5148 × cxp 5674 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7406 ∈ cmpo 7408 ↑_m cmap 8817 Fincfn 8936 ℂcc 11105 ℝcr 11106 0cc0 11107 + caddc 11110 ≤ cle 11246 − cmin 11441 2c2 12264 ↑cexp 14024 √csqrt 15177 Σcsu 15629 Metcmet 20923 ℝⁿcrrn 36682

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-inf2 9633 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-er 8700 df-map 8819 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-sup 9434 df-oi 9502 df-card 9931 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-n0 12470 df-z 12556 df-uz 12820 df-rp 12972 df-ico 13327 df-fz 13482 df-fzo 13625 df-seq 13964 df-exp 14025 df-hash 14288 df-cj 15043 df-re 15044 df-im 15045 df-sqrt 15179 df-abs 15180 df-clim 15429 df-sum 15630 df-met 20931 df-rrn 36683

This theorem is referenced by: rrncmslem 36689 rrncms 36690 rrnequiv 36692 rrntotbnd 36693 rrnheibor 36694 ismrer1 36695 reheibor 36696

W3C validator