Theorem hlimi 31847

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 31631	. . . 4 ⊢ ⇝𝑣 = {⟨𝑓, 𝑤⟩ ∣ ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥)}
2	1	relopabi 5809	. . 3 ⊢ Rel ⇝𝑣
3	2	brrelex1i 5714	. 2 ⊢ (𝐹 ⇝𝑣 𝐴 → 𝐹 ∈ V)
4		nnex 12381	. . . 4 ⊢ ℕ ∈ V
5		fex 7263	. . . 4 ⊢ ((𝐹:ℕ⟶ ℋ ∧ ℕ ∈ V) → 𝐹 ∈ V)
6	4, 5	mpan2 704	. . 3 ⊢ (𝐹:ℕ⟶ ℋ → 𝐹 ∈ V)
7	6	ad2antrr 739	. 2 ⊢ (((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥) → 𝐹 ∈ V)
8		hlim.1	. . 3 ⊢ 𝐴 ∈ V
9		feq1 6717	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓:ℕ⟶ ℋ ↔ 𝐹:ℕ⟶ ℋ))
10		eleq1 2852	. . . . . 6 ⊢ (𝑤 = 𝐴 → (𝑤 ∈ ℋ ↔ 𝐴 ∈ ℋ))
11	9, 10	bi2anan9 650	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ↔ (𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ)))
12		fveq1 6915	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑧) = (𝐹‘𝑧))
13		oveq12 7460	. . . . . . . . . 10 ⊢ (((𝑓‘𝑧) = (𝐹‘𝑧) ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴))
14	12, 13	sylan 592	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴))
15	14	fveq2d 6920	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) = (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)))
16	15	breq1d 5118	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
17	16	rexralbidv 3232	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
18	17	ralbidv 3189	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))
19	11, 18	anbi12d 644	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥) ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)))
20	19, 1	brabga 5515	. . 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 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   class class class wbr 5108  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   < clt 11382  ℕcn 12375  ℤ_≥cuz 13005  ℝ⁺crp 13160   ℋchba 31578  norm_ℎcno 31582   −_ℎ cmv 31584   ⇝_𝑣 chli 31586

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-1cn 11297  ax-addcl 11299

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-nn 12376  df-hlim 31631

This theorem is used by:  hlimseqi  31848  hlimveci  31849  hlimconvi  31850  hlim2  31851