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

Theorem elunop2 29796
Description: An operator is unitary iff it is linear, onto, and idempotent in the norm. Similar to theorem in [AkhiezerGlazman] p. 73, and its converse. (Contributed by NM, 24-Feb-2006.) (New usage is discouraged.)
Assertion
Ref Expression
elunop2 (𝑇 ∈ UniOp ↔ (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
Distinct variable group:   𝑥,𝑇

Proof of Theorem elunop2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 unoplin 29703 . . 3 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 elunop 29655 . . . 4 (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇𝑥) ·ih (𝑇𝑦)) = (𝑥 ·ih 𝑦)))
32simplbi 501 . . 3 (𝑇 ∈ UniOp → 𝑇: ℋ–onto→ ℋ)
4 unopnorm 29700 . . . 4 ((𝑇 ∈ UniOp ∧ 𝑥 ∈ ℋ) → (norm‘(𝑇𝑥)) = (norm𝑥))
54ralrimiva 3149 . . 3 (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥))
61, 3, 53jca 1125 . 2 (𝑇 ∈ UniOp → (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
7 eleq1 2877 . . 3 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ UniOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp))
8 eleq1 2877 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
9 foeq1 6561 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇: ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
10 2fveq3 6650 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm‘(𝑇𝑥)) = (norm‘(𝑇𝑦)))
11 fveq2 6645 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm𝑥) = (norm𝑦))
1210, 11eqeq12d 2814 . . . . . . . . 9 (𝑥 = 𝑦 → ((norm‘(𝑇𝑥)) = (norm𝑥) ↔ (norm‘(𝑇𝑦)) = (norm𝑦)))
1312cbvralvw 3396 . . . . . . . 8 (∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥) ↔ ∀𝑦 ∈ ℋ (norm‘(𝑇𝑦)) = (norm𝑦))
14 fveq1 6644 . . . . . . . . . 10 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
1514fveqeq2d 6653 . . . . . . . . 9 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
1615ralbidv 3162 . . . . . . . 8 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (norm‘(𝑇𝑦)) = (norm𝑦) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
1713, 16syl5bb 286 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
188, 9, 173anbi123d 1433 . . . . . 6 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)) ↔ (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦))))
19 eleq1 2877 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
20 foeq1 6561 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ): ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
21 fveq1 6644 . . . . . . . . 9 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
2221fveqeq2d 6653 . . . . . . . 8 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2322ralbidv 3162 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2419, 20, 233anbi123d 1433 . . . . . 6 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦)) ↔ (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦))))
25 idlnop 29775 . . . . . . 7 ( I ↾ ℋ) ∈ LinOp
26 f1oi 6627 . . . . . . . 8 ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
27 f1ofo 6597 . . . . . . . 8 (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ–onto→ ℋ)
2826, 27ax-mp 5 . . . . . . 7 ( I ↾ ℋ): ℋ–onto→ ℋ
29 fvresi 6912 . . . . . . . . 9 (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
3029fveq2d 6649 . . . . . . . 8 (𝑦 ∈ ℋ → (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3130rgen 3116 . . . . . . 7 𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦)
3225, 28, 313pm3.2i 1336 . . . . . 6 (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3318, 24, 32elimhyp 4488 . . . . 5 (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦))
3433simp1i 1136 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp
3533simp2i 1137 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ
3633simp3i 1138 . . . 4 𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)
3734, 35, 36lnopunii 29795 . . 3 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp
387, 37dedth 4481 . 2 ((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)) → 𝑇 ∈ UniOp)
396, 38impbii 212 1 (𝑇 ∈ UniOp ↔ (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  w3a 1084   = wceq 1538  wcel 2111  wral 3106  ifcif 4425   I cid 5424  cres 5521  ontowfo 6322  1-1-ontowf1o 6323  cfv 6324  (class class class)co 7135  chba 28702   ·ih csp 28705  normcno 28706  LinOpclo 28730  UniOpcuo 28732
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604  ax-hilex 28782  ax-hfvadd 28783  ax-hvcom 28784  ax-hvass 28785  ax-hv0cl 28786  ax-hvaddid 28787  ax-hfvmul 28788  ax-hvmulid 28789  ax-hvdistr2 28792  ax-hvmul0 28793  ax-hfi 28862  ax-his1 28865  ax-his2 28866  ax-his3 28867  ax-his4 28868
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-sup 8890  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-3 11689  df-n0 11886  df-z 11970  df-uz 12232  df-rp 12378  df-seq 13365  df-exp 13426  df-cj 14450  df-re 14451  df-im 14452  df-sqrt 14586  df-hnorm 28751  df-hvsub 28754  df-lnop 29624  df-unop 29626
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator