Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > blo3i | Structured version Visualization version GIF version |
Description: Properties that determine a bounded linear operator. (Contributed by NM, 13-Jan-2008.) (New usage is discouraged.) |
Ref | Expression |
---|---|
isblo3i.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
isblo3i.m | ⊢ 𝑀 = (normCV‘𝑈) |
isblo3i.n | ⊢ 𝑁 = (normCV‘𝑊) |
isblo3i.4 | ⊢ 𝐿 = (𝑈 LnOp 𝑊) |
isblo3i.5 | ⊢ 𝐵 = (𝑈 BLnOp 𝑊) |
isblo3i.u | ⊢ 𝑈 ∈ NrmCVec |
isblo3i.w | ⊢ 𝑊 ∈ NrmCVec |
Ref | Expression |
---|---|
blo3i | ⊢ ((𝑇 ∈ 𝐿 ∧ 𝐴 ∈ ℝ ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝐴 · (𝑀‘𝑦))) → 𝑇 ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 6657 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 · (𝑀‘𝑦)) = (𝐴 · (𝑀‘𝑦))) | |
2 | 1 | breq2d 4665 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑁‘(𝑇‘𝑦)) ≤ (𝑥 · (𝑀‘𝑦)) ↔ (𝑁‘(𝑇‘𝑦)) ≤ (𝐴 · (𝑀‘𝑦)))) |
3 | 2 | ralbidv 2986 | . . . 4 ⊢ (𝑥 = 𝐴 → (∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝑥 · (𝑀‘𝑦)) ↔ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝐴 · (𝑀‘𝑦)))) |
4 | 3 | rspcev 3309 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝐴 · (𝑀‘𝑦))) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝑥 · (𝑀‘𝑦))) |
5 | isblo3i.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
6 | isblo3i.m | . . . . 5 ⊢ 𝑀 = (normCV‘𝑈) | |
7 | isblo3i.n | . . . . 5 ⊢ 𝑁 = (normCV‘𝑊) | |
8 | isblo3i.4 | . . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
9 | isblo3i.5 | . . . . 5 ⊢ 𝐵 = (𝑈 BLnOp 𝑊) | |
10 | isblo3i.u | . . . . 5 ⊢ 𝑈 ∈ NrmCVec | |
11 | isblo3i.w | . . . . 5 ⊢ 𝑊 ∈ NrmCVec | |
12 | 5, 6, 7, 8, 9, 10, 11 | isblo3i 27656 | . . . 4 ⊢ (𝑇 ∈ 𝐵 ↔ (𝑇 ∈ 𝐿 ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝑥 · (𝑀‘𝑦)))) |
13 | 12 | biimpri 218 | . . 3 ⊢ ((𝑇 ∈ 𝐿 ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝑥 · (𝑀‘𝑦))) → 𝑇 ∈ 𝐵) |
14 | 4, 13 | sylan2 491 | . 2 ⊢ ((𝑇 ∈ 𝐿 ∧ (𝐴 ∈ ℝ ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝐴 · (𝑀‘𝑦)))) → 𝑇 ∈ 𝐵) |
15 | 14 | 3impb 1260 | 1 ⊢ ((𝑇 ∈ 𝐿 ∧ 𝐴 ∈ ℝ ∧ ∀𝑦 ∈ 𝑋 (𝑁‘(𝑇‘𝑦)) ≤ (𝐴 · (𝑀‘𝑦))) → 𝑇 ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ∃wrex 2913 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 ℝcr 9935 · cmul 9941 ≤ cle 10075 NrmCVeccnv 27439 BaseSetcba 27441 normCVcnmcv 27445 LnOp clno 27595 BLnOp cblo 27597 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-grpo 27347 df-gid 27348 df-ginv 27349 df-ablo 27399 df-vc 27414 df-nv 27447 df-va 27450 df-ba 27451 df-sm 27452 df-0v 27453 df-nmcv 27455 df-lno 27599 df-nmoo 27600 df-blo 27601 df-0o 27602 |
This theorem is referenced by: ipblnfi 27711 |
Copyright terms: Public domain | W3C validator |