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 25620

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 21835	. . . . 5 ⊢ ℝ_fld ∈ *-Ring
2		srngring 21013	. . . . 5 ⊢ (ℝ_fld ∈ *-Ring → ℝ_fld ∈ Ring)
3	1, 2	ax-mp 5	. . . 4 ⊢ ℝ_fld ∈ Ring
4		eqid 2762	. . . . 5 ⊢ (ℝ_fld freeLMod 𝐼) = (ℝ_fld freeLMod 𝐼)
5	4	frlmlmod 21963	. . . 4 ⊢ ((ℝ_fld ∈ Ring ∧ 𝐼 ∈ 𝑉) → (ℝ_fld freeLMod 𝐼) ∈ LMod)
6	3, 5	mpan 703	. . 3 ⊢ (𝐼 ∈ 𝑉 → (ℝ_fld freeLMod 𝐼) ∈ LMod)
7		lmodgrp 21052	. . 3 ⊢ ((ℝ_fld freeLMod 𝐼) ∈ LMod → (ℝ_fld freeLMod 𝐼) ∈ Grp)
8		eqid 2762	. . . 4 ⊢ (toℂPreHil‘(ℝ_fld freeLMod 𝐼)) = (toℂPreHil‘(ℝ_fld freeLMod 𝐼))
9		eqid 2762	. . . 4 ⊢ (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
10		eqid 2762	. . . 4 ⊢ (Base‘(ℝ_fld freeLMod 𝐼)) = (Base‘(ℝ_fld freeLMod 𝐼))
11		eqid 2762	. . . 4 ⊢ (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(ℝ_fld freeLMod 𝐼))
12	8, 9, 10, 11	tchnmfval 25457	. . 3 ⊢ ((ℝ_fld freeLMod 𝐼) ∈ Grp → (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
13	6, 7, 12	3syl 19	. 2 ⊢ (𝐼 ∈ 𝑉 → (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
14		rrxval.r	. . . 4 ⊢ 𝐻 = (ℝ^‘𝐼)
15	14	rrxval 25616	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐻 = (toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
16	15	fveq2d 6886	. 2 ⊢ (𝐼 ∈ 𝑉 → (norm‘𝐻) = (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
17	15	fveq2d 6886	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (Base‘𝐻) = (Base‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
18		rrxbase.b	. . . 4 ⊢ 𝐵 = (Base‘𝐻)
19	8, 10	tcphbas 25448	. . . 4 ⊢ (Base‘(ℝ_fld freeLMod 𝐼)) = (Base‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
20	17, 18, 19	3eqtr4g 2822	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = (Base‘(ℝ_fld freeLMod 𝐼)))
21	14, 18	rrxbase 25617	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = {𝑓 ∈ (ℝ ↑_m 𝐼) ∣ 𝑓 finSupp 0})
22		ssrab2 4031	. . . . . . . 8 ⊢ {𝑓 ∈ (ℝ ↑_m 𝐼) ∣ 𝑓 finSupp 0} ⊆ (ℝ ↑_m 𝐼)
23	21, 22	eqsstrdi 3978	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 𝐵 ⊆ (ℝ ↑_m 𝐼))
24	23	sselda 3934	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ (ℝ ↑_m 𝐼))
25	15	fveq2d 6886	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘𝐻) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
26	14, 18	rrxip 25619	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))) = (·_𝑖‘𝐻))
27	8, 11	tcphip 25454	. . . . . . . . . 10 ⊢ (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
28	27	a1i 11	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
29	25, 26, 28	3eqtr4rd 2808	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))))
30	29	adantr 486	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))))
31		simprl 783	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → ℎ = 𝑓)
32	31	fveq1d 6884	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (ℎ‘𝑥) = (𝑓‘𝑥))
33		simprr 785	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → 𝑔 = 𝑓)
34	33	fveq1d 6884	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (𝑔‘𝑥) = (𝑓‘𝑥))
35	32, 34	oveq12d 7434	. . . . . . . . . . 11 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
36	35	adantr 486	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
37		elmapi 8851	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ (ℝ ↑_m 𝐼) → 𝑓:𝐼⟶ℝ)
38	37	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → 𝑓:𝐼⟶ℝ)
39	38	ffvelcdmda 7080	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℝ)
40	39	recnd 11264	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℂ)
41	40	adantlr 728	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℂ)
42	41	sqvald 14209	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥)↑2) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
43	36, 42	eqtr4d 2800	. . . . . . . . 9 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥)↑2))
44	43	mpteq2dva 5202	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2)))
45	44	oveq2d 7432	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥)))) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
46		simpr 490	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → 𝑓 ∈ (ℝ ↑_m 𝐼))
47		ovexd 7451	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))) ∈ V)
48	30, 45, 46, 46, 47	ovmpod 7568	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
49	24, 48	syldan 603	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
50	49	eqcomd 2768	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))) = (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))
51	50	fveq2d 6886	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2)))) = (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓)))
52	20, 51	mpteq12dva 5195	. 2 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
53	13, 16, 52	3eqtr4rd 2808	1 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (norm‘𝐻))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3414 Vcvv 3453 class class class wbr 5107 ↦ cmpt 5190 ⟶wf 6533 ‘cfv 6537 (class class class)co 7416 ∈ cmpo 7418 ↑_m cmap 8829 finSupp cfsupp 9334 ℂcc 11125 ℝcr 11126 0cc0 11127 · cmul 11132 2c2 12322 ↑cexp 14127 √csqrt 15322 Basecbs 17305 ·_𝑖cip 17351 Σ_g cgsu 17529 Grpcgrp 19058 Ringcrg 20373 *-Ringcsr 21005 LModclmod 21045 ℝ_fldcrefld 21818 freeLMod cfrlm 21960 normcnm 24803 toℂPreHilctcph 25396 ℝ^crrx 25612

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 ax-addf 11206 ax-mulf 11207

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 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 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-supp 8162 df-tpos 8227 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-er 8699 df-map 8831 df-ixp 8908 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-fsupp 9335 df-sup 9415 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12532 df-z 12619 df-dec 12740 df-uz 12891 df-rp 13045 df-fz 13564 df-seq 14068 df-exp 14128 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 df-struct 17243 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-mulr 17360 df-starv 17361 df-sca 17362 df-vsca 17363 df-ip 17364 df-tset 17365 df-ple 17366 df-ds 17368 df-unif 17369 df-hom 17370 df-cco 17371 df-0g 17530 df-prds 17536 df-pws 17538 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-mhm 18892 df-grp 19061 df-minusg 19062 df-sbg 19063 df-subg 19247 df-ghm 19342 df-cmn 19910 df-abl 19911 df-mgp 20275 df-rng 20289 df-ur 20322 df-ring 20375 df-cring 20376 df-oppr 20479 df-dvdsr 20499 df-unit 20500 df-invr 20530 df-dvr 20543 df-rhm 20614 df-subrng 20709 df-subrg 20733 df-drng 20893 df-field 20894 df-staf 21006 df-srng 21007 df-lmod 21047 df-lss 21117 df-sra 21358 df-rgmod 21359 df-cnfld 21587 df-refld 21819 df-dsmm 21946 df-frlm 21961 df-nm 24809 df-tng 24811 df-tcph 25398 df-rrx 25614

This theorem is used by: rrxds 25622

W3C validator