Metamath Proof Explorer


Theorem lmmbrf

Description: Express the binary relation "sequence F converges to point P " in a metric space using an arbitrary upper set of integers. This version of lmmbr2 presupposes that F is a function. (Contributed by NM, 20-Jul-2007) (Revised by Mario Carneiro, 1-May-2014)

Ref Expression
Hypotheses lmmbr.2 ⊢ J = MetOpen ⁡ D
lmmbr.3 ⊢ φ → D ∈ ∞Met ⁡ X
lmmbr3.5 ⊢ Z = ℤ ≥ M
lmmbr3.6 ⊢ φ → M ∈ ℤ
lmmbrf.7 ⊢ φ ∧ k ∈ Z → F ⁡ k = A
lmmbrf.8 ⊢ φ → F : Z ⟶ X
Assertion lmmbrf ⊢ φ → F ⇝t ⁡ J P ↔ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j A D P < x

Proof

Step Hyp Ref Expression
1 lmmbr.2 ⊢ J = MetOpen ⁡ D
2 lmmbr.3 ⊢ φ → D ∈ ∞Met ⁡ X
3 lmmbr3.5 ⊢ Z = ℤ ≥ M
4 lmmbr3.6 ⊢ φ → M ∈ ℤ
5 lmmbrf.7 ⊢ φ ∧ k ∈ Z → F ⁡ k = A
6 lmmbrf.8 ⊢ φ → F : Z ⟶ X
7 elfvdm ⊢ D ∈ ∞Met ⁡ X → X ∈ dom ⁡ ∞Met
8 cnex ⊢ ℂ ∈ V
9 7 8 jctir ⊢ D ∈ ∞Met ⁡ X → X ∈ dom ⁡ ∞Met ∧ ℂ ∈ V
10 uzssz ⊢ ℤ ≥ M ⊆ ℤ
11 zsscn ⊢ ℤ ⊆ ℂ
12 10 11 sstri ⊢ ℤ ≥ M ⊆ ℂ
13 3 12 eqsstri ⊢ Z ⊆ ℂ
14 13 jctr ⊢ F : Z ⟶ X → F : Z ⟶ X ∧ Z ⊆ ℂ
15 elpm2r ⊢ X ∈ dom ⁡ ∞Met ∧ ℂ ∈ V ∧ F : Z ⟶ X ∧ Z ⊆ ℂ → F ∈ X ↑ 𝑝𝑚 ℂ
16 9 14 15 syl2an ⊢ D ∈ ∞Met ⁡ X ∧ F : Z ⟶ X → F ∈ X ↑ 𝑝𝑚 ℂ
17 2 6 16 syl2anc ⊢ φ → F ∈ X ↑ 𝑝𝑚 ℂ
18 17 biantrurd ⊢ φ → P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x ↔ F ∈ X ↑ 𝑝𝑚 ℂ ∧ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
19 3 uztrn2 ⊢ j ∈ Z ∧ k ∈ ℤ ≥ j → k ∈ Z
20 19 adantll ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → k ∈ Z
21 5 oveq1d ⊢ φ ∧ k ∈ Z → F ⁡ k D P = A D P
22 21 breq1d ⊢ φ ∧ k ∈ Z → F ⁡ k D P < x ↔ A D P < x
23 22 adantrl ⊢ φ ∧ j ∈ Z ∧ k ∈ Z → F ⁡ k D P < x ↔ A D P < x
24 6 fdmd ⊢ φ → dom ⁡ F = Z
25 24 eleq2d ⊢ φ → k ∈ dom ⁡ F ↔ k ∈ Z
26 25 biimpar ⊢ φ ∧ k ∈ Z → k ∈ dom ⁡ F
27 6 ffvelcdmda ⊢ φ ∧ k ∈ Z → F ⁡ k ∈ X
28 26 27 jca ⊢ φ ∧ k ∈ Z → k ∈ dom ⁡ F ∧ F ⁡ k ∈ X
29 28 biantrurd ⊢ φ ∧ k ∈ Z → F ⁡ k D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
30 df-3an ⊢ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
31 29 30 bitr4di ⊢ φ ∧ k ∈ Z → F ⁡ k D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
32 31 adantrl ⊢ φ ∧ j ∈ Z ∧ k ∈ Z → F ⁡ k D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
33 23 32 bitr3d ⊢ φ ∧ j ∈ Z ∧ k ∈ Z → A D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
34 33 anassrs ⊢ φ ∧ j ∈ Z ∧ k ∈ Z → A D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
35 20 34 syldan ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → A D P < x ↔ k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
36 35 ralbidva ⊢ φ ∧ j ∈ Z → ∀ k ∈ ℤ ≥ j A D P < x ↔ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
37 36 rexbidva ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j A D P < x ↔ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
38 37 ralbidv ⊢ φ → ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j A D P < x ↔ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
39 38 anbi2d ⊢ φ → P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j A D P < x ↔ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
40 1 2 3 4 lmmbr3 ⊢ φ → F ⇝t ⁡ J P ↔ F ∈ X ↑ 𝑝𝑚 ℂ ∧ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
41 3anass ⊢ F ∈ X ↑ 𝑝𝑚 ℂ ∧ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x ↔ F ∈ X ↑ 𝑝𝑚 ℂ ∧ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
42 40 41 bitrdi ⊢ φ → F ⇝t ⁡ J P ↔ F ∈ X ↑ 𝑝𝑚 ℂ ∧ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ F ⁡ k ∈ X ∧ F ⁡ k D P < x
43 18 39 42 3bitr4rd ⊢ φ → F ⇝t ⁡ J P ↔ P ∈ X ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j A D P < x