HomeHome Hilbert Space Explorer < Previous   Next >
Related theorems
GIF version

Theorem chsscm 5147
Description: The hypothesis defines the set of complete subspaces of Hilbert space. A complete subspace is one in which every Cauchy sequence of vectors in the subspace converges to a member of the subspace (Definition of complete subspace in [Beran] p. 96). Any closed subspace of a Hilbert space is complete. Part of Remark 3.12 of [Beran] p. 107.
Hypothesis
Ref Expression
cmh.1 C = {h∣(hS ∧ ∀f ∈ Cauchy (f:ℕ–→h → ∃xh fv x))}
Assertion
Ref Expression
chsscm CC
Distinct variable group(s):   x,f,h   C,h

Proof of Theorem chsscm
StepHypRef Expression
1 impexp 276 . . . . . . . . . . . . . . . 16 (((f:ℕ–→hfv x) → xh) ↔ (f:ℕ–→h → (fv xxh)))
2 ancr 243 . . . . . . . . . . . . . . . . . 18 ((fv xxh) → (fv x → (xhfv x)))
32adantld 307 . . . . . . . . . . . . . . . . 17 ((fv xxh) → ((x ∈ ℋ ∧ fv x) → (xhfv x)))
43syl3 18 . . . . . . . . . . . . . . . 16 ((f:ℕ–→h → (fv xxh)) → (f:ℕ–→h → ((x ∈ ℋ ∧ fv x) → (xhfv x))))
51, 4sylbi 174 . . . . . . . . . . . . . . 15 (((f:ℕ–→hfv x) → xh) → (f:ℕ–→h → ((x ∈ ℋ ∧ fv x) → (xhfv x))))
65com12 13 . . . . . . . . . . . . . 14 (f:ℕ–→h → (((f:ℕ–→hfv x) → xh) → ((x ∈ ℋ ∧ fv x) → (xhfv x))))
7619.20dv 946 . . . . . . . . . . . . 13 (f:ℕ–→h → (∀x((f:ℕ–→hfv x) → xh) → ∀x((x ∈ ℋ ∧ fv x) → (xhfv x))))
87com12 13 . . . . . . . . . . . 12 (∀x((f:ℕ–→hfv x) → xh) → (f:ℕ–→h → ∀x((x ∈ ℋ ∧ fv x) → (xhfv x))))
98imp 277 . . . . . . . . . . 11 ((∀x((f:ℕ–→hfv x) → xh) ∧ f:ℕ–→h) → ∀x((x ∈ ℋ ∧ fv x) → (xhfv x)))
10 19.22 722 . . . . . . . . . . 11 (∀x((x ∈ ℋ ∧ fv x) → (xhfv x)) → (∃x(x ∈ ℋ ∧ fv x) → ∃x(xhfv x)))
119, 10syl 12 . . . . . . . . . 10 ((∀x((f:ℕ–→hfv x) → xh) ∧ f:ℕ–→h) → (∃x(x ∈ ℋ ∧ fv x) → ∃x(xhfv x)))
12 df-rex 1206 . . . . . . . . . 10 (∃x ∈ ℋ fv x ↔ ∃x(x ∈ ℋ ∧ fv x))
13 df-rex 1206 . . . . . . . . . 10 (∃xh fv x ↔ ∃x(xhfv x))
1411, 12, 133imtr4g 426 . . . . . . . . 9 ((∀x((f:ℕ–→hfv x) → xh) ∧ f:ℕ–→h) → (∃x ∈ ℋ fv x → ∃xh fv x))
15 ax-hcompl 5113 . . . . . . . . 9 (f ∈ Cauchy → ∃x ∈ ℋ fv x)
1614, 15syl5 22 . . . . . . . 8 ((∀x((f:ℕ–→hfv x) → xh) ∧ f:ℕ–→h) → (f ∈ Cauchy → ∃xh fv x))
1716exp 291 . . . . . . 7 (∀x((f:ℕ–→hfv x) → xh) → (f:ℕ–→h → (f ∈ Cauchy → ∃xh fv x)))
1817com23 32 . . . . . 6 (∀x((f:ℕ–→hfv x) → xh) → (f ∈ Cauchy → (f:ℕ–→h → ∃xh fv x)))
191819.20i 691 . . . . 5 (∀fx((f:ℕ–→hfv x) → xh) → ∀f(f ∈ Cauchy → (f:ℕ–→h → ∃xh fv x)))
20 df-ral 1205 . . . . 5 (∀f ∈ Cauchy (f:ℕ–→h → ∃xh fv x) ↔ ∀f(f ∈ Cauchy → (f:ℕ–→h → ∃xh fv x)))
2119, 20sylibr 175 . . . 4 (∀fx((f:ℕ–→hfv x) → xh) → ∀f ∈ Cauchy (f:ℕ–→h → ∃xh fv x))
2221anim2i 270 . . 3 ((hS ∧ ∀fx((f:ℕ–→hfv x) → xh)) → (hS ∧ ∀f ∈ Cauchy (f:ℕ–→h → ∃xh fv x)))
23 closedsub 5128 . . 3 (hC ↔ (hS ∧ ∀fx((f:ℕ–→hfv x) → xh)))
24 cmh.1 . . . 4 C = {h∣(hS ∧ ∀f ∈ Cauchy (f:ℕ–→h → ∃xh fv x))}
2524cleqabi 1176 . . 3 (hC ↔ (hS ∧ ∀f ∈ Cauchy (f:ℕ–→h → ∃xh fv x)))
2622, 23, 253imtr4 192 . 2 (hChC)
2726ssriv 1508 1 CC
Colors of variables: wff set class
Syntax hints:   → wi 2   ∧ wa 196  ∀wal 672  ∃wex 678   ∈ wel 803  {cab 1090   = wceq 1091   ∈ wcel 1092  ∀wral 1201  ∃wrex 1202   ⊆ wss 1487   class class class wbr 2054  –→wf 2418  ℕcn 4093   ℋ chil 4958  Cauchyccau 4965   ⇝v chli 4966   S csh 4967   C cch 4968
This theorem is referenced by:  chcmh 5148
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074  ax-hcompl 5113
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-in 1491  df-ss 1492  df-f 2434  df-ch 5127
metamath.org