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 24555

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		recrng 20826	. . . . 5 ⊢ ℝ_fld ∈ *-Ring
2		srngring 20112	. . . . 5 ⊢ (ℝ_fld ∈ *-Ring → ℝ_fld ∈ Ring)
3	1, 2	ax-mp 5	. . . 4 ⊢ ℝ_fld ∈ Ring
4		eqid 2738	. . . . 5 ⊢ (ℝ_fld freeLMod 𝐼) = (ℝ_fld freeLMod 𝐼)
5	4	frlmlmod 20956	. . . 4 ⊢ ((ℝ_fld ∈ Ring ∧ 𝐼 ∈ 𝑉) → (ℝ_fld freeLMod 𝐼) ∈ LMod)
6	3, 5	mpan 687	. . 3 ⊢ (𝐼 ∈ 𝑉 → (ℝ_fld freeLMod 𝐼) ∈ LMod)
7		lmodgrp 20130	. . 3 ⊢ ((ℝ_fld freeLMod 𝐼) ∈ LMod → (ℝ_fld freeLMod 𝐼) ∈ Grp)
8		eqid 2738	. . . 4 ⊢ (toℂPreHil‘(ℝ_fld freeLMod 𝐼)) = (toℂPreHil‘(ℝ_fld freeLMod 𝐼))
9		eqid 2738	. . . 4 ⊢ (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))) = (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
10		eqid 2738	. . . 4 ⊢ (Base‘(ℝ_fld freeLMod 𝐼)) = (Base‘(ℝ_fld freeLMod 𝐼))
11		eqid 2738	. . . 4 ⊢ (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(ℝ_fld freeLMod 𝐼))
12	8, 9, 10, 11	tchnmfval 24392	. . 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 24551	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐻 = (toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
16	15	fveq2d 6778	. 2 ⊢ (𝐼 ∈ 𝑉 → (norm‘𝐻) = (norm‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
17	15	fveq2d 6778	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (Base‘𝐻) = (Base‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
18		rrxbase.b	. . . 4 ⊢ 𝐵 = (Base‘𝐻)
19	8, 10	tcphbas 24383	. . . 4 ⊢ (Base‘(ℝ_fld freeLMod 𝐼)) = (Base‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
20	17, 18, 19	3eqtr4g 2803	. . 3 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = (Base‘(ℝ_fld freeLMod 𝐼)))
21	14, 18	rrxbase 24552	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → 𝐵 = {𝑓 ∈ (ℝ ↑_m 𝐼) ∣ 𝑓 finSupp 0})
22		ssrab2 4013	. . . . . . . 8 ⊢ {𝑓 ∈ (ℝ ↑_m 𝐼) ∣ 𝑓 finSupp 0} ⊆ (ℝ ↑_m 𝐼)
23	21, 22	eqsstrdi 3975	. . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 𝐵 ⊆ (ℝ ↑_m 𝐼))
24	23	sselda 3921	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ (ℝ ↑_m 𝐼))
25	15	fveq2d 6778	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘𝐻) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
26	14, 18	rrxip 24554	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))) = (·_𝑖‘𝐻))
27	8, 11	tcphip 24389	. . . . . . . . . 10 ⊢ (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼)))
28	27	a1i 11	. . . . . . . . 9 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (·_𝑖‘(toℂPreHil‘(ℝ_fld freeLMod 𝐼))))
29	25, 26, 28	3eqtr4rd 2789	. . . . . . . 8 ⊢ (𝐼 ∈ 𝑉 → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))))
30	29	adantr 481	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (·_𝑖‘(ℝ_fld freeLMod 𝐼)) = (ℎ ∈ (ℝ ↑_m 𝐼), 𝑔 ∈ (ℝ ↑_m 𝐼) ↦ (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))))))
31		simprl 768	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → ℎ = 𝑓)
32	31	fveq1d 6776	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (ℎ‘𝑥) = (𝑓‘𝑥))
33		simprr 770	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → 𝑔 = 𝑓)
34	33	fveq1d 6776	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (𝑔‘𝑥) = (𝑓‘𝑥))
35	32, 34	oveq12d 7293	. . . . . . . . . . 11 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
36	35	adantr 481	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
37		elmapi 8637	. . . . . . . . . . . . . . 15 ⊢ (𝑓 ∈ (ℝ ↑_m 𝐼) → 𝑓:𝐼⟶ℝ)
38	37	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → 𝑓:𝐼⟶ℝ)
39	38	ffvelrnda 6961	. . . . . . . . . . . . 13 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℝ)
40	39	recnd 11003	. . . . . . . . . . . 12 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℂ)
41	40	adantlr 712	. . . . . . . . . . 11 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ ℂ)
42	41	sqvald 13861	. . . . . . . . . 10 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥)↑2) = ((𝑓‘𝑥) · (𝑓‘𝑥)))
43	36, 42	eqtr4d 2781	. . . . . . . . 9 ⊢ ((((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) ∧ 𝑥 ∈ 𝐼) → ((ℎ‘𝑥) · (𝑔‘𝑥)) = ((𝑓‘𝑥)↑2))
44	43	mpteq2dva 5174	. . . . . . . 8 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2)))
45	44	oveq2d 7291	. . . . . . 7 ⊢ (((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) ∧ (ℎ = 𝑓 ∧ 𝑔 = 𝑓)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((ℎ‘𝑥) · (𝑔‘𝑥)))) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
46		simpr 485	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → 𝑓 ∈ (ℝ ↑_m 𝐼))
47		ovexd 7310	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))) ∈ V)
48	30, 45, 46, 46, 47	ovmpod 7425	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ (ℝ ↑_m 𝐼)) → (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
49	24, 48	syldan 591	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓) = (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))
50	49	eqcomd 2744	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))) = (𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))
51	50	fveq2d 6778	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑓 ∈ 𝐵) → (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2)))) = (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓)))
52	20, 51	mpteq12dva 5163	. 2 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (𝑓 ∈ (Base‘(ℝ_fld freeLMod 𝐼)) ↦ (√‘(𝑓(·_𝑖‘(ℝ_fld freeLMod 𝐼))𝑓))))
53	13, 16, 52	3eqtr4rd 2789	1 ⊢ (𝐼 ∈ 𝑉 → (𝑓 ∈ 𝐵 ↦ (√‘(ℝ_fld Σ_g (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)↑2))))) = (norm‘𝐻))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {crab 3068 Vcvv 3432 class class class wbr 5074 ↦ cmpt 5157 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 ∈ cmpo 7277 ↑_m cmap 8615 finSupp cfsupp 9128 ℂcc 10869 ℝcr 10870 0cc0 10871 · cmul 10876 2c2 12028 ↑cexp 13782 √csqrt 14944 Basecbs 16912 ·_𝑖cip 16967 Σ_g cgsu 17151 Grpcgrp 18577 Ringcrg 19783 *-Ringcsr 20104 LModclmod 20123 ℝ_fldcrefld 20809 freeLMod cfrlm 20953 normcnm 23732 toℂPreHilctcph 24331 ℝ^crrx 24547

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 ax-addf 10950 ax-mulf 10951

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-tpos 8042 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-ixp 8686 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-sup 9201 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-rp 12731 df-fz 13240 df-seq 13722 df-exp 13783 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-starv 16977 df-sca 16978 df-vsca 16979 df-ip 16980 df-tset 16981 df-ple 16982 df-ds 16984 df-unif 16985 df-hom 16986 df-cco 16987 df-0g 17152 df-prds 17158 df-pws 17160 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-mhm 18430 df-grp 18580 df-minusg 18581 df-sbg 18582 df-subg 18752 df-ghm 18832 df-cmn 19388 df-mgp 19721 df-ur 19738 df-ring 19785 df-cring 19786 df-oppr 19862 df-dvdsr 19883 df-unit 19884 df-invr 19914 df-dvr 19925 df-rnghom 19959 df-drng 19993 df-field 19994 df-subrg 20022 df-staf 20105 df-srng 20106 df-lmod 20125 df-lss 20194 df-sra 20434 df-rgmod 20435 df-cnfld 20598 df-refld 20810 df-dsmm 20939 df-frlm 20954 df-nm 23738 df-tng 23740 df-tcph 24333 df-rrx 24549

This theorem is referenced by: rrxds 24557

W3C validator