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

Theorem nmopun 29793
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 29699 . . . . 5 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 lnopf 29638 . . . . 5 (𝑇 ∈ LinOp → 𝑇: ℋ⟶ ℋ)
31, 2syl 17 . . . 4 (𝑇 ∈ UniOp → 𝑇: ℋ⟶ ℋ)
4 nmopval 29635 . . . 4 (𝑇: ℋ⟶ ℋ → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
53, 4syl 17 . . 3 (𝑇 ∈ UniOp → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
65adantl 484 . 2 (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = sup({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}, ℝ*, < ))
7 nmopsetretHIL 29643 . . . . . . 7 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ)
8 ressxr 10687 . . . . . . 7 ℝ ⊆ ℝ*
97, 8sstrdi 3981 . . . . . 6 (𝑇: ℋ⟶ ℋ → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
103, 9syl 17 . . . . 5 (𝑇 ∈ UniOp → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
1110adantl 484 . . . 4 (( ℋ ≠ 0𝑇 ∈ UniOp) → {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ*)
12 1xr 10702 . . . 4 1 ∈ ℝ*
1311, 12jctir 523 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ({𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ⊆ ℝ* ∧ 1 ∈ ℝ*))
14 vex 3499 . . . . . . 7 𝑧 ∈ V
15 eqeq1 2827 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥 = (norm‘(𝑇𝑦)) ↔ 𝑧 = (norm‘(𝑇𝑦))))
1615anbi2d 630 . . . . . . . 8 (𝑥 = 𝑧 → (((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))))
1716rexbidv 3299 . . . . . . 7 (𝑥 = 𝑧 → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))))
1814, 17elab 3669 . . . . . 6 (𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))))
19 unopnorm 29696 . . . . . . . . . . 11 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (norm‘(𝑇𝑦)) = (norm𝑦))
2019eqeq2d 2834 . . . . . . . . . 10 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (𝑧 = (norm‘(𝑇𝑦)) ↔ 𝑧 = (norm𝑦)))
2120anbi2d 630 . . . . . . . . 9 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm𝑦))))
22 breq1 5071 . . . . . . . . . 10 (𝑧 = (norm𝑦) → (𝑧 ≤ 1 ↔ (norm𝑦) ≤ 1))
2322biimparc 482 . . . . . . . . 9 (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm𝑦)) → 𝑧 ≤ 1)
2421, 23syl6bi 255 . . . . . . . 8 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → (((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) → 𝑧 ≤ 1))
2524rexlimdva 3286 . . . . . . 7 (𝑇 ∈ UniOp → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦))) → 𝑧 ≤ 1))
2625imp 409 . . . . . 6 ((𝑇 ∈ UniOp ∧ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑧 = (norm‘(𝑇𝑦)))) → 𝑧 ≤ 1)
2718, 26sylan2b 595 . . . . 5 ((𝑇 ∈ UniOp ∧ 𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}) → 𝑧 ≤ 1)
2827ralrimiva 3184 . . . 4 (𝑇 ∈ UniOp → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1)
2928adantl 484 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∀𝑧 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 ≤ 1)
30 hne0 29326 . . . . . . . . . . 11 ( ℋ ≠ 0 ↔ ∃𝑦 ∈ ℋ 𝑦 ≠ 0)
31 norm1hex 29030 . . . . . . . . . . 11 (∃𝑦 ∈ ℋ 𝑦 ≠ 0 ↔ ∃𝑦 ∈ ℋ (norm𝑦) = 1)
3230, 31sylbb 221 . . . . . . . . . 10 ( ℋ ≠ 0 → ∃𝑦 ∈ ℋ (norm𝑦) = 1)
3332adantr 483 . . . . . . . . 9 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ (norm𝑦) = 1)
34 1le1 11270 . . . . . . . . . . . . . 14 1 ≤ 1
35 breq1 5071 . . . . . . . . . . . . . 14 ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ↔ 1 ≤ 1))
3634, 35mpbiri 260 . . . . . . . . . . . . 13 ((norm𝑦) = 1 → (norm𝑦) ≤ 1)
3736a1i 11 . . . . . . . . . . . 12 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → (norm𝑦) ≤ 1))
3819adantr 483 . . . . . . . . . . . . . . 15 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → (norm‘(𝑇𝑦)) = (norm𝑦))
39 eqeq2 2835 . . . . . . . . . . . . . . . 16 ((norm𝑦) = 1 → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(𝑇𝑦)) = 1))
4039adantl 484 . . . . . . . . . . . . . . 15 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(𝑇𝑦)) = 1))
4138, 40mpbid 234 . . . . . . . . . . . . . 14 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → (norm‘(𝑇𝑦)) = 1)
4241eqcomd 2829 . . . . . . . . . . . . 13 (((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) ∧ (norm𝑦) = 1) → 1 = (norm‘(𝑇𝑦)))
4342ex 415 . . . . . . . . . . . 12 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → 1 = (norm‘(𝑇𝑦))))
4437, 43jcad 515 . . . . . . . . . . 11 ((𝑇 ∈ UniOp ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4544adantll 712 . . . . . . . . . 10 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑦 ∈ ℋ) → ((norm𝑦) = 1 → ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4645reximdva 3276 . . . . . . . . 9 (( ℋ ≠ 0𝑇 ∈ UniOp) → (∃𝑦 ∈ ℋ (norm𝑦) = 1 → ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
4733, 46mpd 15 . . . . . . . 8 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦))))
48 1ex 10639 . . . . . . . . 9 1 ∈ V
49 eqeq1 2827 . . . . . . . . . . 11 (𝑥 = 1 → (𝑥 = (norm‘(𝑇𝑦)) ↔ 1 = (norm‘(𝑇𝑦))))
5049anbi2d 630 . . . . . . . . . 10 (𝑥 = 1 → (((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
5150rexbidv 3299 . . . . . . . . 9 (𝑥 = 1 → (∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦))) ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦)))))
5248, 51elab 3669 . . . . . . . 8 (1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ↔ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 1 = (norm‘(𝑇𝑦))))
5347, 52sylibr 236 . . . . . . 7 (( ℋ ≠ 0𝑇 ∈ UniOp) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))})
5453adantr 483 . . . . . 6 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → 1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))})
55 breq2 5072 . . . . . . 7 (𝑤 = 1 → (𝑧 < 𝑤𝑧 < 1))
5655rspcev 3625 . . . . . 6 ((1 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))} ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤)
5754, 56sylan 582 . . . . 5 (((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < 1) → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤)
5857ex 415 . . . 4 ((( ℋ ≠ 0𝑇 ∈ UniOp) ∧ 𝑧 ∈ ℝ) → (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))
5958ralrimiva 3184 . . 3 (( ℋ ≠ 0𝑇 ∈ UniOp) → ∀𝑧 ∈ ℝ (𝑧 < 1 → ∃𝑤 ∈ {𝑥 ∣ ∃𝑦 ∈ ℋ ((norm𝑦) ≤ 1 ∧ 𝑥 = (norm‘(𝑇𝑦)))}𝑧 < 𝑤))
60 supxr2 12710 . . 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 2858 1 (( ℋ ≠ 0𝑇 ∈ UniOp) → (normop𝑇) = 1)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  {cab 2801  wne 3018  wral 3140  wrex 3141  wss 3938   class class class wbr 5068  wf 6353  cfv 6357  supcsup 8906  cr 10538  1c1 10540  *cxr 10676   < clt 10677  cle 10678  chba 28698  normcno 28702  0c0v 28703  0c0h 28714  normopcnop 28724  LinOpclo 28726  UniOpcuo 28728
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616  ax-pre-sup 10617  ax-hilex 28778  ax-hfvadd 28779  ax-hvcom 28780  ax-hvass 28781  ax-hv0cl 28782  ax-hvaddid 28783  ax-hfvmul 28784  ax-hvmulid 28785  ax-hvmulass 28786  ax-hvdistr1 28787  ax-hvdistr2 28788  ax-hvmul0 28789  ax-hfi 28858  ax-his1 28861  ax-his2 28862  ax-his3 28863  ax-his4 28864
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-er 8291  df-map 8410  df-en 8512  df-dom 8513  df-sdom 8514  df-sup 8908  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-div 11300  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-n0 11901  df-z 11985  df-uz 12247  df-rp 12393  df-seq 13373  df-exp 13433  df-cj 14460  df-re 14461  df-im 14462  df-sqrt 14596  df-abs 14597  df-grpo 28272  df-gid 28273  df-ablo 28324  df-vc 28338  df-nv 28371  df-va 28374  df-ba 28375  df-sm 28376  df-0v 28377  df-nmcv 28379  df-hnorm 28747  df-hba 28748  df-hvsub 28750  df-hlim 28751  df-sh 28986  df-ch 29000  df-ch0 29032  df-nmop 29618  df-lnop 29620  df-unop 29622
This theorem is referenced by:  unopbd  29794  unierri  29883
  Copyright terms: Public domain W3C validator