Metamath Proof Explorer


Theorem htth

Description: Hellinger-Toeplitz Theorem: any self-adjoint linear operator defined on all of Hilbert space is bounded. Theorem 10.1-1 of Kreyszig p. 525. Discovered by E. Hellinger and O. Toeplitz in 1910, "it aroused both admiration and puzzlement since the theorem establishes a relation between properties of two different kinds, namely, the properties of being defined everywhere and being bounded." (Contributed by NM, 11-Jan-2008) (Revised by Mario Carneiro, 23-Aug-2014) (New usage is discouraged.)

Ref Expression
Hypotheses htth.1 ⊢ X = BaseSet ⁡ U
htth.2 ⊢ P = ⋅ 𝑖OLD ⁡ U
htth.3 ⊢ L = U LnOp U
htth.4 ⊢ B = U BLnOp U
Assertion htth ⊢ U ∈ CHil OLD ∧ T ∈ L ∧ ∀ x ∈ X ∀ y ∈ X x P T ⁡ y = T ⁡ x P y → T ∈ B

Proof

Step Hyp Ref Expression
1 htth.1 ⊢ X = BaseSet ⁡ U
2 htth.2 ⊢ P = ⋅ 𝑖OLD ⁡ U
3 htth.3 ⊢ L = U LnOp U
4 htth.4 ⊢ B = U BLnOp U
5 oveq12 ⊢ U = if U ∈ CHil OLD U + × abs ∧ U = if U ∈ CHil OLD U + × abs → U LnOp U = if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs
6 5 anidms ⊢ U = if U ∈ CHil OLD U + × abs → U LnOp U = if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs
7 3 6 eqtrid ⊢ U = if U ∈ CHil OLD U + × abs → L = if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs
8 7 eleq2d ⊢ U = if U ∈ CHil OLD U + × abs → T ∈ L ↔ T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs
9 fveq2 ⊢ U = if U ∈ CHil OLD U + × abs → BaseSet ⁡ U = BaseSet ⁡ if U ∈ CHil OLD U + × abs
10 1 9 eqtrid ⊢ U = if U ∈ CHil OLD U + × abs → X = BaseSet ⁡ if U ∈ CHil OLD U + × abs
11 fveq2 ⊢ U = if U ∈ CHil OLD U + × abs → ⋅ 𝑖OLD ⁡ U = ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs
12 2 11 eqtrid ⊢ U = if U ∈ CHil OLD U + × abs → P = ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs
13 12 oveqd ⊢ U = if U ∈ CHil OLD U + × abs → x P T ⁡ y = x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y
14 12 oveqd ⊢ U = if U ∈ CHil OLD U + × abs → T ⁡ x P y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
15 13 14 eqeq12d ⊢ U = if U ∈ CHil OLD U + × abs → x P T ⁡ y = T ⁡ x P y ↔ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
16 10 15 raleqbidv ⊢ U = if U ∈ CHil OLD U + × abs → ∀ y ∈ X x P T ⁡ y = T ⁡ x P y ↔ ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
17 10 16 raleqbidv ⊢ U = if U ∈ CHil OLD U + × abs → ∀ x ∈ X ∀ y ∈ X x P T ⁡ y = T ⁡ x P y ↔ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
18 8 17 anbi12d ⊢ U = if U ∈ CHil OLD U + × abs → T ∈ L ∧ ∀ x ∈ X ∀ y ∈ X x P T ⁡ y = T ⁡ x P y ↔ T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs ∧ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
19 oveq12 ⊢ U = if U ∈ CHil OLD U + × abs ∧ U = if U ∈ CHil OLD U + × abs → U BLnOp U = if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
20 19 anidms ⊢ U = if U ∈ CHil OLD U + × abs → U BLnOp U = if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
21 4 20 eqtrid ⊢ U = if U ∈ CHil OLD U + × abs → B = if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
22 21 eleq2d ⊢ U = if U ∈ CHil OLD U + × abs → T ∈ B ↔ T ∈ if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
23 18 22 imbi12d ⊢ U = if U ∈ CHil OLD U + × abs → T ∈ L ∧ ∀ x ∈ X ∀ y ∈ X x P T ⁡ y = T ⁡ x P y → T ∈ B ↔ T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs ∧ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y → T ∈ if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
24 eqid ⊢ BaseSet ⁡ if U ∈ CHil OLD U + × abs = BaseSet ⁡ if U ∈ CHil OLD U + × abs
25 eqid ⊢ ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs = ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs
26 eqid ⊢ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs = if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs
27 eqid ⊢ if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs = if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
28 eqid ⊢ norm CV ⁡ if U ∈ CHil OLD U + × abs = norm CV ⁡ if U ∈ CHil OLD U + × abs
29 eqid ⊢ + × abs = + × abs
30 29 cnchl ⊢ + × abs ∈ CHil OLD
31 30 elimel ⊢ if U ∈ CHil OLD U + × abs ∈ CHil OLD
32 simpl ⊢ T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs ∧ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y → T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs
33 oveq1 ⊢ x = u → x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y
34 fveq2 ⊢ x = u → T ⁡ x = T ⁡ u
35 34 oveq1d ⊢ x = u → T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
36 33 35 eqeq12d ⊢ x = u → x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y ↔ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y
37 fveq2 ⊢ y = v → T ⁡ y = T ⁡ v
38 37 oveq2d ⊢ y = v → u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ v
39 oveq2 ⊢ y = v → T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs v
40 38 39 eqeq12d ⊢ y = v → u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y ↔ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ v = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs v
41 36 40 cbvral2vw ⊢ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y ↔ ∀ u ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ v ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ v = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs v
42 41 bilani ⊢ T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs ∧ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y → ∀ u ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ v ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ v = T ⁡ u ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs v
43 oveq1 ⊢ y = w → y ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x = w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x
44 43 cbvmptv ⊢ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x = w ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x
45 fveq2 ⊢ x = z → T ⁡ x = T ⁡ z
46 45 oveq2d ⊢ x = z → w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x = w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ z
47 46 mpteq2dv ⊢ x = z → w ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x = w ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ z
48 44 47 eqtrid ⊢ x = z → y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x = w ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ z
49 48 cbvmptv ⊢ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x = z ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ w ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ w ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ z
50 fveq2 ⊢ x = z → norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ x = norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ z
51 50 breq1d ⊢ x = z → norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ x ≤ 1 ↔ norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ z ≤ 1
52 51 cbvrabv ⊢ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs | norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ x ≤ 1 = z ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs | norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ z ≤ 1
53 52 imaeq2i ⊢ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs | norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ x ≤ 1 = x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ⟼ y ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ x z ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs | norm CV ⁡ if U ∈ CHil OLD U + × abs ⁡ z ≤ 1
54 24 25 26 27 28 31 29 32 42 49 53 htthlem ⊢ T ∈ if U ∈ CHil OLD U + × abs LnOp if U ∈ CHil OLD U + × abs ∧ ∀ x ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs ∀ y ∈ BaseSet ⁡ if U ∈ CHil OLD U + × abs x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs T ⁡ y = T ⁡ x ⋅ 𝑖OLD ⁡ if U ∈ CHil OLD U + × abs y → T ∈ if U ∈ CHil OLD U + × abs BLnOp if U ∈ CHil OLD U + × abs
55 23 54 dedth ⊢ U ∈ CHil OLD → T ∈ L ∧ ∀ x ∈ X ∀ y ∈ X x P T ⁡ y = T ⁡ x P y → T ∈ B
56 55 3impib ⊢ U ∈ CHil OLD ∧ T ∈ L ∧ ∀ x ∈ X ∀ y ∈ X x P T ⁡ y = T ⁡ x P y → T ∈ B