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

Theorem nmopun 28257
Description: Norm of a unitary Hilbert space operator. (Contributed by NM, 25-Feb-2006.) (New usage is discouraged.)
Assertion
Ref Expression
nmopun (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = 1)

Proof of Theorem nmopun
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unoplin 28163 . . . . 5 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 lnopf 28102 . . . . 5 (𝑇 ∈ LinOp → 𝑇: ℋ⟶ ℋ)
31, 2syl 17 . . . 4 (𝑇 ∈ UniOp → 𝑇: ℋ⟶ ℋ)
4 nmopval 28099 . . . 4 (𝑇: ℋ⟶ ℋ → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
53, 4syl 17 . . 3 (𝑇 ∈ UniOp → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
65adantl 481 . 2 (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
7 nmopsetretHIL 28107 . . . . . . 7 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ)
8 ressxr 9962 . . . . . . 7 ℝ ⊆ ℝ*
97, 8syl6ss 3580 . . . . . 6 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
103, 9syl 17 . . . . 5 (𝑇 ∈ UniOp → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
1110adantl 481 . . . 4 (( ℋ ≠ 0𝑇 ∈ UniOp) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
12 1re 9918 . . . . 5 1 ∈ ℝ
1312rexri 9976 . . . 4 1 ∈ ℝ*
1411, 13jctir 559 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*))
15 vex 3176 . . . . . . 7 𝑧 ∈ V
16 eqeq1 2614 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥 = (norm‘(𝑇𝑦)) ↔ 𝑧 = (norm‘(𝑇𝑦))))
1716anbi2d 736 . . . . . . . 8 (𝑥 = 𝑧 → (((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))))
1817rexbidv 3034 . . . . . . 7 (𝑥 = 𝑧 → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))))
1915, 18elab 3319 . . . . . 6 (𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))))
20 unopnorm 28160 . . . . . . . . . . 11 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (norm‘(𝑇𝑦)) = (norm𝑦))
2120eqeq2d 2620 . . . . . . . . . 10 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (𝑧 = (norm‘(𝑇𝑦)) ↔ 𝑧 = (norm𝑦)))
2221anbi2d 736 . . . . . . . . 9 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm𝑦))))
23 breq1 4586 . . . . . . . . . 10 (𝑧 = (norm𝑦) → (𝑧 ≤ 1 ↔ (norm𝑦) ≤ 1))
2423biimparc 503 . . . . . . . . 9 (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm𝑦)) → 𝑧 ≤ 1)
2522, 24syl6bi 242 . . . . . . . 8 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) → 𝑧 ≤ 1))
2625rexlimdva 3013 . . . . . . 7 (𝑇 ∈ UniOp → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) → 𝑧 ≤ 1))
2726imp 444 . . . . . 6 ((𝑇 ∈ UniOp ∧ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))) → 𝑧 ≤ 1)
2819, 27sylan2b 491 . . . . 5 ((𝑇 ∈ UniOp ∧ 𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}) → 𝑧 ≤ 1)
2928ralrimiva 2949 . . . 4 (𝑇 ∈ UniOp → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1)
3029adantl 481 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1)
31 hne0 27790 . . . . . . . . . . 11 ( ℋ ≠ 0 ↔ ∃𝑦 ∈ ℋ 𝑦 ≠ 0)
32 norm1hex 27492 . . . . . . . . . . 11 (∃𝑦 ∈ ℋ 𝑦 ≠ 0 ↔ ∃𝑦 ∈ ℋ (norm𝑦) = 1)
3331, 32sylbb 208 . . . . . . . . . 10 ( ℋ ≠ 0 → ∃𝑦 ∈ ℋ (norm𝑦) = 1)
3433adantr 480 . . . . . . . . 9 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ (norm𝑦) = 1)
35 1le1 10534 . . . . . . . . . . . . . 14 1 ≤ 1
36 breq1 4586 . . . . . . . . . . . . . 14 ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ↔ 1 ≤ 1))
3735, 36mpbiri 247 . . . . . . . . . . . . 13 ((norm𝑦) = 1 → (norm𝑦) ≤ 1)
3837a1i 11 . . . . . . . . . . . 12 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → (norm𝑦) ≤ 1))
3920adantr 480 . . . . . . . . . . . . . . 15 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → (norm‘(𝑇𝑦)) = (norm𝑦))
40 eqeq2 2621 . . . . . . . . . . . . . . . 16 ((norm𝑦) = 1 → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(𝑇𝑦)) = 1))
4140adantl 481 . . . . . . . . . . . . . . 15 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(𝑇𝑦)) = 1))
4239, 41mpbid 221 . . . . . . . . . . . . . 14 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → (norm‘(𝑇𝑦)) = 1)
4342eqcomd 2616 . . . . . . . . . . . . 13 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → 1 = (norm‘(𝑇𝑦)))
4443ex 449 . . . . . . . . . . . 12 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → 1 = (norm‘(𝑇𝑦))))
4538, 44jcad 554 . . . . . . . . . . 11 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4645adantll 746 . . . . . . . . . 10 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4746reximdva 3000 . . . . . . . . 9 (( ℋ ≠ 0𝑇 ∈ UniOp) → (∃𝑦 ∈ ℋ (norm𝑦) = 1 → ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4834, 47mpd 15 . . . . . . . 8 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦))))
49 1ex 9914 . . . . . . . . 9 1 ∈ V
50 eqeq1 2614 . . . . . . . . . . 11 (𝑥 = 1 → (𝑥 = (norm‘(𝑇𝑦)) ↔ 1 = (norm‘(𝑇𝑦))))
5150anbi2d 736 . . . . . . . . . 10 (𝑥 = 1 → (((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
5251rexbidv 3034 . . . . . . . . 9 (𝑥 = 1 → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
5349, 52elab 3319 . . . . . . . 8 (1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦))))
5448, 53sylibr 223 . . . . . . 7 (( ℋ ≠ 0𝑇 ∈ UniOp) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))})
5554adantr 480 . . . . . 6 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))})
56 breq2 4587 . . . . . . 7 (𝑤 = 1 → (𝑧 < 𝑤𝑧 < 1))
5756rspcev 3282 . . . . . 6 ((1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤)
5855, 57sylan 487 . . . . 5 (((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤)
5958ex 449 . . . 4 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))
6059ralrimiva 2949 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))
61 supxr2 12016 . . 3 ((({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*) ∧ (∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1 ∧ ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))) → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ) = 1)
6214, 30, 60, 61syl12anc 1316 . 2 (( ℋ ≠ 0𝑇 ∈ UniOp) → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ) = 1)
636, 62eqtrd 2644 1 (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = 1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  {cab 2596  wne 2780  wral 2896  wrex 2897  wss 3540   class class class wbr 4583  wf 5800  cfv 5804  supcsup 8229  cr 9814  1c1 9816  *cxr 9952   < clt 9953  cle 9954  chil 27160  normcno 27164  0c0v 27165  0c0h 27176  normopcnop 27186  LinOpclo 27188  UniOpcuo 27190
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893  ax-hilex 27240  ax-hfvadd 27241  ax-hvcom 27242  ax-hvass 27243  ax-hv0cl 27244  ax-hvaddid 27245  ax-hfvmul 27246  ax-hvmulid 27247  ax-hvmulass 27248  ax-hvdistr1 27249  ax-hvdistr2 27250  ax-hvmul0 27251  ax-hfi 27320  ax-his1 27323  ax-his2 27324  ax-his3 27325  ax-his4 27326
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-sup 8231  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-4 10958  df-n0 11170  df-z 11255  df-uz 11564  df-rp 11709  df-seq 12664  df-exp 12723  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-grpo 26731  df-gid 26732  df-ablo 26783  df-vc 26798  df-nv 26831  df-va 26834  df-ba 26835  df-sm 26836  df-0v 26837  df-nmcv 26839  df-hnorm 27209  df-hba 27210  df-hvsub 27212  df-hlim 27213  df-sh 27448  df-ch 27462  df-ch0 27494  df-nmop 28082  df-lnop 28084  df-unop 28086
This theorem is referenced by:  unopbd  28258  unierri  28347
  Copyright terms: Public domain W3C validator