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

Theorem rrxip 25766
Description: The inner product of the generalized real Euclidean spaces. (Contributed by Thierry Arnoux, 16-Jun-2019.)
Hypotheses
Ref Expression
rrxval.r 𝐻 = (ℝ^‘𝐼)
rrxbase.b 𝐵 = (Base‘𝐻)
Assertion
Ref Expression
rrxip (𝐼 ∈ 𝑉 → (𝑓 ∈ (ℝ ↑m 𝐼), 𝑔 ∈ (ℝ ↑m 𝐼) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))) = (·𝑖‘𝐻))
Distinct variable groups:   𝑓,𝑔,𝑥,𝐵   𝑓,𝐼,𝑔,𝑥   𝑓,𝑉,𝑔,𝑥
Allowed substitution hints:   𝐻(𝑥, 𝑓, 𝑔)

Proof of Theorem rrxip
StepHypRef Expression
1 rrxval.r . . . 4 𝐻 = (ℝ^‘𝐼)
2 rrxbase.b . . . 4 𝐵 = (Base‘𝐻)
31, 2rrxprds 25765 . . 3 (𝐼 ∈ 𝑉 → 𝐻 = (toℂPreHil‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)))
43fveq2d 6920 . 2 (𝐼 ∈ 𝑉 → (·𝑖‘𝐻) = (·𝑖‘(toℂPreHil‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵))))
5 eqid 2763 . . . 4 (toℂPreHil‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)) = (toℂPreHil‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵))
6 eqid 2763 . . . 4 (·𝑖‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)) = (·𝑖‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵))
75, 6tcphip 25601 . . 3 (·𝑖‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)) = (·𝑖‘(toℂPreHil‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)))
82fvexi 6930 . . . . 5 𝐵 ∈ V
9 eqid 2763 . . . . . 6 ((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵) = ((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)
10 eqid 2763 . . . . . 6 (·𝑖‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (·𝑖‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})))
119, 10ressip 17562 . . . . 5 (𝐵 ∈ V → (·𝑖‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (·𝑖‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)))
128, 11ax-mp 5 . . . 4 (·𝑖‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (·𝑖‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵))
13 eqid 2763 . . . . . 6 (ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) = (ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))
14 refld 21980 . . . . . . 7 ℝfld ∈ Field
1514a1i 11 . . . . . 6 (𝐼 ∈ 𝑉 → ℝfld ∈ Field)
16 snex 5404 . . . . . . 7 {((subringAlg ‘ℝfld)‘ℝ)} ∈ V
17 xpexg 7796 . . . . . . 7 ((𝐼 ∈ 𝑉 ∧ {((subringAlg ‘ℝfld)‘ℝ)} ∈ V) → (𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}) ∈ V)
1816, 17mpan2 704 . . . . . 6 (𝐼 ∈ 𝑉 → (𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}) ∈ V)
19 eqid 2763 . . . . . 6 (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})))
20 fvex 6929 . . . . . . . . 9 ((subringAlg ‘ℝfld)‘ℝ) ∈ V
2120snnz 4739 . . . . . . . 8 {((subringAlg ‘ℝfld)‘ℝ)} ≠ ∅
22 dmxp 5923 . . . . . . . 8 ({((subringAlg ‘ℝfld)‘ℝ)} ≠ ∅ → dom (𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}) = 𝐼)
2321, 22ax-mp 5 . . . . . . 7 dom (𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}) = 𝐼
2423a1i 11 . . . . . 6 (𝐼 ∈ 𝑉 → dom (𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}) = 𝐼)
2513, 15, 18, 19, 24, 10prdsip 17682 . . . . 5 (𝐼 ∈ 𝑉 → (·𝑖‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (𝑓 ∈ (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))), 𝑔 ∈ (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥))(𝑔‘𝑥))))))
2613, 15, 18, 19, 24prdsbas 17678 . . . . . . 7 (𝐼 ∈ 𝑉 → (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)))
27 eqidd 2764 . . . . . . . . . . 11 (𝑥 ∈ 𝐼 → ((subringAlg ‘ℝfld)‘ℝ) = ((subringAlg ‘ℝfld)‘ℝ))
28 rebase 21967 . . . . . . . . . . . . 13 ℝ = (Base‘ℝfld)
2928eqimssi 3973 . . . . . . . . . . . 12 ℝ ⊆ (Base‘ℝfld)
3029a1i 11 . . . . . . . . . . 11 (𝑥 ∈ 𝐼 → ℝ ⊆ (Base‘ℝfld))
3127, 30srabase 21503 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → (Base‘ℝfld) = (Base‘((subringAlg ‘ℝfld)‘ℝ)))
3228a1i 11 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → ℝ = (Base‘ℝfld))
3320fvconst2 7241 . . . . . . . . . . 11 (𝑥 ∈ 𝐼 → ((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥) = ((subringAlg ‘ℝfld)‘ℝ))
3433fveq2d 6920 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)) = (Base‘((subringAlg ‘ℝfld)‘ℝ)))
3531, 32, 343eqtr4rd 2809 . . . . . . . . 9 (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)) = ℝ)
3635adantl 487 . . . . . . . 8 ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ 𝐼) → (Base‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)) = ℝ)
3736ixpeq2dva 8978 . . . . . . 7 (𝐼 ∈ 𝑉 → X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)) = X𝑥 ∈ 𝐼 ℝ)
38 reex 11330 . . . . . . . 8 ℝ ∈ V
39 ixpconstg 8972 . . . . . . . 8 ((𝐼 ∈ 𝑉 ∧ ℝ ∈ V) → X𝑥 ∈ 𝐼 ℝ = (ℝ ↑m 𝐼))
4038, 39mpan2 704 . . . . . . 7 (𝐼 ∈ 𝑉 → X𝑥 ∈ 𝐼 ℝ = (ℝ ↑m 𝐼))
4126, 37, 403eqtrd 2802 . . . . . 6 (𝐼 ∈ 𝑉 → (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (ℝ ↑m 𝐼))
42 remulr 21972 . . . . . . . . . . 11 · = (.r‘ℝfld)
4333, 30sraip 21508 . . . . . . . . . . 11 (𝑥 ∈ 𝐼 → (.r‘ℝfld) = (·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)))
4442, 43eqtr2id 2811 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥)) = · )
4544oveqd 7468 . . . . . . . . 9 (𝑥 ∈ 𝐼 → ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥))(𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑔‘𝑥)))
4645mpteq2ia 5206 . . . . . . . 8 (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))
4746a1i 11 . . . . . . 7 (𝐼 ∈ 𝑉 → (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))
4847oveq2d 7467 . . . . . 6 (𝐼 ∈ 𝑉 → (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥))(𝑔‘𝑥)))) = (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))))
4941, 41, 48mpoeq123dv 7526 . . . . 5 (𝐼 ∈ 𝑉 → (𝑓 ∈ (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))), 𝑔 ∈ (Base‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})‘𝑥))(𝑔‘𝑥))))) = (𝑓 ∈ (ℝ ↑m 𝐼), 𝑔 ∈ (ℝ ↑m 𝐼) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
5025, 49eqtrd 2798 . . . 4 (𝐼 ∈ 𝑉 → (·𝑖‘(ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)}))) = (𝑓 ∈ (ℝ ↑m 𝐼), 𝑔 ∈ (ℝ ↑m 𝐼) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
5112, 50eqtr3id 2812 . . 3 (𝐼 ∈ 𝑉 → (·𝑖‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵)) = (𝑓 ∈ (ℝ ↑m 𝐼), 𝑔 ∈ (ℝ ↑m 𝐼) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
527, 51eqtr3id 2812 . 2 (𝐼 ∈ 𝑉 → (·𝑖‘(toℂPreHil‘((ℝfldXs(𝐼 × {((subringAlg ‘ℝfld)‘ℝ)})) ↾s 𝐵))) = (𝑓 ∈ (ℝ ↑m 𝐼), 𝑔 ∈ (ℝ ↑m 𝐼) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
534, 52eqtr2d 2799 1 (𝐼 ∈ 𝑉 → (𝑓 ∈ (ℝ ↑m 𝐼), 𝑔 ∈ (ℝ ↑m 𝐼) ↦ (ℝfld Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))) = (·𝑖‘𝐻))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  {csn 4588   ↦ cmpt 5192   × cxp 5656  dom cdm 5658  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453   ↑m cmap 8885  Xcixp 8963  ℝcr 11238   · cmul 11244  Basecbs 17431   ↾s cress 17452  .rcmulr 17473  ·𝑖cip 17477   Σg cgsu 17661  Xscprds 17666  Fieldcfield 21032  subringAlg csra 21497  ℝfldcrefld 21965  toℂPreHilctcph 25543  ℝ^crrx 25759
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317  ax-addf 11318  ax-mulf 11319
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-tpos 8281  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-map 8887  df-ixp 8964  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-z 12734  df-dec 12855  df-uz 13006  df-rp 13161  df-fz 13680  df-seq 14185  df-exp 14245  df-cj 15309  df-re 15310  df-im 15311  df-sqrt 15445  df-abs 15446  df-struct 17369  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-mulr 17487  df-starv 17488  df-sca 17489  df-vsca 17490  df-ip 17491  df-tset 17492  df-ple 17493  df-ds 17495  df-unif 17496  df-hom 17497  df-cco 17498  df-euf 17499  df-0g 17662  df-prds 17668  df-pws 17670  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198  df-subg 19383  df-cmn 20047  df-abl 20048  df-mgp 20412  df-rng 20426  df-ur 20459  df-ring 20512  df-cring 20513  df-oppr 20618  df-dvdsr 20638  df-unit 20639  df-invr 20669  df-dvr 20682  df-subrng 20849  df-subrg 20873  df-drng 21033  df-field 21034  df-sra 21499  df-rgmod 21500  df-cnfld 21730  df-refld 21966  df-dsmm 22093  df-frlm 22108  df-tng 24958  df-tcph 25545  df-rrx 25761
This theorem is used by:  rrxnm  25767
  Copyright terms: Public domain W3C validator