| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ishil2 | Structured version Visualization version GIF version | ||
| Description: The predicate "is a Hilbert space" (over a *-division ring). (Contributed by NM, 7-Oct-2011.) (Revised by Mario Carneiro, 22-Jun-2014.) |
| Ref | Expression |
|---|---|
| ishil2.v | ⊢ 𝑉 = (Base‘𝐻) |
| ishil2.s | ⊢ ⊕ = (LSSum‘𝐻) |
| ishil2.o | ⊢ ⊥ = (ocv‘𝐻) |
| ishil2.c | ⊢ 𝐶 = (ClSubSp‘𝐻) |
| Ref | Expression |
|---|---|
| ishil2 | ⊢ (𝐻 ∈ Hil ↔ (𝐻 ∈ PreHil ∧ ∀𝑠 ∈ 𝐶 (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . 3 ⊢ (proj‘𝐻) = (proj‘𝐻) | |
| 2 | ishil2.c | . . 3 ⊢ 𝐶 = (ClSubSp‘𝐻) | |
| 3 | 1, 2 | ishil 21711 | . 2 ⊢ (𝐻 ∈ Hil ↔ (𝐻 ∈ PreHil ∧ dom (proj‘𝐻) = 𝐶)) |
| 4 | 1, 2 | pjcss 21709 | . . . . . 6 ⊢ (𝐻 ∈ PreHil → dom (proj‘𝐻) ⊆ 𝐶) |
| 5 | eqss 3938 | . . . . . . 7 ⊢ (dom (proj‘𝐻) = 𝐶 ↔ (dom (proj‘𝐻) ⊆ 𝐶 ∧ 𝐶 ⊆ dom (proj‘𝐻))) | |
| 6 | 5 | baib 535 | . . . . . 6 ⊢ (dom (proj‘𝐻) ⊆ 𝐶 → (dom (proj‘𝐻) = 𝐶 ↔ 𝐶 ⊆ dom (proj‘𝐻))) |
| 7 | 4, 6 | syl 17 | . . . . 5 ⊢ (𝐻 ∈ PreHil → (dom (proj‘𝐻) = 𝐶 ↔ 𝐶 ⊆ dom (proj‘𝐻))) |
| 8 | dfss3 3911 | . . . . 5 ⊢ (𝐶 ⊆ dom (proj‘𝐻) ↔ ∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻)) | |
| 9 | 7, 8 | bitrdi 287 | . . . 4 ⊢ (𝐻 ∈ PreHil → (dom (proj‘𝐻) = 𝐶 ↔ ∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻))) |
| 10 | eqid 2737 | . . . . . . 7 ⊢ (LSubSp‘𝐻) = (LSubSp‘𝐻) | |
| 11 | 2, 10 | csslss 21684 | . . . . . 6 ⊢ ((𝐻 ∈ PreHil ∧ 𝑠 ∈ 𝐶) → 𝑠 ∈ (LSubSp‘𝐻)) |
| 12 | ishil2.v | . . . . . . . 8 ⊢ 𝑉 = (Base‘𝐻) | |
| 13 | ishil2.o | . . . . . . . 8 ⊢ ⊥ = (ocv‘𝐻) | |
| 14 | ishil2.s | . . . . . . . 8 ⊢ ⊕ = (LSSum‘𝐻) | |
| 15 | 12, 10, 13, 14, 1 | pjdm2 21704 | . . . . . . 7 ⊢ (𝐻 ∈ PreHil → (𝑠 ∈ dom (proj‘𝐻) ↔ (𝑠 ∈ (LSubSp‘𝐻) ∧ (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉))) |
| 16 | 15 | baibd 539 | . . . . . 6 ⊢ ((𝐻 ∈ PreHil ∧ 𝑠 ∈ (LSubSp‘𝐻)) → (𝑠 ∈ dom (proj‘𝐻) ↔ (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 17 | 11, 16 | syldan 592 | . . . . 5 ⊢ ((𝐻 ∈ PreHil ∧ 𝑠 ∈ 𝐶) → (𝑠 ∈ dom (proj‘𝐻) ↔ (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 18 | 17 | ralbidva 3159 | . . . 4 ⊢ (𝐻 ∈ PreHil → (∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻) ↔ ∀𝑠 ∈ 𝐶 (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 19 | 9, 18 | bitrd 279 | . . 3 ⊢ (𝐻 ∈ PreHil → (dom (proj‘𝐻) = 𝐶 ↔ ∀𝑠 ∈ 𝐶 (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 20 | 19 | pm5.32i 574 | . 2 ⊢ ((𝐻 ∈ PreHil ∧ dom (proj‘𝐻) = 𝐶) ↔ (𝐻 ∈ PreHil ∧ ∀𝑠 ∈ 𝐶 (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 21 | 3, 20 | bitri 275 | 1 ⊢ (𝐻 ∈ Hil ↔ (𝐻 ∈ PreHil ∧ ∀𝑠 ∈ 𝐶 (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ⊆ wss 3890 dom cdm 5625 ‘cfv 6493 (class class class)co 7361 Basecbs 17173 LSSumclsm 19603 LSubSpclss 20920 PreHilcphl 21617 ocvcocv 21653 ClSubSpccss 21654 projcpj 21693 Hilchil 21694 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-tpos 8170 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-ress 17195 df-plusg 17227 df-mulr 17228 df-sca 17230 df-vsca 17231 df-ip 17232 df-0g 17398 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-mhm 18745 df-grp 18906 df-minusg 18907 df-sbg 18908 df-subg 19093 df-ghm 19182 df-cntz 19286 df-lsm 19605 df-pj1 19606 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-oppr 20311 df-rhm 20446 df-staf 20810 df-srng 20811 df-lmod 20851 df-lss 20921 df-lmhm 21012 df-lvec 21093 df-sra 21163 df-rgmod 21164 df-phl 21619 df-ocv 21656 df-css 21657 df-pj 21696 df-hil 21697 |
| This theorem is referenced by: hlhilhillem 42423 |
| Copyright terms: Public domain | W3C validator |