![]() |
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 3960 | . . 3 ⊢ (𝑇 ∈ (LinOp ∩ ContOp) ↔ (𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp)) | |
2 | fveq1 6895 | . . . . . . . 8 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → (𝑇‘𝐴) = (if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) | |
3 | 2 | fveq2d 6900 | . . . . . . 7 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → (normℎ‘(𝑇‘𝐴)) = (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴))) |
4 | fveq2 6896 | . . . . . . . 8 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → (normop‘𝑇) = (normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)))) | |
5 | 4 | oveq1d 7434 | . . . . . . 7 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → ((normop‘𝑇) · (normℎ‘𝐴)) = ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴))) |
6 | 3, 5 | breq12d 5162 | . . . . . 6 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → ((normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴)) ↔ (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) ≤ ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴)))) |
7 | 6 | imbi2d 339 | . . . . 5 ⊢ (𝑇 = if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) → ((𝐴 ∈ ℋ → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) ↔ (𝐴 ∈ ℋ → (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) ≤ ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴))))) |
8 | idlnop 31879 | . . . . . . . . . 10 ⊢ ( I ↾ ℋ) ∈ LinOp | |
9 | idcnop 31868 | . . . . . . . . . 10 ⊢ ( I ↾ ℋ) ∈ ContOp | |
10 | elin 3960 | . . . . . . . . . 10 ⊢ (( I ↾ ℋ) ∈ (LinOp ∩ ContOp) ↔ (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ) ∈ ContOp)) | |
11 | 8, 9, 10 | mpbir2an 709 | . . . . . . . . 9 ⊢ ( I ↾ ℋ) ∈ (LinOp ∩ ContOp) |
12 | 11 | elimel 4599 | . . . . . . . 8 ⊢ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ (LinOp ∩ ContOp) |
13 | elin 3960 | . . . . . . . 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 482 | . . . . . 6 ⊢ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ LinOp |
16 | 14 | simpri 484 | . . . . . 6 ⊢ if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ)) ∈ ContOp |
17 | 15, 16 | nmcoplbi 31915 | . . . . 5 ⊢ (𝐴 ∈ ℋ → (normℎ‘(if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))‘𝐴)) ≤ ((normop‘if(𝑇 ∈ (LinOp ∩ ContOp), 𝑇, ( I ↾ ℋ))) · (normℎ‘𝐴))) |
18 | 7, 17 | dedth 4588 | . . . 4 ⊢ (𝑇 ∈ (LinOp ∩ ContOp) → (𝐴 ∈ ℋ → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴)))) |
19 | 18 | imp 405 | . . 3 ⊢ ((𝑇 ∈ (LinOp ∩ ContOp) ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
20 | 1, 19 | sylanbr 580 | . 2 ⊢ (((𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp) ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
21 | 20 | 3impa 1107 | 1 ⊢ ((𝑇 ∈ LinOp ∧ 𝑇 ∈ ContOp ∧ 𝐴 ∈ ℋ) → (normℎ‘(𝑇‘𝐴)) ≤ ((normop‘𝑇) · (normℎ‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∩ cin 3943 ifcif 4530 class class class wbr 5149 I cid 5575 ↾ cres 5680 ‘cfv 6549 (class class class)co 7419 · cmul 11150 ≤ cle 11286 ℋchba 30806 normℎcno 30810 normopcnop 30832 ContOpccop 30833 LinOpclo 30834 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11201 ax-resscn 11202 ax-1cn 11203 ax-icn 11204 ax-addcl 11205 ax-addrcl 11206 ax-mulcl 11207 ax-mulrcl 11208 ax-mulcom 11209 ax-addass 11210 ax-mulass 11211 ax-distr 11212 ax-i2m1 11213 ax-1ne0 11214 ax-1rid 11215 ax-rnegex 11216 ax-rrecex 11217 ax-cnre 11218 ax-pre-lttri 11219 ax-pre-lttrn 11220 ax-pre-ltadd 11221 ax-pre-mulgt0 11222 ax-pre-sup 11223 ax-hilex 30886 ax-hfvadd 30887 ax-hvcom 30888 ax-hvass 30889 ax-hv0cl 30890 ax-hvaddid 30891 ax-hfvmul 30892 ax-hvmulid 30893 ax-hvmulass 30894 ax-hvdistr1 30895 ax-hvdistr2 30896 ax-hvmul0 30897 ax-hfi 30966 ax-his1 30969 ax-his2 30970 ax-his3 30971 ax-his4 30972 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-map 8847 df-en 8965 df-dom 8966 df-sdom 8967 df-sup 9472 df-pnf 11287 df-mnf 11288 df-xr 11289 df-ltxr 11290 df-le 11291 df-sub 11483 df-neg 11484 df-div 11909 df-nn 12251 df-2 12313 df-3 12314 df-4 12315 df-n0 12511 df-z 12597 df-uz 12861 df-rp 13015 df-seq 14008 df-exp 14068 df-cj 15087 df-re 15088 df-im 15089 df-sqrt 15223 df-abs 15224 df-grpo 30380 df-gid 30381 df-ablo 30432 df-vc 30446 df-nv 30479 df-va 30482 df-ba 30483 df-sm 30484 df-0v 30485 df-nmcv 30487 df-hnorm 30855 df-hba 30856 df-hvsub 30858 df-nmop 31726 df-cnop 31727 df-lnop 31728 df-unop 31730 |
This theorem is referenced by: lnopconi 31921 |
Copyright terms: Public domain | W3C validator |