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

Theorem elunop2 32084
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 31991 . . 3 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 elunop 31943 . . . 4 (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇𝑥) ·ih (𝑇𝑦)) = (𝑥 ·ih 𝑦)))
32simplbi 496 . . 3 (𝑇 ∈ UniOp → 𝑇: ℋ–onto→ ℋ)
4 unopnorm 31988 . . . 4 ((𝑇 ∈ UniOp ∧ 𝑥 ∈ ℋ) → (norm‘(𝑇𝑥)) = (norm𝑥))
54ralrimiva 3129 . . 3 (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥))
61, 3, 53jca 1129 . 2 (𝑇 ∈ UniOp → (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)))
7 eleq1 2824 . . 3 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ UniOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp))
8 eleq1 2824 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
9 foeq1 6748 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇: ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
10 2fveq3 6845 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm‘(𝑇𝑥)) = (norm‘(𝑇𝑦)))
11 fveq2 6840 . . . . . . . . . 10 (𝑥 = 𝑦 → (norm𝑥) = (norm𝑦))
1210, 11eqeq12d 2752 . . . . . . . . 9 (𝑥 = 𝑦 → ((norm‘(𝑇𝑥)) = (norm𝑥) ↔ (norm‘(𝑇𝑦)) = (norm𝑦)))
1312cbvralvw 3215 . . . . . . . 8 (∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥) ↔ ∀𝑦 ∈ ℋ (norm‘(𝑇𝑦)) = (norm𝑦))
14 fveq1 6839 . . . . . . . . . 10 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
1514fveqeq2d 6848 . . . . . . . . 9 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(𝑇𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
1615ralbidv 3160 . . . . . . . 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 1439 . . . . . 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 2824 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
20 foeq1 6748 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ): ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
21 fveq1 6839 . . . . . . . . 9 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
2221fveqeq2d 6848 . . . . . . . 8 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → ((norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2322ralbidv 3160 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦) ↔ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)))
2419, 20, 233anbi123d 1439 . . . . . 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 32063 . . . . . . 7 ( I ↾ ℋ) ∈ LinOp
26 f1oi 6818 . . . . . . . 8 ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
27 f1ofo 6787 . . . . . . . 8 (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ–onto→ ℋ)
2826, 27ax-mp 5 . . . . . . 7 ( I ↾ ℋ): ℋ–onto→ ℋ
29 fvresi 7128 . . . . . . . . 9 (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
3029fveq2d 6844 . . . . . . . 8 (𝑦 ∈ ℋ → (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3130rgen 3053 . . . . . . 7 𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦)
3225, 28, 313pm3.2i 1341 . . . . . 6 (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(( I ↾ ℋ)‘𝑦)) = (norm𝑦))
3318, 24, 32elimhyp 4532 . . . . 5 (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦))
3433simp1i 1140 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp
3533simp2i 1141 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ
3633simp3i 1142 . . . 4 𝑦 ∈ ℋ (norm‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (norm𝑦)
3734, 35, 36lnopunii 32083 . . 3 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (norm‘(𝑇𝑥)) = (norm𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp
387, 37dedth 4525 . 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 1542  wcel 2114  wral 3051  ifcif 4466   I cid 5525  cres 5633  ontowfo 6496  1-1-ontowf1o 6497  cfv 6498  (class class class)co 7367  chba 30990   ·ih csp 30993  normcno 30994  LinOpclo 31018  UniOpcuo 31020
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116  ax-hilex 31070  ax-hfvadd 31071  ax-hvcom 31072  ax-hvass 31073  ax-hv0cl 31074  ax-hvaddid 31075  ax-hfvmul 31076  ax-hvmulid 31077  ax-hvdistr2 31080  ax-hvmul0 31081  ax-hfi 31150  ax-his1 31153  ax-his2 31154  ax-his3 31155  ax-his4 31156
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-sup 9355  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-3 12245  df-n0 12438  df-z 12525  df-uz 12789  df-rp 12943  df-seq 13964  df-exp 14024  df-cj 15061  df-re 15062  df-im 15063  df-sqrt 15197  df-hnorm 31039  df-hvsub 31042  df-lnop 31912  df-unop 31914
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator