Metamath Proof Explorer


Theorem iscauf

Description: Express the property " F is a Cauchy sequence of metric D " presupposing F is a function. (Contributed by NM, 24-Jul-2007) (Revised by Mario Carneiro, 23-Dec-2013)

Ref Expression
Hypotheses iscau3.2 ⊢ Z = ℤ ≥ M
iscau3.3 ⊢ φ → D ∈ ∞Met ⁡ X
iscau3.4 ⊢ φ → M ∈ ℤ
iscau4.5 ⊢ φ ∧ k ∈ Z → F ⁡ k = A
iscau4.6 ⊢ φ ∧ j ∈ Z → F ⁡ j = B
iscauf.7 ⊢ φ → F : Z ⟶ X
Assertion iscauf ⊢ φ → F ∈ Cau ⁡ D ↔ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j B D A < x

Proof

Step Hyp Ref Expression
1 iscau3.2 ⊢ Z = ℤ ≥ M
2 iscau3.3 ⊢ φ → D ∈ ∞Met ⁡ X
3 iscau3.4 ⊢ φ → M ∈ ℤ
4 iscau4.5 ⊢ φ ∧ k ∈ Z → F ⁡ k = A
5 iscau4.6 ⊢ φ ∧ j ∈ Z → F ⁡ j = B
6 iscauf.7 ⊢ φ → F : Z ⟶ X
7 elfvdm ⊢ D ∈ ∞Met ⁡ X → X ∈ dom ⁡ ∞Met
8 2 7 syl ⊢ φ → X ∈ dom ⁡ ∞Met
9 cnex ⊢ ℂ ∈ V
10 8 9 jctir ⊢ φ → X ∈ dom ⁡ ∞Met ∧ ℂ ∈ V
11 uzssz ⊢ ℤ ≥ M ⊆ ℤ
12 zsscn ⊢ ℤ ⊆ ℂ
13 11 12 sstri ⊢ ℤ ≥ M ⊆ ℂ
14 1 13 eqsstri ⊢ Z ⊆ ℂ
15 6 14 jctir ⊢ φ → F : Z ⟶ X ∧ Z ⊆ ℂ
16 elpm2r ⊢ X ∈ dom ⁡ ∞Met ∧ ℂ ∈ V ∧ F : Z ⟶ X ∧ Z ⊆ ℂ → F ∈ X ↑ 𝑝𝑚 ℂ
17 10 15 16 syl2anc ⊢ φ → F ∈ X ↑ 𝑝𝑚 ℂ
18 17 biantrurd ⊢ φ → ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x ↔ F ∈ X ↑ 𝑝𝑚 ℂ ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
19 2 adantr ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → D ∈ ∞Met ⁡ X
20 5 adantrr ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → F ⁡ j = B
21 6 adantr ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → F : Z ⟶ X
22 simprl ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → j ∈ Z
23 21 22 ffvelcdmd ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → F ⁡ j ∈ X
24 20 23 eqeltrrd ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → B ∈ X
25 1 uztrn2 ⊢ j ∈ Z ∧ k ∈ ℤ ≥ j → k ∈ Z
26 25 4 sylan2 ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → F ⁡ k = A
27 ffvelcdm ⊢ F : Z ⟶ X ∧ k ∈ Z → F ⁡ k ∈ X
28 6 25 27 syl2an ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → F ⁡ k ∈ X
29 26 28 eqeltrrd ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → A ∈ X
30 xmetsym ⊢ D ∈ ∞Met ⁡ X ∧ B ∈ X ∧ A ∈ X → B D A = A D B
31 19 24 29 30 syl3anc ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → B D A = A D B
32 31 breq1d ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → B D A < x ↔ A D B < x
33 fdm ⊢ F : Z ⟶ X → dom ⁡ F = Z
34 33 eleq2d ⊢ F : Z ⟶ X → k ∈ dom ⁡ F ↔ k ∈ Z
35 34 biimpar ⊢ F : Z ⟶ X ∧ k ∈ Z → k ∈ dom ⁡ F
36 6 25 35 syl2an ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → k ∈ dom ⁡ F
37 36 29 jca ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → k ∈ dom ⁡ F ∧ A ∈ X
38 37 biantrurd ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → A D B < x ↔ k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
39 df-3an ⊢ k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x ↔ k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
40 38 39 bitr4di ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → A D B < x ↔ k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
41 32 40 bitrd ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → B D A < x ↔ k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
42 41 anassrs ⊢ φ ∧ j ∈ Z ∧ k ∈ ℤ ≥ j → B D A < x ↔ k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
43 42 ralbidva ⊢ φ ∧ j ∈ Z → ∀ k ∈ ℤ ≥ j B D A < x ↔ ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
44 43 rexbidva ⊢ φ → ∃ j ∈ Z ∀ k ∈ ℤ ≥ j B D A < x ↔ ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
45 44 ralbidv ⊢ φ → ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j B D A < x ↔ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
46 1 2 3 4 5 iscau4 ⊢ φ → F ∈ Cau ⁡ D ↔ F ∈ X ↑ 𝑝𝑚 ℂ ∧ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j k ∈ dom ⁡ F ∧ A ∈ X ∧ A D B < x
47 18 45 46 3bitr4rd ⊢ φ → F ∈ Cau ⁡ D ↔ ∀ x ∈ ℝ + ∃ j ∈ Z ∀ k ∈ ℤ ≥ j B D A < x