rrxmval - Metamath Proof Explorer

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

Theorem rrxmval 23188

Description: The value of the Euclidean metric. Compare with rrnmval 33627. (Contributed by Thierry Arnoux, 30-Jun-2019.)

**Hypotheses**
Ref	Expression
rrxmval.1	⊢ 𝑋 = {ℎ ∈ (ℝ ↑_𝑚 𝐼) ∣ ℎ finSupp 0}
rrxmval.d	⊢ 𝐷 = (dist‘(ℝ^‘𝐼))

**Assertion**
Ref	Expression
rrxmval	⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝐹𝐷𝐺) = (√‘Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2)))

Distinct variable groups: ℎ,𝐹,𝑘 ℎ,𝐺,𝑘 ℎ,𝐼,𝑘 ℎ,𝑉,𝑘 𝑘,𝑋 Allowed substitution hints: 𝐷(ℎ,𝑘) 𝑋(ℎ)

Proof of Theorem rrxmval Dummy variables 𝑓 𝑔 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2622	. . . . . 6 ⊢ (ℝ^‘𝐼) = (ℝ^‘𝐼)
2		eqid 2622	. . . . . 6 ⊢ (Base‘(ℝ^‘𝐼)) = (Base‘(ℝ^‘𝐼))
3	1, 2	rrxds 23181	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ (Base‘(ℝ^‘𝐼)), 𝑔 ∈ (Base‘(ℝ^‘𝐼)) ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))) = (dist‘(ℝ^‘𝐼)))
4		rrxmval.d	. . . . 5 ⊢ 𝐷 = (dist‘(ℝ^‘𝐼))
5	3, 4	syl6reqr 2675	. . . 4 ⊢ (𝐼 ∈ 𝑉 → 𝐷 = (𝑓 ∈ (Base‘(ℝ^‘𝐼)), 𝑔 ∈ (Base‘(ℝ^‘𝐼)) ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))))
6	1, 2	rrxbase 23176	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → (Base‘(ℝ^‘𝐼)) = {ℎ ∈ (ℝ ↑_𝑚 𝐼) ∣ ℎ finSupp 0})
7		rrxmval.1	. . . . . 6 ⊢ 𝑋 = {ℎ ∈ (ℝ ↑_𝑚 𝐼) ∣ ℎ finSupp 0}
8	6, 7	syl6reqr 2675	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → 𝑋 = (Base‘(ℝ^‘𝐼)))
9		mpt2eq12 6715	. . . . 5 ⊢ ((𝑋 = (Base‘(ℝ^‘𝐼)) ∧ 𝑋 = (Base‘(ℝ^‘𝐼))) → (𝑓 ∈ 𝑋, 𝑔 ∈ 𝑋 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))) = (𝑓 ∈ (Base‘(ℝ^‘𝐼)), 𝑔 ∈ (Base‘(ℝ^‘𝐼)) ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))))
10	8, 8, 9	syl2anc 693	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝑋, 𝑔 ∈ 𝑋 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))) = (𝑓 ∈ (Base‘(ℝ^‘𝐼)), 𝑔 ∈ (Base‘(ℝ^‘𝐼)) ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))))
11	5, 10	eqtr4d 2659	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐷 = (𝑓 ∈ 𝑋, 𝑔 ∈ 𝑋 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))))
12	11	3ad2ant1 1082	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 𝐷 = (𝑓 ∈ 𝑋, 𝑔 ∈ 𝑋 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))))))
13		simprl 794	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → 𝑓 = 𝐹)
14	13	fveq1d 6193	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (𝑓‘𝑥) = (𝐹‘𝑥))
15		simprr 796	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → 𝑔 = 𝐺)
16	15	fveq1d 6193	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (𝑔‘𝑥) = (𝐺‘𝑥))
17	14, 16	oveq12d 6668	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → ((𝑓‘𝑥) − (𝑔‘𝑥)) = ((𝐹‘𝑥) − (𝐺‘𝑥)))
18	17	oveq1d 6665	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (((𝑓‘𝑥) − (𝑔‘𝑥))↑2) = (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))
19	18	mpteq2dv 4745	. . . . 5 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2)) = (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)))
20	19	oveq2d 6666	. . . 4 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))))
21		simp2 1062	. . . . . . . . . . . 12 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 𝐹 ∈ 𝑋)
22	7, 21	rrxf 23184	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 𝐹:𝐼⟶ℝ)
23	22	ffvelrnda 6359	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ℝ)
24		simp3 1063	. . . . . . . . . . . 12 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 𝐺 ∈ 𝑋)
25	7, 24	rrxf 23184	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 𝐺:𝐼⟶ℝ)
26	25	ffvelrnda 6359	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑥 ∈ 𝐼) → (𝐺‘𝑥) ∈ ℝ)
27	23, 26	resubcld 10458	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥) − (𝐺‘𝑥)) ∈ ℝ)
28	27	resqcld 13035	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑥 ∈ 𝐼) → (((𝐹‘𝑥) − (𝐺‘𝑥))↑2) ∈ ℝ)
29		eqid 2622	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) = (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))
30	28, 29	fmptd 6385	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)):𝐼⟶ℝ)
31	7, 21	rrxfsupp 23185	. . . . . . . . . 10 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝐹 supp 0) ∈ Fin)
32	7, 24	rrxfsupp 23185	. . . . . . . . . 10 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝐺 supp 0) ∈ Fin)
33		unfi 8227	. . . . . . . . . 10 ⊢ (((𝐹 supp 0) ∈ Fin ∧ (𝐺 supp 0) ∈ Fin) → ((𝐹 supp 0) ∪ (𝐺 supp 0)) ∈ Fin)
34	31, 32, 33	syl2anc 693	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝐹 supp 0) ∪ (𝐺 supp 0)) ∈ Fin)
35	7	rrxmvallem 23187	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ ((𝐹 supp 0) ∪ (𝐺 supp 0)))
36		ssfi 8180	. . . . . . . . 9 ⊢ ((((𝐹 supp 0) ∪ (𝐺 supp 0)) ∈ Fin ∧ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ ((𝐹 supp 0) ∪ (𝐺 supp 0))) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ∈ Fin)
37	34, 35, 36	syl2anc 693	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ∈ Fin)
38		mptexg 6484	. . . . . . . . . 10 ⊢ (𝐼 ∈ 𝑉 → (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) ∈ V)
39		funmpt 5926	. . . . . . . . . . 11 ⊢ Fun (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))
40		0cn 10032	. . . . . . . . . . 11 ⊢ 0 ∈ ℂ
41		funisfsupp 8280	. . . . . . . . . . 11 ⊢ ((Fun (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) ∧ (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) ∈ V ∧ 0 ∈ ℂ) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ∈ Fin))
42	39, 40, 41	mp3an13 1415	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) ∈ V → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ∈ Fin))
43	38, 42	syl 17	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ∈ Fin))
44	43	3ad2ant1 1082	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) finSupp 0 ↔ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ∈ Fin))
45	37, 44	mpbird 247	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) finSupp 0)
46		simp1 1061	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 𝐼 ∈ 𝑉)
47		regsumsupp 19968	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)):𝐼⟶ℝ ∧ (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) finSupp 0 ∧ 𝐼 ∈ 𝑉) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))) = Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘))
48	30, 45, 46, 47	syl3anc 1326	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))) = Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘))
49		suppssdm 7308	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ dom (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))
50	29	dmmptss 5631	. . . . . . . . . . 11 ⊢ dom (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) ⊆ 𝐼
51	49, 50	sstri 3612	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ 𝐼
52	51	a1i 11	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ 𝐼)
53	52	sselda 3603	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)) → 𝑘 ∈ 𝐼)
54		eqidd 2623	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) = (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)))
55		simpr 477	. . . . . . . . . . . . 13 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 = 𝑘) → 𝑥 = 𝑘)
56	55	fveq2d 6195	. . . . . . . . . . . 12 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 = 𝑘) → (𝐹‘𝑥) = (𝐹‘𝑘))
57	55	fveq2d 6195	. . . . . . . . . . . 12 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 = 𝑘) → (𝐺‘𝑥) = (𝐺‘𝑘))
58	56, 57	oveq12d 6668	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 = 𝑘) → ((𝐹‘𝑥) − (𝐺‘𝑥)) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
59	58	oveq1d 6665	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 = 𝑘) → (((𝐹‘𝑥) − (𝐺‘𝑥))↑2) = (((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
60		simpr 477	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → 𝑘 ∈ 𝐼)
61		ovexd 6680	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) ∈ V)
62	54, 59, 60, 61	fvmptd 6288	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘) = (((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
63	62	eqcomd 2628	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘))
64	53, 63	syldan 487	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘))
65	64	sumeq2dv 14433	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)(((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘))
66	48, 65	eqtr4d 2659	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))) = Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)(((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
67	66	adantr 481	. . . 4 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))) = Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)(((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
68	22	ffvelrnda 6359	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝐹‘𝑘) ∈ ℝ)
69	68	recnd 10068	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝐹‘𝑘) ∈ ℂ)
70	25	ffvelrnda 6359	. . . . . . . . . 10 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝐺‘𝑘) ∈ ℝ)
71	70	recnd 10068	. . . . . . . . 9 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (𝐺‘𝑘) ∈ ℂ)
72	69, 71	subcld 10392	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → ((𝐹‘𝑘) − (𝐺‘𝑘)) ∈ ℂ)
73	72	sqcld 13006	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) ∈ ℂ)
74	53, 73	syldan 487	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) ∈ ℂ)
75	7, 21	rrxsuppss 23186	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝐹 supp 0) ⊆ 𝐼)
76	7, 24	rrxsuppss 23186	. . . . . . . . . . 11 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝐺 supp 0) ⊆ 𝐼)
77	75, 76	unssd 3789	. . . . . . . . . 10 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝐹 supp 0) ∪ (𝐺 supp 0)) ⊆ 𝐼)
78	77	ssdifssd 3748	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)) ⊆ 𝐼)
79	78	sselda 3603	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))) → 𝑘 ∈ 𝐼)
80	79, 63	syldan 487	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘))
81	77	ssdifd 3746	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)) ⊆ (𝐼 ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)))
82	81	sselda 3603	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))) → 𝑘 ∈ (𝐼 ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)))
83		ssid 3624	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)
84	83	a1i 11	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0) ⊆ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))
85		0cnd 10033	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → 0 ∈ ℂ)
86	30, 84, 46, 85	suppssr 7326	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ (𝐼 ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘) = 0)
87	82, 86	syldan 487	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))) → ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2))‘𝑘) = 0)
88	80, 87	eqtrd 2656	. . . . . 6 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ 𝑘 ∈ (((𝐹 supp 0) ∪ (𝐺 supp 0)) ∖ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0))) → (((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = 0)
89	35, 74, 88, 34	fsumss 14456	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)(((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
90	89	adantr 481	. . . 4 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → Σ𝑘 ∈ ((𝑥 ∈ 𝐼 ↦ (((𝐹‘𝑥) − (𝐺‘𝑥))↑2)) supp 0)(((𝐹‘𝑘) − (𝐺‘𝑘))↑2) = Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
91	20, 67, 90	3eqtrd 2660	. . 3 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2))) = Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2))
92	91	fveq2d 6195	. 2 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) ∧ (𝑓 = 𝐹 ∧ 𝑔 = 𝐺)) → (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ (((𝑓‘𝑥) − (𝑔‘𝑥))↑2)))) = (√‘Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2)))
93		fvexd 6203	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (√‘Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2)) ∈ V)
94	12, 92, 21, 24, 93	ovmpt2d 6788	1 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 ∈ 𝑋 ∧ 𝐺 ∈ 𝑋) → (𝐹𝐷𝐺) = (√‘Σ𝑘 ∈ ((𝐹 supp 0) ∪ (𝐺 supp 0))(((𝐹‘𝑘) − (𝐺‘𝑘))↑2)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 {crab 2916 Vcvv 3200 ∖ cdif 3571 ∪ cun 3572 ⊆ wss 3574 class class class wbr 4653 ↦ cmpt 4729 dom cdm 5114 Fun wfun 5882 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 supp csupp 7295 ↑_𝑚 cmap 7857 Fincfn 7955 finSupp cfsupp 8275 ℂcc 9934 ℝcr 9935 0cc0 9936 − cmin 10266 2c2 11070 ↑cexp 12860 √csqrt 13973 Σcsu 14416 Basecbs 15857 distcds 15950 Σ_g cgsu 16101 ℝ_fldcrefld 19950 ℝ^crrx 23171

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-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 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-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 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-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-tpos 7352 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-ixp 7909 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-sup 8348 df-oi 8415 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-rp 11833 df-fz 12327 df-fzo 12466 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-sum 14417 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-starv 15956 df-sca 15957 df-vsca 15958 df-ip 15959 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-hom 15966 df-cco 15967 df-0g 16102 df-gsum 16103 df-prds 16108 df-pws 16110 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-mhm 17335 df-grp 17425 df-minusg 17426 df-sbg 17427 df-subg 17591 df-ghm 17658 df-cntz 17750 df-cmn 18195 df-abl 18196 df-mgp 18490 df-ur 18502 df-ring 18549 df-cring 18550 df-oppr 18623 df-dvdsr 18641 df-unit 18642 df-invr 18672 df-dvr 18683 df-rnghom 18715 df-drng 18749 df-field 18750 df-subrg 18778 df-staf 18845 df-srng 18846 df-lmod 18865 df-lss 18933 df-sra 19172 df-rgmod 19173 df-cnfld 19747 df-refld 19951 df-dsmm 20076 df-frlm 20091 df-nm 22387 df-tng 22389 df-tch 22969 df-rrx 23173

This theorem is referenced by: rrxmfval 23189 rrxmet 23191 rrxdstprj1 23192

W3C validator