| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > phlvsca | Structured version Visualization version GIF version | ||
| Description: The scalar product operation of a constructed pre-Hilbert space. (Contributed by Mario Carneiro, 6-Oct-2013.) (Revised by Mario Carneiro, 29-Aug-2015.) |
| Ref | Expression |
|---|---|
| phlfn.h | ⊢ 𝐻 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝑇〉} ∪ {〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) |
| Ref | Expression |
|---|---|
| phlvsca | ⊢ ( · ∈ 𝑋 → · = ( ·𝑠 ‘𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | phlfn.h | . . 3 ⊢ 𝐻 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝑇〉} ∪ {〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) | |
| 2 | 1 | phlstr 17546 | . 2 ⊢ 𝐻 Struct 〈1, 8〉 |
| 3 | vscaid 17520 | . 2 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
| 4 | snsspr1 4773 | . . 3 ⊢ {〈( ·𝑠 ‘ndx), · 〉} ⊆ {〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉} | |
| 5 | ssun2 4180 | . . . 4 ⊢ {〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉} ⊆ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝑇〉} ∪ {〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉}) | |
| 6 | 5, 1 | sseqtrri 3962 | . . 3 ⊢ {〈( ·𝑠 ‘ndx), · 〉, 〈(·𝑖‘ndx), , 〉} ⊆ 𝐻 |
| 7 | 4, 6 | sstri 3922 | . 2 ⊢ {〈( ·𝑠 ‘ndx), · 〉} ⊆ 𝐻 |
| 8 | 2, 3, 7 | strfv 17410 | 1 ⊢ ( · ∈ 𝑋 → · = ( ·𝑠 ‘𝐻)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ∪ cun 4152 {csn 4588 {cpr 4590 {ctp 4592 〈cop 4838 ‘cfv 6558 1c1 11228 8c8 12430 ndxcnx 17400 Basecbs 17416 +gcplusg 17457 Scalarcsca 17460 ·𝑠 cvsca 17461 ·𝑖cip 17462 |
| 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-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| 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-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 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-4 12434 df-5 12435 df-6 12436 df-7 12437 df-8 12438 df-n0 12634 df-z 12721 df-uz 12993 df-fz 13667 df-struct 17354 df-slot 17389 df-ndx 17401 df-base 17417 df-plusg 17470 df-sca 17473 df-vsca 17474 df-ip 17475 |
| This theorem is used by: hlhilvsca 43196 |
| Copyright terms: Public domain | W3C validator |