Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rrxvsca | Structured version Visualization version GIF version |
Description: The scalar product over generalized Euclidean spaces is the componentwise real number multiplication. (Contributed by Thierry Arnoux, 18-Jan-2023.) |
Ref | Expression |
---|---|
rrxval.r | ⊢ 𝐻 = (ℝ^‘𝐼) |
rrxbase.b | ⊢ 𝐵 = (Base‘𝐻) |
rrxvsca.r | ⊢ ∙ = ( ·𝑠 ‘𝐻) |
rrxvsca.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
rrxvsca.j | ⊢ (𝜑 → 𝐽 ∈ 𝐼) |
rrxvsca.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
rrxvsca.x | ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐻)) |
Ref | Expression |
---|---|
rrxvsca | ⊢ (𝜑 → ((𝐴 ∙ 𝑋)‘𝐽) = (𝐴 · (𝑋‘𝐽))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rrxvsca.r | . . . . 5 ⊢ ∙ = ( ·𝑠 ‘𝐻) | |
2 | rrxvsca.i | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
3 | rrxval.r | . . . . . . . 8 ⊢ 𝐻 = (ℝ^‘𝐼) | |
4 | 3 | rrxval 23992 | . . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 𝐻 = (toℂPreHil‘(ℝfld freeLMod 𝐼))) |
5 | 2, 4 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐻 = (toℂPreHil‘(ℝfld freeLMod 𝐼))) |
6 | 5 | fveq2d 6676 | . . . . 5 ⊢ (𝜑 → ( ·𝑠 ‘𝐻) = ( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼)))) |
7 | 1, 6 | syl5eq 2870 | . . . 4 ⊢ (𝜑 → ∙ = ( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼)))) |
8 | 7 | oveqd 7175 | . . 3 ⊢ (𝜑 → (𝐴 ∙ 𝑋) = (𝐴( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼)))𝑋)) |
9 | 8 | fveq1d 6674 | . 2 ⊢ (𝜑 → ((𝐴 ∙ 𝑋)‘𝐽) = ((𝐴( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼)))𝑋)‘𝐽)) |
10 | eqid 2823 | . . 3 ⊢ (ℝfld freeLMod 𝐼) = (ℝfld freeLMod 𝐼) | |
11 | eqid 2823 | . . 3 ⊢ (Base‘(ℝfld freeLMod 𝐼)) = (Base‘(ℝfld freeLMod 𝐼)) | |
12 | rebase 20752 | . . 3 ⊢ ℝ = (Base‘ℝfld) | |
13 | rrxvsca.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
14 | rrxvsca.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐻)) | |
15 | 5 | fveq2d 6676 | . . . . 5 ⊢ (𝜑 → (Base‘𝐻) = (Base‘(toℂPreHil‘(ℝfld freeLMod 𝐼)))) |
16 | eqid 2823 | . . . . . 6 ⊢ (toℂPreHil‘(ℝfld freeLMod 𝐼)) = (toℂPreHil‘(ℝfld freeLMod 𝐼)) | |
17 | 16, 11 | tcphbas 23824 | . . . . 5 ⊢ (Base‘(ℝfld freeLMod 𝐼)) = (Base‘(toℂPreHil‘(ℝfld freeLMod 𝐼))) |
18 | 15, 17 | syl6eqr 2876 | . . . 4 ⊢ (𝜑 → (Base‘𝐻) = (Base‘(ℝfld freeLMod 𝐼))) |
19 | 14, 18 | eleqtrd 2917 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘(ℝfld freeLMod 𝐼))) |
20 | rrxvsca.j | . . 3 ⊢ (𝜑 → 𝐽 ∈ 𝐼) | |
21 | eqid 2823 | . . . . 5 ⊢ ( ·𝑠 ‘(ℝfld freeLMod 𝐼)) = ( ·𝑠 ‘(ℝfld freeLMod 𝐼)) | |
22 | 16, 21 | tcphvsca 23829 | . . . 4 ⊢ ( ·𝑠 ‘(ℝfld freeLMod 𝐼)) = ( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼))) |
23 | 22 | eqcomi 2832 | . . 3 ⊢ ( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼))) = ( ·𝑠 ‘(ℝfld freeLMod 𝐼)) |
24 | remulr 20757 | . . 3 ⊢ · = (.r‘ℝfld) | |
25 | 10, 11, 12, 2, 13, 19, 20, 23, 24 | frlmvscaval 20914 | . 2 ⊢ (𝜑 → ((𝐴( ·𝑠 ‘(toℂPreHil‘(ℝfld freeLMod 𝐼)))𝑋)‘𝐽) = (𝐴 · (𝑋‘𝐽))) |
26 | 9, 25 | eqtrd 2858 | 1 ⊢ (𝜑 → ((𝐴 ∙ 𝑋)‘𝐽) = (𝐴 · (𝑋‘𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ‘cfv 6357 (class class class)co 7158 ℝcr 10538 · cmul 10544 Basecbs 16485 ·𝑠 cvsca 16571 ℝfldcrefld 20750 freeLMod cfrlm 20892 toℂPreHilctcph 23773 ℝ^crrx 23988 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 ax-mulf 10619 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-of 7411 df-om 7583 df-1st 7691 df-2nd 7692 df-supp 7833 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-ixp 8464 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fsupp 8836 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-rp 12393 df-fz 12896 df-seq 13373 df-exp 13433 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-starv 16582 df-sca 16583 df-vsca 16584 df-ip 16585 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-hom 16591 df-cco 16592 df-0g 16717 df-prds 16723 df-pws 16725 df-sra 19946 df-rgmod 19947 df-cnfld 20548 df-refld 20751 df-dsmm 20878 df-frlm 20893 df-tng 23196 df-tcph 23775 df-rrx 23990 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |