| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > nmfnval | Structured version Visualization version GIF version | ||
| Description: Value of the norm of a Hilbert space functional. (Contributed by NM, 11-Feb-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nmfnval | ⊢ (𝑇: ℋ⟶ℂ → (normfn‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrltso 13157 | . . 3 ⊢ < Or ℝ* | |
| 2 | 1 | supex 9476 | . 2 ⊢ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < ) ∈ V |
| 3 | ax-hilex 30980 | . 2 ⊢ ℋ ∈ V | |
| 4 | cnex 11210 | . 2 ⊢ ℂ ∈ V | |
| 5 | fveq1 6875 | . . . . . . . 8 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦)) | |
| 6 | 5 | fveq2d 6880 | . . . . . . 7 ⊢ (𝑡 = 𝑇 → (abs‘(𝑡‘𝑦)) = (abs‘(𝑇‘𝑦))) |
| 7 | 6 | eqeq2d 2746 | . . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑥 = (abs‘(𝑡‘𝑦)) ↔ 𝑥 = (abs‘(𝑇‘𝑦)))) |
| 8 | 7 | anbi2d 630 | . . . . 5 ⊢ (𝑡 = 𝑇 → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑡‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦))))) |
| 9 | 8 | rexbidv 3164 | . . . 4 ⊢ (𝑡 = 𝑇 → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑡‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦))))) |
| 10 | 9 | abbidv 2801 | . . 3 ⊢ (𝑡 = 𝑇 → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑡‘𝑦)))} = {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}) |
| 11 | 10 | supeq1d 9458 | . 2 ⊢ (𝑡 = 𝑇 → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑡‘𝑦)))}, ℝ*, < ) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < )) |
| 12 | df-nmfn 31826 | . 2 ⊢ normfn = (𝑡 ∈ (ℂ ↑m ℋ) ↦ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑡‘𝑦)))}, ℝ*, < )) | |
| 13 | 2, 3, 4, 11, 12 | fvmptmap 8895 | 1 ⊢ (𝑇: ℋ⟶ℂ → (normfn‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (abs‘(𝑇‘𝑦)))}, ℝ*, < )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 {cab 2713 ∃wrex 3060 class class class wbr 5119 ⟶wf 6527 ‘cfv 6531 supcsup 9452 ℂcc 11127 1c1 11130 ℝ*cxr 11268 < clt 11269 ≤ cle 11270 abscabs 15253 ℋchba 30900 normℎcno 30904 normfncnmf 30932 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-hilex 30980 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-po 5561 df-so 5562 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7408 df-oprab 7409 df-mpo 7410 df-er 8719 df-map 8842 df-en 8960 df-dom 8961 df-sdom 8962 df-sup 9454 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-nmfn 31826 |
| This theorem is referenced by: nmfnxr 31860 nmfnrepnf 31861 nmfnlb 31905 nmfnleub 31906 nmfn0 31968 nmcfnexi 32032 branmfn 32086 |
| Copyright terms: Public domain | W3C validator |