| 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 7363 | . . . 4 ⊢ (𝑢 = 𝑈 → (𝑢 LnOp 𝑤) = (𝑈 LnOp 𝑤)) | |
| 3 | oveq1 7363 | . . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑤)) | |
| 4 | 3 | fveq1d 6834 | . . . . 5 ⊢ (𝑢 = 𝑈 → ((𝑢 normOpOLD 𝑤)‘𝑡) = ((𝑈 normOpOLD 𝑤)‘𝑡)) |
| 5 | 4 | breq1d 5106 | . . . 4 ⊢ (𝑢 = 𝑈 → (((𝑢 normOpOLD 𝑤)‘𝑡) < +∞ ↔ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞)) |
| 6 | 2, 5 | rabeqbidv 3415 | . . 3 ⊢ (𝑢 = 𝑈 → {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞}) |
| 7 | oveq2 7364 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = (𝑈 LnOp 𝑊)) | |
| 8 | bloval.4 | . . . . 5 ⊢ 𝐿 = (𝑈 LnOp 𝑊) | |
| 9 | 7, 8 | eqtr4di 2787 | . . . 4 ⊢ (𝑤 = 𝑊 → (𝑈 LnOp 𝑤) = 𝐿) |
| 10 | oveq2 7364 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = (𝑈 normOpOLD 𝑊)) | |
| 11 | bloval.3 | . . . . . . 7 ⊢ 𝑁 = (𝑈 normOpOLD 𝑊) | |
| 12 | 10, 11 | eqtr4di 2787 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (𝑈 normOpOLD 𝑤) = 𝑁) |
| 13 | 12 | fveq1d 6834 | . . . . 5 ⊢ (𝑤 = 𝑊 → ((𝑈 normOpOLD 𝑤)‘𝑡) = (𝑁‘𝑡)) |
| 14 | 13 | breq1d 5106 | . . . 4 ⊢ (𝑤 = 𝑊 → (((𝑈 normOpOLD 𝑤)‘𝑡) < +∞ ↔ (𝑁‘𝑡) < +∞)) |
| 15 | 9, 14 | rabeqbidv 3415 | . . 3 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ (𝑈 LnOp 𝑤) ∣ ((𝑈 normOpOLD 𝑤)‘𝑡) < +∞} = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
| 16 | df-blo 30770 | . . 3 ⊢ BLnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ (𝑢 LnOp 𝑤) ∣ ((𝑢 normOpOLD 𝑤)‘𝑡) < +∞}) | |
| 17 | 8 | ovexi 7390 | . . . 4 ⊢ 𝐿 ∈ V |
| 18 | 17 | rabex 5282 | . . 3 ⊢ {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞} ∈ V |
| 19 | 6, 15, 16, 18 | ovmpo 7516 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 BLnOp 𝑊) = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
| 20 | 1, 19 | eqtrid 2781 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐵 = {𝑡 ∈ 𝐿 ∣ (𝑁‘𝑡) < +∞}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3397 class class class wbr 5096 ‘cfv 6490 (class class class)co 7356 +∞cpnf 11161 < clt 11164 NrmCVeccnv 30608 LnOp clno 30764 normOpOLD cnmoo 30765 BLnOp cblo 30766 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-iota 6446 df-fun 6492 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-blo 30770 |
| This theorem is referenced by: isblo 30806 hhbloi 31926 |
| Copyright terms: Public domain | W3C validator |