HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  nmopval Structured version   Visualization version   GIF version

Theorem nmopval 32458
Description: Value of the norm of a Hilbert space operator. (Contributed by NM, 18-Jan-2006.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Assertion
Ref Expression
nmopval (𝑇: ℋ⟶ ℋ → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
Distinct variable group:   𝑥,𝑦,𝑇

Proof of Theorem nmopval
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 xrltso 13270 . . 3 < Or ℝ*
21supex 9456 . 2 sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ) ∈ V
3 ax-hilex 31601 . 2 ℋ ∈ V
4 fveq1 6884 . . . . . . . 8 (𝑡 = 𝑇 → (𝑡‘𝑦) = (𝑇‘𝑦))
54fveq2d 6889 . . . . . . 7 (𝑡 = 𝑇 → (normℎ‘(𝑡‘𝑦)) = (normℎ‘(𝑇‘𝑦)))
65eqeq2d 2772 . . . . . 6 (𝑡 = 𝑇 → (𝑥 = (normℎ‘(𝑡‘𝑦)) ↔ 𝑥 = (normℎ‘(𝑇‘𝑦))))
76anbi2d 642 . . . . 5 (𝑡 = 𝑇 → (((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑡‘𝑦))) ↔ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))))
87rexbidv 3187 . . . 4 (𝑡 = 𝑇 → (∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑡‘𝑦))) ↔ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))))
98abbidv 2827 . . 3 (𝑡 = 𝑇 → {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑡‘𝑦)))} = {𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))})
109supeq1d 9438 . 2 (𝑡 = 𝑇 → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑡‘𝑦)))}, ℝ*, < ) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
11 df-nmop 32441 . 2 normop = (𝑡 ∈ ( ℋ ↑m ℋ) ↦ sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑡‘𝑦)))}, ℝ*, < ))
122, 3, 3, 10, 11fvmptmap 8909 1 (𝑇: ℋ⟶ ℋ → (normop‘𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((normℎ‘𝑦) ≤ 1 ∧ 𝑥 = (normℎ‘(𝑇‘𝑦)))}, ℝ*, < ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  {cab 2739  ∃wrex 3087   class class class wbr 5103  ⟶wf 6534  ‘cfv 6538  supcsup 9432  1c1 11201  ℝ*cxr 11342   < clt 11343   ≤ cle 11344   ℋchba 31521  normℎcno 31525  normopcnop 31547
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-hilex 31601
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-po 5559  df-so 5560  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-er 8717  df-map 8849  df-en 8974  df-dom 8975  df-sdom 8976  df-sup 9434  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-nmop 32441
This theorem is used by:  nmopxr  32468  nmoprepnf  32469  nmoplb  32509  nmopub  32510  nmopnegi  32567  nmop0  32588  nmlnop0iALT  32597  nmopun  32616  nmcopexi  32629  pjnmopi  32750
  Copyright terms: Public domain W3C validator