Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > bloval | Structured version Visualization version GIF version |
Description: The class of bounded linear operators between two normed complex vector spaces. (Contributed by NM, 6-Nov-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bloval.3 | ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) |
bloval.4 | ⊢ 𝐿 = (𝑈 LnOp 𝑊) |
bloval.5 | ⊢ 𝐵 = (𝑈 BLnOp 𝑊) |
Ref | Expression |
---|---|
bloval | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bloval.5 | . 2 ⊢ 𝐵 = (𝑈 BLnOp 𝑊) | |
2 | oveq1 7282 | . . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 LnOp 𝑤) = (𝑈 LnOp 𝑤)) | |
3 | oveq1 7282 | . . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑤)) | |
4 | 3 | fveq1d 6776 | . . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢 normOpOLD 𝑤)‘𝑡) = ((𝑈 normOpOLD 𝑤)‘𝑡)) |
5 | 4 | breq1d 5084 | . . . 4 ⊢ (𝑢 = 𝑈 → (((𝑢 normOpOLD 𝑤)‘𝑡) < +∞ ↔ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞)) |
6 | 2, 5 | rabeqbidv 3420 | . . 3 ⊢ (𝑢 = 𝑈 → {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞}) |
7 | oveq2 7283 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = (𝑈 LnOp 𝑊)) | |
8 | bloval.4 | . . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
9 | 7, 8 | eqtr4di 2796 | . . . 4 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = 𝐿) |
10 | oveq2 7283 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑊)) | |
11 | bloval.3 | . . . . . . 7 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) | |
12 | 10, 11 | eqtr4di 2796 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = 𝑁) |
13 | 12 | fveq1d 6776 | . . . . 5 ⊢ (𝑤 = 𝑊 → ((𝑈 normOpOLD 𝑤)‘𝑡) = (𝑁‘𝑡)) |
14 | 13 | breq1d 5084 | . . . 4 ⊢ (𝑤 = 𝑊 → (((𝑈 normOpOLD 𝑤)‘𝑡) < +∞ ↔ (𝑁‘𝑡) < +∞)) |
15 | 9, 14 | rabeqbidv 3420 | . . 3 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
16 | df-blo 29108 | . . 3 ⊢ BLnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞}) | |
17 | 8 | ovexi 7309 | . . . 4 ⊢ 𝐿 ∈ V |
18 | 17 | rabex 5256 | . . 3 ⊢ {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞} ∈ V |
19 | 6, 15, 16, 18 | ovmpo 7433 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 BLnOp 𝑊) = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
20 | 1, 19 | eqtrid 2790 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {crab 3068 class class class wbr 5074 ‘cfv 6433 (class class class)co 7275 +∞cpnf 11006 < clt 11009 NrmCVeccnv 28946 LnOp clno 29102 normOpOLD cnmoo 29103 BLnOp cblo 29104 |
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-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 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-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-iota 6391 df-fun 6435 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-blo 29108 |
This theorem is referenced by: isblo 29144 hhbloi 30264 |
Copyright terms: Public domain | W3C validator |