rrxnm - Metamath Proof Explorer

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

Theorem rrxnm 25348

Description: The norm of the generalized real Euclidean spaces. (Contributed by Thierry Arnoux, 16-Jun-2019.)

**Hypotheses**
Ref	Expression
rrxval.r	⊢ 𝐻 = (ℝ^‘𝐼)
rrxbase.b	⊢ 𝐵 = (Base‘𝐻)

**Assertion**
Ref	Expression
rrxnm	⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (norm‘𝐻))

Distinct variable groups: 𝑥,𝑓,𝐵 𝑓,𝐼,𝑥 𝑓,𝑉,𝑥 Allowed substitution hints: 𝐻(𝑥,𝑓)

Proof of Theorem rrxnm Dummy variables 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		resrng 21586	. . . . 5 ⊢ ℝ_fld ∈ *-Ring
2		srngring 20811	. . . . 5 ⊢ (ℝ_fld ∈ *-Ring → ℝ_fld ∈ Ring)
3	1, 2	ax-mp 5	. . . 4 ⊢ ℝ_fld ∈ Ring
4		eqid 2736	. . . . 5 ⊢ (ℝ_fld freeLMod 𝐼) = (ℝ_fld freeLMod 𝐼)
5	4	frlmlmod 21714	. . . 4 ⊢ ((ℝ_fld ∈ Ring ∧ 𝐼 ∈ 𝑉) → (ℝ_fld freeLMod 𝐼) ∈ LMod)
6	3, 5	mpan 690	. . 3 ⊢ (𝐼 ∈ 𝑉 → (ℝ_fld freeLMod 𝐼) ∈ LMod)
7		lmodgrp 20829	. . 3 ⊢ ((ℝ_fld freeLMod 𝐼) ∈ LMod → (ℝ_fld freeLMod 𝐼) ∈ Grp)
8		eqid 2736	. . . 4 ⊢ (toℂPreHil‘(ℝ_fld freeLMod 𝐼)) = (toℂPreHil‘(ℝ_fld freeLMod 𝐼))
9		eqid 2736	. . . 4 ⊢ (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
10		eqid 2736	. . . 4 ⊢ (Base‘(ℝ_fld freeLMod 𝐼)) = (Base‘(ℝ_fld freeLMod 𝐼))
11		eqid 2736	. . . 4 ⊢ (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(ℝ_fld freeLMod 𝐼))
12	8, 9, 10, 11	tchnmfval 25185	. . 3 ⊢ ((ℝ_fld freeLMod 𝐼) ∈ Grp → (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
13	6, 7, 12	3syl 18	. 2 ⊢ (𝐼 ∈ 𝑉 → (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
14		rrxval.r	. . . 4 ⊢ 𝐻 = (ℝ^‘𝐼)
15	14	rrxval 25344	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐻 = (toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
16	15	fveq2d 6885	. 2 ⊢ (𝐼 ∈ 𝑉 → (norm‘𝐻) = (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
17	15	fveq2d 6885	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (Base‘𝐻) = (Base‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
18		rrxbase.b	. . . 4 ⊢ 𝐵 = (Base‘𝐻)
19	8, 10	tcphbas 25176	. . . 4 ⊢ (Base‘(ℝ_fld freeLMod 𝐼)) = (Base‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
20	17, 18, 19	3eqtr4g 2796	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = (Base‘(ℝ_fld freeLMod 𝐼)))
21	14, 18	rrxbase 25345	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = {𝑓 ∈ (ℝ ↑_m 𝐼) ∣ 𝑓 finSupp 0})
22		ssrab2 4060	. . . . . . . 8 ⊢ {𝑓 ∈ (ℝ ↑_m 𝐼) ∣ 𝑓 finSupp 0} ⊆ (ℝ ↑_m 𝐼)
23	21, 22	eqsstrdi 4008	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 𝐵 ⊆ (ℝ ↑_m 𝐼))
24	23	sselda 3963	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ (ℝ ↑_m 𝐼))
25	15	fveq2d 6885	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘𝐻) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
26	14, 18	rrxip 25347	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))) = (·_𝑖‘𝐻))
27	8, 11	tcphip 25182	. . . . . . . . . 10 ⊢ (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
28	27	a1i 11	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
29	25, 26, 28	3eqtr4rd 2782	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))))
30	29	adantr 480	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))))
31		simprl 770	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → ℎ = 𝑓)
32	31	fveq1d 6883	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (ℎ‘𝑥) = (𝑓‘𝑥))
33		simprr 772	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → 𝑔 = 𝑓)
34	33	fveq1d 6883	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (𝑔‘𝑥) = (𝑓‘𝑥))
35	32, 34	oveq12d 7428	. . . . . . . . . . 11 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
36	35	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
37		elmapi 8868	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ (ℝ ↑_m 𝐼) → 𝑓:𝐼⟶ℝ)
38	37	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → 𝑓:𝐼⟶ℝ)
39	38	ffvelcdmda 7079	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℝ)
40	39	recnd 11268	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℂ)
41	40	adantlr 715	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℂ)
42	41	sqvald 14166	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥)↑2) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
43	36, 42	eqtr4d 2774	. . . . . . . . 9 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥)↑2))
44	43	mpteq2dva 5219	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2)))
45	44	oveq2d 7426	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥)))) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
46		simpr 484	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → 𝑓 ∈ (ℝ ↑_m 𝐼))
47		ovexd 7445	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))) ∈ V)
48	30, 45, 46, 46, 47	ovmpod 7564	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
49	24, 48	syldan 591	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
50	49	eqcomd 2742	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))) = (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))
51	50	fveq2d 6885	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2)))) = (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓)))
52	20, 51	mpteq12dva 5211	. 2 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
53	13, 16, 52	3eqtr4rd 2782	1 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (norm‘𝐻))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {crab 3420 Vcvv 3464 class class class wbr 5124 ↦ cmpt 5206 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ∈ cmpo 7412 ↑_m cmap 8845 finSupp cfsupp 9378 ℂcc 11132 ℝcr 11133 0cc0 11134 · cmul 11139 2c2 12300 ↑cexp 14084 √csqrt 15257 Basecbs 17233 ·_𝑖cip 17281 Σ_g cgsu 17459 Grpcgrp 18921 Ringcrg 20198 *-Ringcsr 20803 LModclmod 20822 ℝ_fldcrefld 21569 freeLMod cfrlm 21711 normcnm 24520 toℂPreHilctcph 25124 ℝ^crrx 25340

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-pre-sup 11212 ax-addf 11213 ax-mulf 11214

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-supp 8165 df-tpos 8230 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-map 8847 df-ixp 8917 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-fsupp 9379 df-sup 9459 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12507 df-z 12594 df-dec 12714 df-uz 12858 df-rp 13014 df-fz 13530 df-seq 14025 df-exp 14085 df-cj 15123 df-re 15124 df-im 15125 df-sqrt 15259 df-abs 15260 df-struct 17171 df-sets 17188 df-slot 17206 df-ndx 17218 df-base 17234 df-ress 17257 df-plusg 17289 df-mulr 17290 df-starv 17291 df-sca 17292 df-vsca 17293 df-ip 17294 df-tset 17295 df-ple 17296 df-ds 17298 df-unif 17299 df-hom 17300 df-cco 17301 df-0g 17460 df-prds 17466 df-pws 17468 df-mgm 18623 df-sgrp 18702 df-mnd 18718 df-mhm 18766 df-grp 18924 df-minusg 18925 df-sbg 18926 df-subg 19111 df-ghm 19201 df-cmn 19768 df-abl 19769 df-mgp 20106 df-rng 20118 df-ur 20147 df-ring 20200 df-cring 20201 df-oppr 20302 df-dvdsr 20322 df-unit 20323 df-invr 20353 df-dvr 20366 df-rhm 20437 df-subrng 20511 df-subrg 20535 df-drng 20696 df-field 20697 df-staf 20804 df-srng 20805 df-lmod 20824 df-lss 20894 df-sra 21136 df-rgmod 21137 df-cnfld 21321 df-refld 21570 df-dsmm 21697 df-frlm 21712 df-nm 24526 df-tng 24528 df-tcph 25126 df-rrx 25342

This theorem is referenced by: rrxds 25350

W3C validator