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

Theorem elunop2 32608
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 32515 . . 3 (𝑇 ∈ UniOp → 𝑇 ∈ LinOp)
2 elunop 32467 . . . 4 (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·ih (𝑇‘𝑦)) = (𝑥 ·ih 𝑦)))
32simplbi 502 . . 3 (𝑇 ∈ UniOp → 𝑇: ℋ–onto→ ℋ)
4 unopnorm 32512 . . . 4 ((𝑇 ∈ UniOp ∧ 𝑥 ∈ ℋ) → (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥))
54ralrimiva 3155 . . 3 (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥))
61, 3, 53jca 1146 . 2 (𝑇 ∈ UniOp → (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)))
7 eleq1 2849 . . 3 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ UniOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp))
8 eleq1 2849 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇 ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
9 foeq1 6790 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇: ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
10 2fveq3 6888 . . . . . . . . . 10 (𝑥 = 𝑦 → (normℎ‘(𝑇‘𝑥)) = (normℎ‘(𝑇‘𝑦)))
11 fveq2 6883 . . . . . . . . . 10 (𝑥 = 𝑦 → (normℎ‘𝑥) = (normℎ‘𝑦))
1210, 11eqeq12d 2777 . . . . . . . . 9 (𝑥 = 𝑦 → ((normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥) ↔ (normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦)))
1312cbvralvw 3241 . . . . . . . 8 (∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥) ↔ ∀𝑦 ∈ ℋ (normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦))
14 fveq1 6882 . . . . . . . . . 10 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (𝑇‘𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
1514fveqeq2d 6891 . . . . . . . . 9 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → ((normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦) ↔ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦)))
1615ralbidv 3186 . . . . . . . 8 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (normℎ‘(𝑇‘𝑦)) = (normℎ‘𝑦) ↔ ∀𝑦 ∈ ℋ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦)))
1713, 16bitrid 286 . . . . . . 7 (𝑇 = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥) ↔ ∀𝑦 ∈ ℋ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦)))
188, 9, 173anbi123d 1464 . . . . . 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 2849 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ) ∈ LinOp ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp))
20 foeq1 6790 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ): ℋ–onto→ ℋ ↔ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ))
21 fveq1 6882 . . . . . . . . 9 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (( I ↾ ℋ)‘𝑦) = (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦))
2221fveqeq2d 6891 . . . . . . . 8 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → ((normℎ‘(( I ↾ ℋ)‘𝑦)) = (normℎ‘𝑦) ↔ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦)))
2322ralbidv 3186 . . . . . . 7 (( I ↾ ℋ) = if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) → (∀𝑦 ∈ ℋ (normℎ‘(( I ↾ ℋ)‘𝑦)) = (normℎ‘𝑦) ↔ ∀𝑦 ∈ ℋ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦)))
2419, 20, 233anbi123d 1464 . . . . . 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 32587 . . . . . . 7 ( I ↾ ℋ) ∈ LinOp
26 f1oi 6861 . . . . . . . 8 ( I ↾ ℋ): ℋ–1-1-onto→ ℋ
27 f1ofo 6830 . . . . . . . 8 (( I ↾ ℋ): ℋ–1-1-onto→ ℋ → ( I ↾ ℋ): ℋ–onto→ ℋ)
2826, 27ax-mp 5 . . . . . . 7 ( I ↾ ℋ): ℋ–onto→ ℋ
29 fvresi 7176 . . . . . . . . 9 (𝑦 ∈ ℋ → (( I ↾ ℋ)‘𝑦) = 𝑦)
3029fveq2d 6887 . . . . . . . 8 (𝑦 ∈ ℋ → (normℎ‘(( I ↾ ℋ)‘𝑦)) = (normℎ‘𝑦))
3130rgen 3079 . . . . . . 7 ∀𝑦 ∈ ℋ (normℎ‘(( I ↾ ℋ)‘𝑦)) = (normℎ‘𝑦)
3225, 28, 313pm3.2i 1358 . . . . . 6 (( I ↾ ℋ) ∈ LinOp ∧ ( I ↾ ℋ): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (normℎ‘(( I ↾ ℋ)‘𝑦)) = (normℎ‘𝑦))
3318, 24, 32elimhyp 4548 . . . . 5 (if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp ∧ if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ ∧ ∀𝑦 ∈ ℋ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦))
3433simp1i 1157 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) ∈ LinOp
3533simp2i 1158 . . . 4 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)): ℋ–onto→ ℋ
3633simp3i 1159 . . . 4 ∀𝑦 ∈ ℋ (normℎ‘(if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ))‘𝑦)) = (normℎ‘𝑦)
3734, 35, 36lnopunii 32607 . . 3 if((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)), 𝑇, ( I ↾ ℋ)) ∈ UniOp
387, 37dedth 4541 . 2 ((𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)) → 𝑇 ∈ UniOp)
396, 38impbii 212 1 (𝑇 ∈ UniOp ↔ (𝑇 ∈ LinOp ∧ 𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ (normℎ‘(𝑇‘𝑥)) = (normℎ‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ifcif 4482   I cid 5545   ↾ cres 5653  –onto→wfo 6535  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7418   ℋchba 31514   ·ih csp 31517  normℎcno 31518  LinOpclo 31542  UniOpcuo 31544
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270  ax-pre-sup 11271  ax-hilex 31594  ax-hfvadd 31595  ax-hvcom 31596  ax-hvass 31597  ax-hv0cl 31598  ax-hvaddid 31599  ax-hfvmul 31600  ax-hvmulid 31601  ax-hvdistr2 31604  ax-hvmul0 31605  ax-hfi 31674  ax-his1 31677  ax-his2 31678  ax-his3 31679  ax-his4 31680
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-er 8710  df-map 8842  df-en 8967  df-dom 8968  df-sdom 8969  df-sup 9427  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-div 11967  df-nn 12329  df-2 12398  df-3 12399  df-n0 12600  df-z 12687  df-uz 12959  df-rp 13114  df-seq 14138  df-exp 14198  df-cj 15259  df-re 15260  df-im 15261  df-sqrt 15395  df-hnorm 31563  df-hvsub 31566  df-lnop 32436  df-unop 32438
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator