Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > hlimi | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
hlim.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
hlimi | ⊢ (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-hlim 28749 | . . . 4 ⊢ ⇝𝑣 = {〈𝑓, 𝑤〉 ∣ ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥)} | |
2 | 1 | relopabi 5694 | . . 3 ⊢ Rel ⇝𝑣 |
3 | 2 | brrelex1i 5608 | . 2 ⊢ (𝐹 ⇝𝑣 𝐴 → 𝐹 ∈ V) |
4 | nnex 11644 | . . . 4 ⊢ ℕ ∈ V | |
5 | fex 6989 | . . . 4 ⊢ ((𝐹:ℕ⟶ ℋ ∧ ℕ ∈ V) → 𝐹 ∈ V) | |
6 | 4, 5 | mpan2 689 | . . 3 ⊢ (𝐹:ℕ⟶ ℋ → 𝐹 ∈ V) |
7 | 6 | ad2antrr 724 | . 2 ⊢ (((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥) → 𝐹 ∈ V) |
8 | hlim.1 | . . 3 ⊢ 𝐴 ∈ V | |
9 | feq1 6495 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓:ℕ⟶ ℋ ↔ 𝐹:ℕ⟶ ℋ)) | |
10 | eleq1 2900 | . . . . . 6 ⊢ (𝑤 = 𝐴 → (𝑤 ∈ ℋ ↔ 𝐴 ∈ ℋ)) | |
11 | 9, 10 | bi2anan9 637 | . . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ↔ (𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ))) |
12 | fveq1 6669 | . . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑧) = (𝐹‘𝑧)) | |
13 | oveq12 7165 | . . . . . . . . . 10 ⊢ (((𝑓‘𝑧) = (𝐹‘𝑧) ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴)) | |
14 | 12, 13 | sylan 582 | . . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((𝑓‘𝑧) −ℎ 𝑤) = ((𝐹‘𝑧) −ℎ 𝐴)) |
15 | 14 | fveq2d 6674 | . . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) = (normℎ‘((𝐹‘𝑧) −ℎ 𝐴))) |
16 | 15 | breq1d 5076 | . . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → ((normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ (normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)) |
17 | 16 | rexralbidv 3301 | . . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)) |
18 | 17 | ralbidv 3197 | . . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)) |
19 | 11, 18 | anbi12d 632 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐴) → (((𝑓:ℕ⟶ ℋ ∧ 𝑤 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝑓‘𝑧) −ℎ 𝑤)) < 𝑥) ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))) |
20 | 19, 1 | brabga 5421 | . . 3 ⊢ ((𝐹 ∈ V ∧ 𝐴 ∈ V) → (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))) |
21 | 8, 20 | mpan2 689 | . 2 ⊢ (𝐹 ∈ V → (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥))) |
22 | 3, 7, 21 | pm5.21nii 382 | 1 ⊢ (𝐹 ⇝𝑣 𝐴 ↔ ((𝐹:ℕ⟶ ℋ ∧ 𝐴 ∈ ℋ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℕ ∀𝑧 ∈ (ℤ≥‘𝑦)(normℎ‘((𝐹‘𝑧) −ℎ 𝐴)) < 𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 ∃wrex 3139 Vcvv 3494 class class class wbr 5066 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 < clt 10675 ℕcn 11638 ℤ≥cuz 12244 ℝ+crp 12390 ℋchba 28696 normℎcno 28700 −ℎ cmv 28702 ⇝𝑣 chli 28704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-1cn 10595 ax-addcl 10597 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-nn 11639 df-hlim 28749 |
This theorem is referenced by: hlimseqi 28966 hlimveci 28967 hlimconvi 28968 hlim2 28969 |
Copyright terms: Public domain | W3C validator |