![]() |
Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HSE Home > Th. List > pjhtheu | Structured version Visualization version GIF version |
Description: Projection Theorem: Any Hilbert space vector 𝐴 can be decomposed uniquely into a member 𝑥 of a closed subspace 𝐻 and a member 𝑦 of the complement of the subspace. Theorem 3.7(i) of [Beran] p. 102. See pjhtheu2 28616 for the uniqueness of 𝑦. (Contributed by NM, 23-Oct-1999.) (Revised by Mario Carneiro, 14-May-2014.) (New usage is discouraged.) |
Ref | Expression |
---|---|
pjhtheu | ⊢ ((𝐻 ∈ Cℋ ∧ 𝐴 ∈ ℋ) → ∃!𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pjhth 28593 | . . . . 5 ⊢ (𝐻 ∈ Cℋ → (𝐻 +ℋ (⊥‘𝐻)) = ℋ) | |
2 | 1 | eleq2d 2834 | . . . 4 ⊢ (𝐻 ∈ Cℋ → (𝐴 ∈ (𝐻 +ℋ (⊥‘𝐻)) ↔ 𝐴 ∈ ℋ)) |
3 | chsh 28422 | . . . . 5 ⊢ (𝐻 ∈ Cℋ → 𝐻 ∈ Sℋ ) | |
4 | shocsh 28484 | . . . . . 6 ⊢ (𝐻 ∈ Sℋ → (⊥‘𝐻) ∈ Sℋ ) | |
5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝐻 ∈ Cℋ → (⊥‘𝐻) ∈ Sℋ ) |
6 | shsel 28514 | . . . . 5 ⊢ ((𝐻 ∈ Sℋ ∧ (⊥‘𝐻) ∈ Sℋ ) → (𝐴 ∈ (𝐻 +ℋ (⊥‘𝐻)) ↔ ∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) | |
7 | 3, 5, 6 | syl2anc 693 | . . . 4 ⊢ (𝐻 ∈ Cℋ → (𝐴 ∈ (𝐻 +ℋ (⊥‘𝐻)) ↔ ∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) |
8 | 2, 7 | bitr3d 270 | . . 3 ⊢ (𝐻 ∈ Cℋ → (𝐴 ∈ ℋ ↔ ∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) |
9 | 8 | biimpa 503 | . 2 ⊢ ((𝐻 ∈ Cℋ ∧ 𝐴 ∈ ℋ) → ∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦)) |
10 | ocin 28496 | . . . . 5 ⊢ (𝐻 ∈ Sℋ → (𝐻 ∩ (⊥‘𝐻)) = 0ℋ) | |
11 | 3, 10 | syl 17 | . . . 4 ⊢ (𝐻 ∈ Cℋ → (𝐻 ∩ (⊥‘𝐻)) = 0ℋ) |
12 | pjhthmo 28502 | . . . 4 ⊢ ((𝐻 ∈ Sℋ ∧ (⊥‘𝐻) ∈ Sℋ ∧ (𝐻 ∩ (⊥‘𝐻)) = 0ℋ) → ∃*𝑥(𝑥 ∈ 𝐻 ∧ ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) | |
13 | 3, 5, 11, 12 | syl3anc 1474 | . . 3 ⊢ (𝐻 ∈ Cℋ → ∃*𝑥(𝑥 ∈ 𝐻 ∧ ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) |
14 | 13 | adantr 473 | . 2 ⊢ ((𝐻 ∈ Cℋ ∧ 𝐴 ∈ ℋ) → ∃*𝑥(𝑥 ∈ 𝐻 ∧ ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) |
15 | reu5 3306 | . . 3 ⊢ (∃!𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ↔ (∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ∧ ∃*𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) | |
16 | df-rmo 3067 | . . . 4 ⊢ (∃*𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ↔ ∃*𝑥(𝑥 ∈ 𝐻 ∧ ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦))) | |
17 | 16 | anbi2i 729 | . . 3 ⊢ ((∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ∧ ∃*𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦)) ↔ (∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ∧ ∃*𝑥(𝑥 ∈ 𝐻 ∧ ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦)))) |
18 | 15, 17 | bitri 264 | . 2 ⊢ (∃!𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ↔ (∃𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦) ∧ ∃*𝑥(𝑥 ∈ 𝐻 ∧ ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦)))) |
19 | 9, 14, 18 | sylanbrc 698 | 1 ⊢ ((𝐻 ∈ Cℋ ∧ 𝐴 ∈ ℋ) → ∃!𝑥 ∈ 𝐻 ∃𝑦 ∈ (⊥‘𝐻)𝐴 = (𝑥 +ℎ 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1629 ∈ wcel 2143 ∃*wmo 2617 ∃wrex 3060 ∃!wreu 3061 ∃*wrmo 3062 ∩ cin 3719 ‘cfv 6030 (class class class)co 6791 ℋchil 28117 +ℎ cva 28118 Sℋ csh 28126 Cℋ cch 28127 ⊥cort 28128 +ℋ cph 28129 0ℋc0h 28133 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1868 ax-4 1883 ax-5 1989 ax-6 2055 ax-7 2091 ax-8 2145 ax-9 2152 ax-10 2172 ax-11 2188 ax-12 2201 ax-13 2406 ax-ext 2749 ax-rep 4901 ax-sep 4911 ax-nul 4919 ax-pow 4970 ax-pr 5033 ax-un 7094 ax-inf2 8700 ax-cc 9457 ax-cnex 10192 ax-resscn 10193 ax-1cn 10194 ax-icn 10195 ax-addcl 10196 ax-addrcl 10197 ax-mulcl 10198 ax-mulrcl 10199 ax-mulcom 10200 ax-addass 10201 ax-mulass 10202 ax-distr 10203 ax-i2m1 10204 ax-1ne0 10205 ax-1rid 10206 ax-rnegex 10207 ax-rrecex 10208 ax-cnre 10209 ax-pre-lttri 10210 ax-pre-lttrn 10211 ax-pre-ltadd 10212 ax-pre-mulgt0 10213 ax-pre-sup 10214 ax-addf 10215 ax-mulf 10216 ax-hilex 28197 ax-hfvadd 28198 ax-hvcom 28199 ax-hvass 28200 ax-hv0cl 28201 ax-hvaddid 28202 ax-hfvmul 28203 ax-hvmulid 28204 ax-hvmulass 28205 ax-hvdistr1 28206 ax-hvdistr2 28207 ax-hvmul0 28208 ax-hfi 28277 ax-his1 28280 ax-his2 28281 ax-his3 28282 ax-his4 28283 ax-hcompl 28400 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1070 df-3an 1071 df-tru 1632 df-ex 1851 df-nf 1856 df-sb 2048 df-eu 2620 df-mo 2621 df-clab 2756 df-cleq 2762 df-clel 2765 df-nfc 2900 df-ne 2942 df-nel 3045 df-ral 3064 df-rex 3065 df-reu 3066 df-rmo 3067 df-rab 3068 df-v 3350 df-sbc 3585 df-csb 3680 df-dif 3723 df-un 3725 df-in 3727 df-ss 3734 df-pss 3736 df-nul 4061 df-if 4223 df-pw 4296 df-sn 4314 df-pr 4316 df-tp 4318 df-op 4320 df-uni 4572 df-int 4609 df-iun 4653 df-iin 4654 df-br 4784 df-opab 4844 df-mpt 4861 df-tr 4884 df-id 5156 df-eprel 5161 df-po 5169 df-so 5170 df-fr 5207 df-se 5208 df-we 5209 df-xp 5254 df-rel 5255 df-cnv 5256 df-co 5257 df-dm 5258 df-rn 5259 df-res 5260 df-ima 5261 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-isom 6039 df-riota 6752 df-ov 6794 df-oprab 6795 df-mpt2 6796 df-om 7211 df-1st 7313 df-2nd 7314 df-wrecs 7557 df-recs 7619 df-rdg 7657 df-1o 7711 df-oadd 7715 df-omul 7716 df-er 7894 df-map 8009 df-pm 8010 df-en 8108 df-dom 8109 df-sdom 8110 df-fin 8111 df-fi 8471 df-sup 8502 df-inf 8503 df-oi 8569 df-card 8963 df-acn 8966 df-pnf 10276 df-mnf 10277 df-xr 10278 df-ltxr 10279 df-le 10280 df-sub 10468 df-neg 10469 df-div 10885 df-nn 11221 df-2 11279 df-3 11280 df-4 11281 df-n0 11493 df-z 11578 df-uz 11888 df-q 11991 df-rp 12035 df-xneg 12150 df-xadd 12151 df-xmul 12152 df-ico 12385 df-icc 12386 df-fz 12533 df-fl 12800 df-seq 13009 df-exp 13068 df-cj 14050 df-re 14051 df-im 14052 df-sqrt 14186 df-abs 14187 df-clim 14430 df-rlim 14431 df-rest 16297 df-topgen 16318 df-psmet 19959 df-xmet 19960 df-met 19961 df-bl 19962 df-mopn 19963 df-fbas 19964 df-fg 19965 df-top 20925 df-topon 20942 df-bases 20977 df-cld 21050 df-ntr 21051 df-cls 21052 df-nei 21129 df-lm 21260 df-haus 21346 df-fil 21876 df-fm 21968 df-flim 21969 df-flf 21970 df-cfil 23278 df-cau 23279 df-cmet 23280 df-grpo 27688 df-gid 27689 df-ginv 27690 df-gdiv 27691 df-ablo 27740 df-vc 27755 df-nv 27788 df-va 27791 df-ba 27792 df-sm 27793 df-0v 27794 df-vs 27795 df-nmcv 27796 df-ims 27797 df-ssp 27918 df-ph 28009 df-cbn 28060 df-hnorm 28166 df-hba 28167 df-hvsub 28169 df-hlim 28170 df-hcau 28171 df-sh 28405 df-ch 28419 df-oc 28450 df-ch0 28451 df-shs 28508 |
This theorem is referenced by: pjhtheu2 28616 |
Copyright terms: Public domain | W3C validator |