Theorem hlimi 31797

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 31581	. . . 4 ⊢ ⇝𝑣 = {⟨𝑓, 𝑤⟩ ∣ ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥)}
2	1	relopabiv 5798	. . 3 ⊢ Rel ⇝𝑣
3	2	brrelex1i 5706	. 2 ⊢ (𝐹 ⇝𝑣 𝐴 → 𝐹 ∈ V)
4		nnex 12346	. . . 4 ⊢ ℕ ∈ V
5		fex 7234	. . . 4 ⊢ ((𝐹:ℕ⟶ ℋ ∧ ℕ ∈ V) → 𝐹 ∈ V)
6	4, 5	mpan2 704	. . 3 ⊢ (𝐹:ℕ⟶ ℋ → 𝐹 ∈ V)
7	6	ad2antrr 739	. 2 ⊢ (((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥) → 𝐹 ∈ V)
8		hlim.1	. . 3 ⊢ 𝐴 ∈ V
9		feq1 6690	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓:ℕ⟶ ℋ ↔ 𝐹:ℕ⟶ ℋ))
10		eleq1 2848	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝑤 ∈ ℋ ↔ 𝐴 ∈ ℋ))
11	9, 10	bi2anan9 650	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ↔ (𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ)))
12		fveq1 6887	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑧) = (𝐹‘𝑧))
13		oveq12 7431	. . . . . . . . . 10 ⊢ (((𝑓‘𝑧) = (𝐹‘𝑧) ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴))
14	12, 13	sylan 592	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴))
15	14	fveq2d 6892	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) = (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)))
16	15	breq1d 5112	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
17	16	rexralbidv 3228	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
18	17	ralbidv 3185	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
19	11, 18	anbi12d 644	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥) ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)))
20	19, 1	brabga 5507	. . 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 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  Vcvv 3450   class class class wbr 5102  ⟶wf 6537  ‘cfv 6541  (class class class)co 7422   < clt 11348  ℕcn 12340  ℤ_≥cuz 12970  ℝ⁺crp 13125   ℋchba 31528  norm_ℎcno 31532   −_ℎ cmv 31534   ⇝_𝑣 chli 31536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7753  ax-cnex 11261  ax-1cn 11263  ax-addcl 11265

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7425  df-om 7880  df-2nd 8004  df-frecs 8304  df-wrecs 8335  df-recs 8384  df-rdg 8423  df-nn 12341  df-hlim 31581

This theorem is used by:  hlimseqi  31798  hlimveci  31799  hlimconvi  31800  hlim2  31801