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

Theorem elunop2 31997
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 31904 . . 3 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 elunop 31856 . . . 4 (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇𝑥) ·ih (𝑇𝑦)) = (𝑥 ·ih 𝑦)))
32simplbi 497 . . 3 (𝑇 ∈ UniOp → 𝑇: ℋ–onto→ ℋ)
4 unopnorm 31901 . . . 4 ((𝑇 ∈ UniOp ∧ 𝑥 ∈ ℋ) → (norm‘(𝑇𝑥)) = (norm𝑥))
54ralrimiva 3125 . . 3 (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥))
61, 3, 53jca 1128 . 2 (𝑇 ∈ UniOp → (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
7 eleq1 2821 . . 3 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ UniOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp))
8 eleq1 2821 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
9 foeq1 6738 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇: ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
10 2fveq3 6835 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm‘(𝑇𝑥)) = (norm‘(𝑇𝑦)))
11 fveq2 6830 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm𝑥) = (norm𝑦))
1210, 11eqeq12d 2749 . . . . . . . . 9 (𝑥 = 𝑦 → ((norm‘(𝑇𝑥)) = (norm𝑥) ↔ (norm‘(𝑇𝑦)) = (norm𝑦)))
1312cbvralvw 3211 . . . . . . . 8 (∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥) ↔ ∀𝑦 ∈ ℋ (norm‘(𝑇𝑦)) = (norm𝑦))
14 fveq1 6829 . . . . . . . . . 10 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
1514fveqeq2d 6838 . . . . . . . . 9 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
1615ralbidv 3156 . . . . . . . 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 1438 . . . . . 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 2821 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
20 foeq1 6738 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ): ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
21 fveq1 6829 . . . . . . . . 9 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
2221fveqeq2d 6838 . . . . . . . 8 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2322ralbidv 3156 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2419, 20, 233anbi123d 1438 . . . . . 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 31976 . . . . . . 7 ( I ↾ ℋ) ∈ LinOp
26 f1oi 6808 . . . . . . . 8 ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
27 f1ofo 6777 . . . . . . . 8 (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ–onto→ ℋ)
2826, 27ax-mp 5 . . . . . . 7 ( I ↾ ℋ): ℋ–onto→ ℋ
29 fvresi 7115 . . . . . . . . 9 (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
3029fveq2d 6834 . . . . . . . 8 (𝑦 ∈ ℋ → (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3130rgen 3050 . . . . . . 7 𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦)
3225, 28, 313pm3.2i 1340 . . . . . 6 (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3318, 24, 32elimhyp 4542 . . . . 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 31996 . . 3 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp
387, 37dedth 4535 . 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 1086   = wceq 1541  wcel 2113  wral 3048  ifcif 4476   I cid 5515  cres 5623  ontowfo 6486  1-1-ontowf1o 6487  cfv 6488  (class class class)co 7354  chba 30903   ·ih csp 30906  normcno 30907  LinOpclo 30931  UniOpcuo 30933
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7676  ax-cnex 11071  ax-resscn 11072  ax-1cn 11073  ax-icn 11074  ax-addcl 11075  ax-addrcl 11076  ax-mulcl 11077  ax-mulrcl 11078  ax-mulcom 11079  ax-addass 11080  ax-mulass 11081  ax-distr 11082  ax-i2m1 11083  ax-1ne0 11084  ax-1rid 11085  ax-rnegex 11086  ax-rrecex 11087  ax-cnre 11088  ax-pre-lttri 11089  ax-pre-lttrn 11090  ax-pre-ltadd 11091  ax-pre-mulgt0 11092  ax-pre-sup 11093  ax-hilex 30983  ax-hfvadd 30984  ax-hvcom 30985  ax-hvass 30986  ax-hv0cl 30987  ax-hvaddid 30988  ax-hfvmul 30989  ax-hvmulid 30990  ax-hvdistr2 30993  ax-hvmul0 30994  ax-hfi 31063  ax-his1 31066  ax-his2 31067  ax-his3 31068  ax-his4 31069
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-riota 7311  df-ov 7357  df-oprab 7358  df-mpo 7359  df-om 7805  df-2nd 7930  df-frecs 8219  df-wrecs 8250  df-recs 8299  df-rdg 8337  df-er 8630  df-map 8760  df-en 8878  df-dom 8879  df-sdom 8880  df-sup 9335  df-pnf 11157  df-mnf 11158  df-xr 11159  df-ltxr 11160  df-le 11161  df-sub 11355  df-neg 11356  df-div 11784  df-nn 12135  df-2 12197  df-3 12198  df-n0 12391  df-z 12478  df-uz 12741  df-rp 12895  df-seq 13913  df-exp 13973  df-cj 15010  df-re 15011  df-im 15012  df-sqrt 15146  df-hnorm 30952  df-hvsub 30955  df-lnop 31825  df-unop 31827
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator