| 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 2765 | . . . 4 ⊢ (Base‘𝑋) = (Base‘𝑋) | |
| 2 | eqid 2765 | . . . 4 ⊢ (·𝑖‘𝑋) = (·𝑖‘𝑋) | |
| 3 | phssip.p | . . . 4 ⊢ 𝑃 = (·if‘𝑋) | |
| 4 | 1, 2, 3 | ipffval 21848 | . . 3 ⊢ 𝑃 = (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑋)𝑦)) |
| 5 | phllmod 21830 | . . . . . . 7 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
| 6 | phssip.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 7 | 6 | lsssubg 21128 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 8 | 5, 7 | sylan 592 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 9 | phssip.x | . . . . . . 7 ⊢ 𝑋 = (𝑊 ↾s 𝑈) | |
| 10 | 9 | subgbas 19240 | . . . . . 6 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 = (Base‘𝑋)) |
| 11 | 8, 10 | syl 18 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑈 = (Base‘𝑋)) |
| 12 | eqidd 2766 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥(·𝑖‘𝑊)𝑦) = (𝑥(·𝑖‘𝑊)𝑦)) | |
| 13 | 11, 11, 12 | mpoeq123dv 7494 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑥(·𝑖‘𝑊)𝑦)) = (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
| 14 | eqid 2765 | . . . . . . 7 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 15 | 14 | subgss 19237 | . . . . . 6 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 ⊆ (Base‘𝑊)) |
| 16 | 8, 15 | syl 18 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) |
| 17 | resmpo 7539 | . . . . 5 ⊢ ((𝑈 ⊆ (Base‘𝑊) ∧ 𝑈 ⊆ (Base‘𝑊)) → ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑥(·𝑖‘𝑊)𝑦))) | |
| 18 | 16, 16, 17 | syl2anc 596 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
| 19 | eqid 2765 | . . . . . . . 8 ⊢ (·𝑖‘𝑊) = (·𝑖‘𝑊) | |
| 20 | 9, 19, 2 | ssipeq 21856 | . . . . . . 7 ⊢ (𝑈 ∈ 𝑆 → (·𝑖‘𝑋) = (·𝑖‘𝑊)) |
| 21 | 20 | adantl 487 | . . . . . 6 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (·𝑖‘𝑋) = (·𝑖‘𝑊)) |
| 22 | 21 | oveqd 7436 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥(·𝑖‘𝑋)𝑦) = (𝑥(·𝑖‘𝑊)𝑦)) |
| 23 | 22 | mpoeq3dv 7498 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑋)𝑦)) = (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
| 24 | 13, 18, 23 | 3eqtr4rd 2811 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ (Base‘𝑋), 𝑦 ∈ (Base‘𝑋) ↦ (𝑥(·𝑖‘𝑋)𝑦)) = ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈))) |
| 25 | 4, 24 | eqtrid 2812 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑃 = ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈))) |
| 26 | phssip.i | . . . . 5 ⊢ · = (·if‘𝑊) | |
| 27 | 14, 19, 26 | ipffval 21848 | . . . 4 ⊢ · = (𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) |
| 28 | 27 | a1i 11 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → · = (𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦))) |
| 29 | 28 | reseq1d 5979 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → ( · ↾ (𝑈 × 𝑈)) = ((𝑥 ∈ (Base‘𝑊), 𝑦 ∈ (Base‘𝑊) ↦ (𝑥(·𝑖‘𝑊)𝑦)) ↾ (𝑈 × 𝑈))) |
| 30 | 25, 29 | eqtr4d 2803 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑈 ∈ 𝑆) → 𝑃 = ( · ↾ (𝑈 × 𝑈))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 × cxp 5661 ↾ cres 5665 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 Basecbs 17291 ↾s cress 17312 ·𝑖cip 17337 SubGrpcsubg 19230 LModclmod 21031 LSubSpclss 21102 PreHilcphl 21824 ·ifcipf 21825 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-3 12319 df-4 12320 df-5 12321 df-6 12322 df-7 12323 df-8 12324 df-sets 17246 df-slot 17264 df-ndx 17276 df-base 17292 df-ress 17313 df-plusg 17345 df-ip 17350 df-0g 17516 df-mgm 18720 df-sgrp 18809 df-mnd 18825 df-grp 19047 df-minusg 19048 df-sbg 19049 df-subg 19233 df-mgp 20261 df-ur 20308 df-ring 20361 df-lmod 21033 df-lss 21103 df-lvec 21274 df-phl 21826 df-ipf 21827 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |