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

Theorem elunop2 32045
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 31952 . . 3 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 elunop 31904 . . . 4 (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇𝑥) ·ih (𝑇𝑦)) = (𝑥 ·ih 𝑦)))
32simplbi 497 . . 3 (𝑇 ∈ UniOp → 𝑇: ℋ–onto→ ℋ)
4 unopnorm 31949 . . . 4 ((𝑇 ∈ UniOp ∧ 𝑥 ∈ ℋ) → (norm‘(𝑇𝑥)) = (norm𝑥))
54ralrimiva 3152 . . 3 (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥))
61, 3, 53jca 1128 . 2 (𝑇 ∈ UniOp → (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
7 eleq1 2832 . . 3 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ UniOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp))
8 eleq1 2832 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
9 foeq1 6830 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇: ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
10 2fveq3 6925 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm‘(𝑇𝑥)) = (norm‘(𝑇𝑦)))
11 fveq2 6920 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm𝑥) = (norm𝑦))
1210, 11eqeq12d 2756 . . . . . . . . 9 (𝑥 = 𝑦 → ((norm‘(𝑇𝑥)) = (norm𝑥) ↔ (norm‘(𝑇𝑦)) = (norm𝑦)))
1312cbvralvw 3243 . . . . . . . 8 (∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥) ↔ ∀𝑦 ∈ ℋ (norm‘(𝑇𝑦)) = (norm𝑦))
14 fveq1 6919 . . . . . . . . . 10 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
1514fveqeq2d 6928 . . . . . . . . 9 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
1615ralbidv 3184 . . . . . . . 8 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (norm‘(𝑇𝑦)) = (norm𝑦) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
1713, 16bitrid 283 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
188, 9, 173anbi123d 1436 . . . . . 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 2832 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
20 foeq1 6830 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ): ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
21 fveq1 6919 . . . . . . . . 9 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
2221fveqeq2d 6928 . . . . . . . 8 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2322ralbidv 3184 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2419, 20, 233anbi123d 1436 . . . . . 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 32024 . . . . . . 7 ( I ↾ ℋ) ∈ LinOp
26 f1oi 6900 . . . . . . . 8 ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
27 f1ofo 6869 . . . . . . . 8 (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ–onto→ ℋ)
2826, 27ax-mp 5 . . . . . . 7 ( I ↾ ℋ): ℋ–onto→ ℋ
29 fvresi 7207 . . . . . . . . 9 (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
3029fveq2d 6924 . . . . . . . 8 (𝑦 ∈ ℋ → (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3130rgen 3069 . . . . . . 7 𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦)
3225, 28, 313pm3.2i 1339 . . . . . 6 (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3318, 24, 32elimhyp 4613 . . . . 5 (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦))
3433simp1i 1139 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp
3533simp2i 1140 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ
3633simp3i 1141 . . . 4 𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)
3734, 35, 36lnopunii 32044 . . 3 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp
387, 37dedth 4606 . 2 ((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)) → 𝑇 ∈ UniOp)
396, 38impbii 209 1 (𝑇 ∈ UniOp ↔ (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  w3a 1087   = wceq 1537  wcel 2108  wral 3067  ifcif 4548   I cid 5592  cres 5702  ontowfo 6571  1-1-ontowf1o 6572  cfv 6573  (class class class)co 7448  chba 30951   ·ih csp 30954  normcno 30955  LinOpclo 30979  UniOpcuo 30981
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261  ax-pre-sup 11262  ax-hilex 31031  ax-hfvadd 31032  ax-hvcom 31033  ax-hvass 31034  ax-hv0cl 31035  ax-hvaddid 31036  ax-hfvmul 31037  ax-hvmulid 31038  ax-hvdistr2 31041  ax-hvmul0 31042  ax-hfi 31111  ax-his1 31114  ax-his2 31115  ax-his3 31116  ax-his4 31117
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-sup 9511  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-div 11948  df-nn 12294  df-2 12356  df-3 12357  df-n0 12554  df-z 12640  df-uz 12904  df-rp 13058  df-seq 14053  df-exp 14113  df-cj 15148  df-re 15149  df-im 15150  df-sqrt 15284  df-hnorm 31000  df-hvsub 31003  df-lnop 31873  df-unop 31875
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator