Theorem hlimi 31783

Description: Express the predicate: The limit of vector sequence 𝐹 in a Hilbert space is 𝐴, i.e. 𝐹 converges to 𝐴. This means that for any real 𝑥, no matter how small, there always exists an integer 𝑦 such that the norm of any later vector in the sequence minus the limit is less than 𝑥. Definition of converge in [Beran] p. 96. (Contributed by NM, 16-Aug-1999.) (Revised by Mario Carneiro, 14-May-2014.) (New usage is discouraged.)

Hypothesis

Ref	Expression
hlim.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
hlimi	⊢ (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐹   𝑥,𝐴,𝑦,𝑧

Proof of Theorem hlimi

Dummy variables 𝑤 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-hlim 31567	. . . 4 ⊢ ⇝𝑣 = {⟨𝑓, 𝑤⟩ ∣ ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥)}
2	1	relopabiv 5798	. . 3 ⊢ Rel ⇝𝑣
3	2	brrelex1i 5707	. 2 ⊢ (𝐹 ⇝𝑣 𝐴 → 𝐹 ∈ V)
4		nnex 12334	. . . 4 ⊢ ℕ ∈ V
5		fex 7230	. . . 4 ⊢ ((𝐹:ℕ⟶ ℋ ∧ ℕ ∈ V) → 𝐹 ∈ V)
6	4, 5	mpan2 704	. . 3 ⊢ (𝐹:ℕ⟶ ℋ → 𝐹 ∈ V)
7	6	ad2antrr 739	. 2 ⊢ (((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥) → 𝐹 ∈ V)
8		hlim.1	. . 3 ⊢ 𝐴 ∈ V
9		feq1 6685	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓:ℕ⟶ ℋ ↔ 𝐹:ℕ⟶ ℋ))
10		eleq1 2849	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝑤 ∈ ℋ ↔ 𝐴 ∈ ℋ))
11	9, 10	bi2anan9 650	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ↔ (𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ)))
12		fveq1 6882	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑧) = (𝐹‘𝑧))
13		oveq12 7427	. . . . . . . . . 10 ⊢ (((𝑓‘𝑧) = (𝐹‘𝑧) ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴))
14	12, 13	sylan 592	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴))
15	14	fveq2d 6887	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) = (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)))
16	15	breq1d 5113	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
17	16	rexralbidv 3229	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
18	17	ralbidv 3186	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
19	11, 18	anbi12d 644	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥) ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)))
20	19, 1	brabga 5508	. . 3 ⊢ ((𝐹 ∈ V ∧ 𝐴 ∈ V) → (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)))
21	8, 20	mpan2 704	. 2 ⊢ (𝐹 ∈ V → (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)))
22	3, 7, 21	pm5.21nii 381	1 ⊢ (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   class class class wbr 5103  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   < clt 11336  ℕcn 12328  ℤ_≥cuz 12958  ℝ⁺crp 13113   ℋchba 31514  norm_ℎcno 31518   −_ℎ cmv 31520   ⇝_𝑣 chli 31522

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-pr 5391  ax-un 7749  ax-cnex 11249  ax-1cn 11251  ax-addcl 11253

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-ral 3078  df-rex 3088  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-ov 7421  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-nn 12329  df-hlim 31567

This theorem is used by:  hlimseqi  31784  hlimveci  31785  hlimconvi  31786  hlim2  31787