| 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 2729 | . . 3 ⊢ (proj‘𝐻) = (proj‘𝐻) | |
| 2 | ishil2.c | . . 3 ⊢ 𝐶 = (ClSubSp‘𝐻) | |
| 3 | 1, 2 | ishil 21603 | . 2 ⊢ (𝐻 ∈ Hil ↔ (𝐻 ∈ PreHil ∧ dom (proj‘𝐻) = 𝐶)) |
| 4 | 1, 2 | pjcss 21601 | . . . . . 6 ⊢ (𝐻 ∈ PreHil → dom (proj‘𝐻) ⊆ 𝐶) |
| 5 | eqss 3959 | . . . . . . 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 3932 | . . . . 5 ⊢ (𝐶 ⊆ dom (proj‘𝐻) ↔ ∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻)) | |
| 9 | 7, 8 | bitrdi 287 | . . . 4 ⊢ (𝐻 ∈ PreHil → (dom (proj‘𝐻) = 𝐶 ↔ ∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻))) |
| 10 | eqid 2729 | . . . . . . 7 ⊢ (LSubSp‘𝐻) = (LSubSp‘𝐻) | |
| 11 | 2, 10 | csslss 21576 | . . . . . 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 21596 | . . . . . . 7 ⊢ (𝐻 ∈ PreHil → (𝑠 ∈ dom (proj‘𝐻) ↔ (𝑠 ∈ (LSubSp‘𝐻) ∧ (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉))) |
| 16 | 15 | baibd 539 | . . . . . 6 ⊢ ((𝐻 ∈ PreHil ∧ 𝑠 ∈ (LSubSp‘𝐻)) → (𝑠 ∈ dom (proj‘𝐻) ↔ (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 17 | 11, 16 | syldan 591 | . . . . 5 ⊢ ((𝐻 ∈ PreHil ∧ 𝑠 ∈ 𝐶) → (𝑠 ∈ dom (proj‘𝐻) ↔ (𝑠 ⊕ ( ⊥ ‘𝑠)) = 𝑉)) |
| 18 | 17 | ralbidva 3154 | . . . 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 1540 ∈ wcel 2109 ∀wral 3044 ⊆ wss 3911 dom cdm 5631 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 LSSumclsm 19540 LSubSpclss 20813 PreHilcphl 21509 ocvcocv 21545 ClSubSpccss 21546 projcpj 21585 Hilchil 21586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-tpos 8182 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-sca 17212 df-vsca 17213 df-ip 17214 df-0g 17380 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-mhm 18686 df-grp 18844 df-minusg 18845 df-sbg 18846 df-subg 19031 df-ghm 19121 df-cntz 19225 df-lsm 19542 df-pj1 19543 df-cmn 19688 df-abl 19689 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-oppr 20222 df-rhm 20357 df-staf 20724 df-srng 20725 df-lmod 20744 df-lss 20814 df-lmhm 20905 df-lvec 20986 df-sra 21056 df-rgmod 21057 df-phl 21511 df-ocv 21548 df-css 21549 df-pj 21588 df-hil 21589 |
| This theorem is referenced by: hlhilhillem 41927 |
| Copyright terms: Public domain | W3C validator |