![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > phssip | Structured version Visualization version GIF version |
Description: The inner product (as a function) on a subspace is a restriction of the inner product (as a function) on the parent space. (Contributed by NM, 28-Jan-2008.) (Revised by AV, 19-Oct-2021.) |
Ref | Expression |
---|---|
phssip.x | ⊢ 𝑋 = (𝑊 ↾s 𝑈) |
phssip.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
phssip.i | ⊢ · = (·if‘𝑊) |
phssip.p | ⊢ 𝑃 = (·if‘𝑋) |
Ref | Expression |
---|---|
phssip | ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑃 = ( · ↾ (𝑈 × 𝑈))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2778 | . . . 4 ⊢ (Base‘𝑋) = (Base‘𝑋) | |
2 | eqid 2778 | . . . 4 ⊢ (·𝑖‘𝑋) = (·𝑖‘𝑋) | |
3 | phssip.p | . . . 4 ⊢ 𝑃 = (·if‘𝑋) | |
4 | 1, 2, 3 | ipffval 20391 | . . 3 ⊢ 𝑃 = (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑋)𝑦)) |
5 | phllmod 20373 | . . . . . . 7 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
6 | phssip.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
7 | 6 | lsssubg 19352 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
8 | 5, 7 | sylan 575 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
9 | phssip.x | . . . . . . 7 ⊢ 𝑋 = (𝑊 ↾s 𝑈) | |
10 | 9 | subgbas 17982 | . . . . . 6 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 = (Base‘𝑋)) |
11 | 8, 10 | syl 17 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑈 = (Base‘𝑋)) |
12 | eqidd 2779 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥(·𝑖‘𝑊)𝑦) = (𝑥(·𝑖‘𝑊)𝑦)) | |
13 | 11, 11, 12 | mpt2eq123dv 6994 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑥(·𝑖‘𝑊)𝑦)) = (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
14 | eqid 2778 | . . . . . . 7 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
15 | 14 | subgss 17979 | . . . . . 6 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 ⊆ (Base‘𝑊)) |
16 | 8, 15 | syl 17 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) |
17 | resmpt2 7035 | . . . . 5 ⊢ ((𝑈 ⊆ (Base‘𝑊) ∧ 𝑈 ⊆ (Base‘𝑊)) → ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑥(·𝑖‘𝑊)𝑦))) | |
18 | 16, 16, 17 | syl2anc 579 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
19 | eqid 2778 | . . . . . . . 8 ⊢ (·𝑖‘𝑊) = (·𝑖‘𝑊) | |
20 | 9, 19, 2 | ssipeq 20399 | . . . . . . 7 ⊢ (𝑈 ∈ 𝑆 → (·𝑖‘𝑋) = (·𝑖‘𝑊)) |
21 | 20 | adantl 475 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (·𝑖‘𝑋) = (·𝑖‘𝑊)) |
22 | 21 | oveqd 6939 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥(·𝑖‘𝑋)𝑦) = (𝑥(·𝑖‘𝑊)𝑦)) |
23 | 22 | mpt2eq3dv 6998 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑋)𝑦)) = (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
24 | 13, 18, 23 | 3eqtr4rd 2825 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑋)𝑦)) = ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈))) |
25 | 4, 24 | syl5eq 2826 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑃 = ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈))) |
26 | phssip.i | . . . . 5 ⊢ · = (·if‘𝑊) | |
27 | 14, 19, 26 | ipffval 20391 | . . . 4 ⊢ · = (𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) |
28 | 27 | a1i 11 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → · = (𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
29 | 28 | reseq1d 5641 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → ( · ↾ (𝑈 × 𝑈)) = ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈))) |
30 | 25, 29 | eqtr4d 2817 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑃 = ( · ↾ (𝑈 × 𝑈))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 = wceq 1601 ∈ wcel 2107 ⊆ wss 3792 × cxp 5353 ↾ cres 5357 ‘cfv 6135 (class class class)co 6922 ↦ cmpt2 6924 Basecbs 16255 ↾s cress 16256 ·𝑖cip 16343 SubGrpcsubg 17972 LModclmod 19255 LSubSpclss 19324 PreHilcphl 20367 ·ifcipf 20368 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5006 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 ax-cnex 10328 ax-resscn 10329 ax-1cn 10330 ax-icn 10331 ax-addcl 10332 ax-addrcl 10333 ax-mulcl 10334 ax-mulrcl 10335 ax-mulcom 10336 ax-addass 10337 ax-mulass 10338 ax-distr 10339 ax-i2m1 10340 ax-1ne0 10341 ax-1rid 10342 ax-rnegex 10343 ax-rrecex 10344 ax-cnre 10345 ax-pre-lttri 10346 ax-pre-lttrn 10347 ax-pre-ltadd 10348 ax-pre-mulgt0 10349 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4672 df-iun 4755 df-br 4887 df-opab 4949 df-mpt 4966 df-tr 4988 df-id 5261 df-eprel 5266 df-po 5274 df-so 5275 df-fr 5314 df-we 5316 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-pred 5933 df-ord 5979 df-on 5980 df-lim 5981 df-suc 5982 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-riota 6883 df-ov 6925 df-oprab 6926 df-mpt2 6927 df-om 7344 df-1st 7445 df-2nd 7446 df-wrecs 7689 df-recs 7751 df-rdg 7789 df-er 8026 df-en 8242 df-dom 8243 df-sdom 8244 df-pnf 10413 df-mnf 10414 df-xr 10415 df-ltxr 10416 df-le 10417 df-sub 10608 df-neg 10609 df-nn 11375 df-2 11438 df-3 11439 df-4 11440 df-5 11441 df-6 11442 df-7 11443 df-8 11444 df-ndx 16258 df-slot 16259 df-base 16261 df-sets 16262 df-ress 16263 df-plusg 16351 df-ip 16356 df-0g 16488 df-mgm 17628 df-sgrp 17670 df-mnd 17681 df-grp 17812 df-minusg 17813 df-sbg 17814 df-subg 17975 df-mgp 18877 df-ur 18889 df-ring 18936 df-lmod 19257 df-lss 19325 df-lvec 19498 df-phl 20369 df-ipf 20370 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |