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

Theorem nmopun 30376
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 30282 . . . . 5 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 lnopf 30221 . . . . 5 (𝑇 ∈ LinOp → 𝑇: ℋ⟶ ℋ)
31, 2syl 17 . . . 4 (𝑇 ∈ UniOp → 𝑇: ℋ⟶ ℋ)
4 nmopval 30218 . . . 4 (𝑇: ℋ⟶ ℋ → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
53, 4syl 17 . . 3 (𝑇 ∈ UniOp → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
65adantl 482 . 2 (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
7 nmopsetretHIL 30226 . . . . . . 7 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ)
8 ressxr 11019 . . . . . . 7 ℝ ⊆ ℝ*
97, 8sstrdi 3933 . . . . . 6 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
103, 9syl 17 . . . . 5 (𝑇 ∈ UniOp → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
1110adantl 482 . . . 4 (( ℋ ≠ 0𝑇 ∈ UniOp) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
12 1xr 11034 . . . 4 1 ∈ ℝ*
1311, 12jctir 521 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*))
14 vex 3436 . . . . . . 7 𝑧 ∈ V
15 eqeq1 2742 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥 = (norm‘(𝑇𝑦)) ↔ 𝑧 = (norm‘(𝑇𝑦))))
1615anbi2d 629 . . . . . . . 8 (𝑥 = 𝑧 → (((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))))
1716rexbidv 3226 . . . . . . 7 (𝑥 = 𝑧 → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))))
1814, 17elab 3609 . . . . . 6 (𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))))
19 unopnorm 30279 . . . . . . . . . . 11 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (norm‘(𝑇𝑦)) = (norm𝑦))
2019eqeq2d 2749 . . . . . . . . . 10 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (𝑧 = (norm‘(𝑇𝑦)) ↔ 𝑧 = (norm𝑦)))
2120anbi2d 629 . . . . . . . . 9 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm𝑦))))
22 breq1 5077 . . . . . . . . . 10 (𝑧 = (norm𝑦) → (𝑧 ≤ 1 ↔ (norm𝑦) ≤ 1))
2322biimparc 480 . . . . . . . . 9 (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm𝑦)) → 𝑧 ≤ 1)
2421, 23syl6bi 252 . . . . . . . 8 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) → 𝑧 ≤ 1))
2524rexlimdva 3213 . . . . . . 7 (𝑇 ∈ UniOp → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) → 𝑧 ≤ 1))
2625imp 407 . . . . . 6 ((𝑇 ∈ UniOp ∧ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))) → 𝑧 ≤ 1)
2718, 26sylan2b 594 . . . . 5 ((𝑇 ∈ UniOp ∧ 𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}) → 𝑧 ≤ 1)
2827ralrimiva 3103 . . . 4 (𝑇 ∈ UniOp → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1)
2928adantl 482 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1)
30 hne0 29909 . . . . . . . . . . 11 ( ℋ ≠ 0 ↔ ∃𝑦 ∈ ℋ 𝑦 ≠ 0)
31 norm1hex 29613 . . . . . . . . . . 11 (∃𝑦 ∈ ℋ 𝑦 ≠ 0 ↔ ∃𝑦 ∈ ℋ (norm𝑦) = 1)
3230, 31sylbb 218 . . . . . . . . . 10 ( ℋ ≠ 0 → ∃𝑦 ∈ ℋ (norm𝑦) = 1)
3332adantr 481 . . . . . . . . 9 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ (norm𝑦) = 1)
34 1le1 11603 . . . . . . . . . . . . . 14 1 ≤ 1
35 breq1 5077 . . . . . . . . . . . . . 14 ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ↔ 1 ≤ 1))
3634, 35mpbiri 257 . . . . . . . . . . . . 13 ((norm𝑦) = 1 → (norm𝑦) ≤ 1)
3736a1i 11 . . . . . . . . . . . 12 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → (norm𝑦) ≤ 1))
3819adantr 481 . . . . . . . . . . . . . . 15 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → (norm‘(𝑇𝑦)) = (norm𝑦))
39 eqeq2 2750 . . . . . . . . . . . . . . . 16 ((norm𝑦) = 1 → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(𝑇𝑦)) = 1))
4039adantl 482 . . . . . . . . . . . . . . 15 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(𝑇𝑦)) = 1))
4138, 40mpbid 231 . . . . . . . . . . . . . 14 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → (norm‘(𝑇𝑦)) = 1)
4241eqcomd 2744 . . . . . . . . . . . . 13 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → 1 = (norm‘(𝑇𝑦)))
4342ex 413 . . . . . . . . . . . 12 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → 1 = (norm‘(𝑇𝑦))))
4437, 43jcad 513 . . . . . . . . . . 11 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4544adantll 711 . . . . . . . . . 10 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4645reximdva 3203 . . . . . . . . 9 (( ℋ ≠ 0𝑇 ∈ UniOp) → (∃𝑦 ∈ ℋ (norm𝑦) = 1 → ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4733, 46mpd 15 . . . . . . . 8 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦))))
48 1ex 10971 . . . . . . . . 9 1 ∈ V
49 eqeq1 2742 . . . . . . . . . . 11 (𝑥 = 1 → (𝑥 = (norm‘(𝑇𝑦)) ↔ 1 = (norm‘(𝑇𝑦))))
5049anbi2d 629 . . . . . . . . . 10 (𝑥 = 1 → (((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
5150rexbidv 3226 . . . . . . . . 9 (𝑥 = 1 → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
5248, 51elab 3609 . . . . . . . 8 (1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦))))
5347, 52sylibr 233 . . . . . . 7 (( ℋ ≠ 0𝑇 ∈ UniOp) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))})
5453adantr 481 . . . . . 6 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))})
55 breq2 5078 . . . . . . 7 (𝑤 = 1 → (𝑧 < 𝑤𝑧 < 1))
5655rspcev 3561 . . . . . 6 ((1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤)
5754, 56sylan 580 . . . . 5 (((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤)
5857ex 413 . . . 4 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))
5958ralrimiva 3103 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))
60 supxr2 13048 . . 3 ((({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*) ∧ (∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1 ∧ ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))) → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ) = 1)
6113, 29, 59, 60syl12anc 834 . 2 (( ℋ ≠ 0𝑇 ∈ UniOp) → sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ) = 1)
626, 61eqtrd 2778 1 (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = 1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  {cab 2715  wne 2943  wral 3064  wrex 3065  wss 3887   class class class wbr 5074  wf 6429  cfv 6433  supcsup 9199  cr 10870  1c1 10872  *cxr 11008   < clt 11009  cle 11010  chba 29281  normcno 29285  0c0v 29286  0c0h 29297  normopcnop 29307  LinOpclo 29309  UniOpcuo 29311
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-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949  ax-hilex 29361  ax-hfvadd 29362  ax-hvcom 29363  ax-hvass 29364  ax-hv0cl 29365  ax-hvaddid 29366  ax-hfvmul 29367  ax-hvmulid 29368  ax-hvmulass 29369  ax-hvdistr1 29370  ax-hvdistr2 29371  ax-hvmul0 29372  ax-hfi 29441  ax-his1 29444  ax-his2 29445  ax-his3 29446  ax-his4 29447
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  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-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-sup 9201  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-4 12038  df-n0 12234  df-z 12320  df-uz 12583  df-rp 12731  df-seq 13722  df-exp 13783  df-cj 14810  df-re 14811  df-im 14812  df-sqrt 14946  df-abs 14947  df-grpo 28855  df-gid 28856  df-ablo 28907  df-vc 28921  df-nv 28954  df-va 28957  df-ba 28958  df-sm 28959  df-0v 28960  df-nmcv 28962  df-hnorm 29330  df-hba 29331  df-hvsub 29333  df-hlim 29334  df-sh 29569  df-ch 29583  df-ch0 29615  df-nmop 30201  df-lnop 30203  df-unop 30205
This theorem is referenced by:  unopbd  30377  unierri  30466
  Copyright terms: Public domain W3C validator