Theorem hlim 5108

Description: Express the predicate: The limit of vector sequence F in a Hilbert space is A, i.e. F converges to A. This means that for any real x, no matter how small, there always exists an integer y such that the norm of any later vector in the sequence minus the limit is less than x. Definition of converge in [Beran] p. 96.

Hypotheses

Ref	Expression
hlim.1	⊢ F ∈ V
hlim.2	⊢ A ∈ V

Assertion

Ref	Expression
hlim	⊢ (F ⇝v A ↔ ((F:ℕ–→ ℋ ∧ A ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x))))

Distinct variable group(s):   x,y,z,F   x,A,y,z

Proof of Theorem hlim

Step	Hyp	Ref	Expression
1		hlim.1	. 2 ⊢ F ∈ V
2		hlim.2	. 2 ⊢ A ∈ V
3		feq1 2748	. . . 4 ⊢ (f = F → (f:ℕ–→ ℋ ↔ F:ℕ–→ ℋ ))
4	3	anbi1d 469	. . 3 ⊢ (f = F → ((f:ℕ–→ ℋ ∧ w ∈ ℋ ) ↔ (F:ℕ–→ ℋ ∧ w ∈ ℋ )))
5		fveq1 2831	. . . . . . . . . . 11 ⊢ (f = F → (f ‘z) = (F ‘z))
6	5	opreq1d 3012	. . . . . . . . . 10 ⊢ (f = F → ((f ‘z) −v w) = ((F ‘z) −v w))
7	6	fveq2d 2836	. . . . . . . . 9 ⊢ (f = F → (norm ‘((f ‘z) −v w)) = (norm ‘((F ‘z) −v w)))
8	7	breq1d 2071	. . . . . . . 8 ⊢ (f = F → ((norm ‘((f ‘z) −v w)) < x ↔ (norm ‘((F ‘z) −v w)) < x))
9	8	imbi2d 464	. . . . . . 7 ⊢ (f = F → ((y ≤ z → (norm ‘((f ‘z) −v w)) < x) ↔ (y ≤ z → (norm ‘((F ‘z) −v w)) < x)))
10	9	biraldv 1219	. . . . . 6 ⊢ (f = F → (∀z ∈ ℕ (y ≤ z → (norm ‘((f ‘z) −v w)) < x) ↔ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x)))
11	10	birexdv 1220	. . . . 5 ⊢ (f = F → (∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((f ‘z) −v w)) < x) ↔ ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x)))
12	11	imbi2d 464	. . . 4 ⊢ (f = F → ((0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((f ‘z) −v w)) < x)) ↔ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x))))
13	12	biraldv 1219	. . 3 ⊢ (f = F → (∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((f ‘z) −v w)) < x)) ↔ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x))))
14	4, 13	anbi12d 476	. 2 ⊢ (f = F → (((f:ℕ–→ ℋ ∧ w ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((f ‘z) −v w)) < x))) ↔ ((F:ℕ–→ ℋ ∧ w ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x)))))
15		eleq1 1149	. . . 4 ⊢ (w = A → (w ∈ ℋ ↔ A ∈ ℋ ))
16	15	anbi2d 468	. . 3 ⊢ (w = A → ((F:ℕ–→ ℋ ∧ w ∈ ℋ ) ↔ (F:ℕ–→ ℋ ∧ A ∈ ℋ )))
17		opreq2 3007	. . . . . . . . . 10 ⊢ (w = A → ((F ‘z) −v w) = ((F ‘z) −v A))
18	17	fveq2d 2836	. . . . . . . . 9 ⊢ (w = A → (norm ‘((F ‘z) −v w)) = (norm ‘((F ‘z) −v A)))
19	18	breq1d 2071	. . . . . . . 8 ⊢ (w = A → ((norm ‘((F ‘z) −v w)) < x ↔ (norm ‘((F ‘z) −v A)) < x))
20	19	imbi2d 464	. . . . . . 7 ⊢ (w = A → ((y ≤ z → (norm ‘((F ‘z) −v w)) < x) ↔ (y ≤ z → (norm ‘((F ‘z) −v A)) < x)))
21	20	biraldv 1219	. . . . . 6 ⊢ (w = A → (∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x) ↔ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x)))
22	21	birexdv 1220	. . . . 5 ⊢ (w = A → (∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x) ↔ ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x)))
23	22	imbi2d 464	. . . 4 ⊢ (w = A → ((0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x)) ↔ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x))))
24	23	biraldv 1219	. . 3 ⊢ (w = A → (∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x)) ↔ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x))))
25	16, 24	anbi12d 476	. 2 ⊢ (w = A → (((F:ℕ–→ ℋ ∧ w ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v w)) < x))) ↔ ((F:ℕ–→ ℋ ∧ A ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x)))))
26		df-hlim 5107	. 2 ⊢ ⇝v = {⟨f, w⟩∣((f:ℕ–→ ℋ ∧ w ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((f ‘z) −v w)) < x)))}
27	1, 2, 14, 25, 26	brab 2118	1 ⊢ (F ⇝v A ↔ ((F:ℕ–→ ℋ ∧ A ∈ ℋ ) ∧ ∀x ∈ ℝ (0 < x → ∃y ∈ ℕ ∀z ∈ ℕ (y ≤ z → (norm ‘((F ‘z) −v A)) < x))))

Syntax hints:   → wi 2   ↔ wb 127   ∧ wa 196   = wceq 1091   ∈ wcel 1092  ∀wral 1201  ∃wrex 1202  Vcvv 1348   class class class wbr 2054  –→wf 2418   ‘cfv 2422  (class class class)co 3001  ℝcr 4027  0cc0 4028   < clt 4033   ≤ cle 4092  ℕcn 4093   ℋ chil 4958   −_v cmv 4962  normcno 4964   ⇝_v chli 4966

This theorem is referenced by:  hlimseq 5109  hlimvec 5110  hlimconv 5111  hlim0 5140  occllem6 5185  osumlem4 5533

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-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-fv 2438  df-opr 3003  df-hlim 5107

metamath.org