Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nmblolbi | Structured version Visualization version GIF version |
Description: A lower bound for the norm of a bounded linear operator. (Contributed by NM, 10-Dec-2007.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nmblolbi.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
nmblolbi.4 | ⊢ 𝐿 = (normCV‘𝑈) |
nmblolbi.5 | ⊢ 𝑀 = (normCV‘𝑊) |
nmblolbi.6 | ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) |
nmblolbi.7 | ⊢ 𝐵 = (𝑈 BLnOp 𝑊) |
nmblolbi.u | ⊢ 𝑈 ∈ NrmCVec |
nmblolbi.w | ⊢ 𝑊 ∈ NrmCVec |
Ref | Expression |
---|---|
nmblolbi | ⊢ ((𝑇 ∈ 𝐵 ∧ 𝐴 ∈ 𝑋) → (𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq1 6773 | . . . . . 6 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → (𝑇‘𝐴) = (if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) | |
2 | 1 | fveq2d 6778 | . . . . 5 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → (𝑀‘(𝑇‘𝐴)) = (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴))) |
3 | fveq2 6774 | . . . . . 6 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → (𝑁‘𝑇) = (𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)))) | |
4 | 3 | oveq1d 7290 | . . . . 5 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → ((𝑁‘𝑇) · (𝐿‘𝐴)) = ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴))) |
5 | 2, 4 | breq12d 5087 | . . . 4 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → ((𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴)) ↔ (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) ≤ ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴)))) |
6 | 5 | imbi2d 341 | . . 3 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → ((𝐴 ∈ 𝑋 → (𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴))) ↔ (𝐴 ∈ 𝑋 → (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) ≤ ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴))))) |
7 | nmblolbi.1 | . . . 4 ⊢ 𝑋 = (BaseSet‘𝑈) | |
8 | nmblolbi.4 | . . . 4 ⊢ 𝐿 = (normCV‘𝑈) | |
9 | nmblolbi.5 | . . . 4 ⊢ 𝑀 = (normCV‘𝑊) | |
10 | nmblolbi.6 | . . . 4 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) | |
11 | nmblolbi.7 | . . . 4 ⊢ 𝐵 = (𝑈 BLnOp 𝑊) | |
12 | nmblolbi.u | . . . 4 ⊢ 𝑈 ∈ NrmCVec | |
13 | nmblolbi.w | . . . 4 ⊢ 𝑊 ∈ NrmCVec | |
14 | eqid 2738 | . . . . . . 7 ⊢ (𝑈 0op 𝑊) = (𝑈 0op 𝑊) | |
15 | 14, 11 | 0blo 29154 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 0op 𝑊) ∈ 𝐵) |
16 | 12, 13, 15 | mp2an 689 | . . . . 5 ⊢ (𝑈 0op 𝑊) ∈ 𝐵 |
17 | 16 | elimel 4528 | . . . 4 ⊢ if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) ∈ 𝐵 |
18 | 7, 8, 9, 10, 11, 12, 13, 17 | nmblolbii 29161 | . . 3 ⊢ (𝐴 ∈ 𝑋 → (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) ≤ ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴))) |
19 | 6, 18 | dedth 4517 | . 2 ⊢ (𝑇 ∈ 𝐵 → (𝐴 ∈ 𝑋 → (𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴)))) |
20 | 19 | imp 407 | 1 ⊢ ((𝑇 ∈ 𝐵 ∧ 𝐴 ∈ 𝑋) → (𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ifcif 4459 class class class wbr 5074 ‘cfv 6433 (class class class)co 7275 · cmul 10876 ≤ cle 11010 NrmCVeccnv 28946 BaseSetcba 28948 normCVcnmcv 28952 normOpOLD cnmoo 29103 BLnOp cblo 29104 0op c0o 29105 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-seq 13722 df-exp 13783 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-grpo 28855 df-gid 28856 df-ginv 28857 df-ablo 28907 df-vc 28921 df-nv 28954 df-va 28957 df-ba 28958 df-sm 28959 df-0v 28960 df-nmcv 28962 df-lno 29106 df-nmoo 29107 df-blo 29108 df-0o 29109 |
This theorem is referenced by: isblo3i 29163 blometi 29165 ubthlem3 29234 htthlem 29279 |
Copyright terms: Public domain | W3C validator |