Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > nmcoplb | Structured version Visualization version GIF version |
Description: A lower bound for the norm of a continuous linear Hilbert space operator. Theorem 3.5(ii) of [Beran] p. 99. (Contributed by NM, 7-Feb-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nmcoplb | ⊢ ((𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3899 | . . 3 ⊢ (𝑇 ∈ (LinOp ∩ ContOp) ↔ (𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp)) | |
2 | fveq1 6755 | . . . . . . . 8 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → (𝑇‘𝐴) = (if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) | |
3 | 2 | fveq2d 6760 | . . . . . . 7 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → (normℎ‘(𝑇‘𝐴)) = (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴))) |
4 | fveq2 6756 | . . . . . . . 8 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → (normop‘𝑇) = (normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)))) | |
5 | 4 | oveq1d 7270 | . . . . . . 7 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → ((normop‘𝑇) · (normℎ‘𝐴)) = ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴))) |
6 | 3, 5 | breq12d 5083 | . . . . . 6 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → ((normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴)) ↔ (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) ≤ ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴)))) |
7 | 6 | imbi2d 340 | . . . . 5 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → ((𝐴 ∈ ℋ → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) ↔ (𝐴 ∈ ℋ → (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) ≤ ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴))))) |
8 | idlnop 30255 | . . . . . . . . . 10 ⊢ ( I ↾ ℋ) ∈ LinOp | |
9 | idcnop 30244 | . . . . . . . . . 10 ⊢ ( I ↾ ℋ) ∈ ContOp | |
10 | elin 3899 | . . . . . . . . . 10 ⊢ (( I ↾ ℋ) ∈ (LinOp ∩ ContOp) ↔ (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ) ∈ ContOp)) | |
11 | 8, 9, 10 | mpbir2an 707 | . . . . . . . . 9 ⊢ ( I ↾ ℋ) ∈ (LinOp ∩ ContOp) |
12 | 11 | elimel 4525 | . . . . . . . 8 ⊢ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ (LinOp ∩ ContOp) |
13 | elin 3899 | . . . . . . . 8 ⊢ (if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ (LinOp ∩ ContOp) ↔ (if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ ContOp)) | |
14 | 12, 13 | mpbi 229 | . . . . . . 7 ⊢ (if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ ContOp) |
15 | 14 | simpli 483 | . . . . . 6 ⊢ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ LinOp |
16 | 14 | simpri 485 | . . . . . 6 ⊢ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ ContOp |
17 | 15, 16 | nmcoplbi 30291 | . . . . 5 ⊢ (𝐴 ∈ ℋ → (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) ≤ ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴))) |
18 | 7, 17 | dedth 4514 | . . . 4 ⊢ (𝑇 ∈ (LinOp ∩ ContOp) → (𝐴 ∈ ℋ → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴)))) |
19 | 18 | imp 406 | . . 3 ⊢ ((𝑇 ∈ (LinOp ∩ ContOp) ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
20 | 1, 19 | sylanbr 581 | . 2 ⊢ (((𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp) ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
21 | 20 | 3impa 1108 | 1 ⊢ ((𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ∩ cin 3882 ifcif 4456 class class class wbr 5070 I cid 5479 ↾ cres 5582 ‘cfv 6418 (class class class)co 7255 · cmul 10807 ≤ cle 10941 ℋchba 29182 normℎcno 29186 normopcnop 29208 ContOpccop 29209 LinOpclo 29210 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-hilex 29262 ax-hfvadd 29263 ax-hvcom 29264 ax-hvass 29265 ax-hv0cl 29266 ax-hvaddid 29267 ax-hfvmul 29268 ax-hvmulid 29269 ax-hvmulass 29270 ax-hvdistr1 29271 ax-hvdistr2 29272 ax-hvmul0 29273 ax-hfi 29342 ax-his1 29345 ax-his2 29346 ax-his3 29347 ax-his4 29348 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-map 8575 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-grpo 28756 df-gid 28757 df-ablo 28808 df-vc 28822 df-nv 28855 df-va 28858 df-ba 28859 df-sm 28860 df-0v 28861 df-nmcv 28863 df-hnorm 29231 df-hba 29232 df-hvsub 29234 df-nmop 30102 df-cnop 30103 df-lnop 30104 df-unop 30106 |
This theorem is referenced by: lnopconi 30297 |
Copyright terms: Public domain | W3C validator |