| 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 2736 | . . 3 ⊢ (proj‘𝐻) = (proj‘𝐻) | |
| 2 | ishil2.c | . . 3 ⊢ 𝐶 = (ClSubSp‘𝐻) | |
| 3 | 1, 2 | ishil 21698 | . 2 ⊢ (𝐻 ∈ Hil ↔ (𝐻 ∈ PreHil ∧ dom (proj‘𝐻) = 𝐶)) |
| 4 | 1, 2 | pjcss 21696 | . . . . . 6 ⊢ (𝐻 ∈ PreHil → dom (proj‘𝐻) ⊆ 𝐶) |
| 5 | eqss 3937 | . . . . . . 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 3910 | . . . . 5 ⊢ (𝐶 ⊆ dom (proj‘𝐻) ↔ ∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻)) | |
| 9 | 7, 8 | bitrdi 287 | . . . 4 ⊢ (𝐻 ∈ PreHil → (dom (proj‘𝐻) = 𝐶 ↔ ∀𝑠 ∈ 𝐶 𝑠 ∈ dom (proj‘𝐻))) |
| 10 | eqid 2736 | . . . . . . 7 ⊢ (LSubSp‘𝐻) = (LSubSp‘𝐻) | |
| 11 | 2, 10 | csslss 21671 | . . . . . 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 21691 | . . . . . . 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 3158 | . . . 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 3051 ⊆ wss 3889 dom cdm 5631 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 LSSumclsm 19609 LSubSpclss 20926 PreHilcphl 21604 ocvcocv 21640 ClSubSpccss 21641 projcpj 21680 Hilchil 21681 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 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 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-tpos 8176 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-mhm 18751 df-grp 18912 df-minusg 18913 df-sbg 18914 df-subg 19099 df-ghm 19188 df-cntz 19292 df-lsm 19611 df-pj1 19612 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-oppr 20317 df-rhm 20452 df-staf 20816 df-srng 20817 df-lmod 20857 df-lss 20927 df-lmhm 21017 df-lvec 21098 df-sra 21168 df-rgmod 21169 df-phl 21606 df-ocv 21643 df-css 21644 df-pj 21683 df-hil 21684 |
| This theorem is referenced by: hlhilhillem 42406 |
| Copyright terms: Public domain | W3C validator |