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 6671 | . . . . . 6 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → (𝑇‘𝐴) = (if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) | |
2 | 1 | fveq2d 6676 | . . . . 5 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → (𝑀‘(𝑇‘𝐴)) = (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴))) |
3 | fveq2 6672 | . . . . . 6 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → (𝑁‘𝑇) = (𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)))) | |
4 | 3 | oveq1d 7173 | . . . . 5 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → ((𝑁‘𝑇) · (𝐿‘𝐴)) = ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴))) |
5 | 2, 4 | breq12d 5081 | . . . 4 ⊢ (𝑇 = if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) → ((𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴)) ↔ (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) ≤ ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴)))) |
6 | 5 | imbi2d 343 | . . 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 2823 | . . . . . . 7 ⊢ (𝑈 0op 𝑊) = (𝑈 0op 𝑊) | |
15 | 14, 11 | 0blo 28571 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 0op 𝑊) ∈ 𝐵) |
16 | 12, 13, 15 | mp2an 690 | . . . . 5 ⊢ (𝑈 0op 𝑊) ∈ 𝐵 |
17 | 16 | elimel 4536 | . . . 4 ⊢ if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊)) ∈ 𝐵 |
18 | 7, 8, 9, 10, 11, 12, 13, 17 | nmblolbii 28578 | . . 3 ⊢ (𝐴 ∈ 𝑋 → (𝑀‘(if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))‘𝐴)) ≤ ((𝑁‘if(𝑇 ∈ 𝐵, 𝑇, (𝑈 0op 𝑊))) · (𝐿‘𝐴))) |
19 | 6, 18 | dedth 4525 | . 2 ⊢ (𝑇 ∈ 𝐵 → (𝐴 ∈ 𝑋 → (𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴)))) |
20 | 19 | imp 409 | 1 ⊢ ((𝑇 ∈ 𝐵 ∧ 𝐴 ∈ 𝑋) → (𝑀‘(𝑇‘𝐴)) ≤ ((𝑁‘𝑇) · (𝐿‘𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ifcif 4469 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 · cmul 10544 ≤ cle 10678 NrmCVeccnv 28363 BaseSetcba 28365 normCVcnmcv 28369 normOpOLD cnmoo 28520 BLnOp cblo 28521 0op c0o 28522 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-seq 13373 df-exp 13433 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-grpo 28272 df-gid 28273 df-ginv 28274 df-ablo 28324 df-vc 28338 df-nv 28371 df-va 28374 df-ba 28375 df-sm 28376 df-0v 28377 df-nmcv 28379 df-lno 28523 df-nmoo 28524 df-blo 28525 df-0o 28526 |
This theorem is referenced by: isblo3i 28580 blometi 28582 ubthlem3 28651 htthlem 28696 |
Copyright terms: Public domain | W3C validator |