Proof of Theorem projlem29
| Step | Hyp | Ref
| Expression |
| 1 | | projlem27.5 |
. . . . . 6
⊢ (φ
↔ (F:ℕ–→H ∧ ∀w ∈ ℕ ((R − (1 / w)) < (norm ‘((F ‘w)
−v A)) ∧ (norm
‘((F ‘w) −v A)) < (R + (1
/ w))))) |
| 2 | 1 | pm3.26bd 259 |
. . . . 5
⊢ (φ
→ F:ℕ–→H) |
| 3 | | projlem27.2 |
. . . . . 6
⊢ H
∈ Cℋ |
| 4 | 3 | chssi 5136 |
. . . . 5
⊢ H
⊆ ℋ |
| 5 | 2, 4 | jctir 241 |
. . . 4
⊢ (φ
→ (F:ℕ–→H ∧ H
⊆ ℋ )) |
| 6 | | fss 2759 |
. . . 4
⊢ ((F:ℕ–→H ∧ H
⊆ ℋ ) → F:ℕ–→ ℋ ) |
| 7 | 5, 6 | syl 12 |
. . 3
⊢ (φ
→ F:ℕ–→ ℋ
) |
| 8 | | breq2 2066 |
. . . . . . . 8
⊢ (g =
if(g ∈ ℝ, g, 1) → (0 < g ↔ 0 < if(g ∈ ℝ, g, 1))) |
| 9 | | breq2 2066 |
. . . . . . . . . . . 12
⊢ (g =
if(g ∈ ℝ, g, 1) → ((norm ‘((F ‘x)
−v (F
‘y))) < g ↔ (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1))) |
| 10 | 9 | imbi2d 464 |
. . . . . . . . . . 11
⊢ (g =
if(g ∈ ℝ, g, 1) → (((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g) ↔ ((z
≤ x ∧ z ≤ y) →
(norm ‘((F ‘x) −v (F ‘y)))
< if(g ∈ ℝ, g, 1)))) |
| 11 | 10 | biraldv 1219 |
. . . . . . . . . 10
⊢ (g =
if(g ∈ ℝ, g, 1) → (∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g) ↔ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1)))) |
| 12 | 11 | biraldv 1219 |
. . . . . . . . 9
⊢ (g =
if(g ∈ ℝ, g, 1) → (∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g) ↔ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1)))) |
| 13 | 12 | birexdv 1220 |
. . . . . . . 8
⊢ (g =
if(g ∈ ℝ, g, 1) → (∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g) ↔ ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1)))) |
| 14 | 8, 13 | imbi12d 474 |
. . . . . . 7
⊢ (g =
if(g ∈ ℝ, g, 1) → ((0 < g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g)) ↔ (0 < if(g ∈ ℝ, g, 1) → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1))))) |
| 15 | 14 | imbi2d 464 |
. . . . . 6
⊢ (g =
if(g ∈ ℝ, g, 1) → ((φ → (0 < g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g))) ↔ (φ → (0 < if(g ∈ ℝ, g, 1) → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1)))))) |
| 16 | | projlem27.1 |
. . . . . . 7
⊢ A
∈ ℋ |
| 17 | | projlem27.3 |
. . . . . . 7
⊢ S =
{u ∈ ℝ∣∃v ∈ H
u = -(norm ‘(v −v A))} |
| 18 | | projlem27.4 |
. . . . . . 7
⊢ R =
-sup(S, ℝ, < ) |
| 19 | | ax1re 4064 |
. . . . . . . 8
⊢ 1 ∈ ℝ |
| 20 | 19 | elimel 1793 |
. . . . . . 7
⊢ if(g
∈ ℝ, g, 1) ∈
ℝ |
| 21 | 16, 3, 17, 18, 1, 20 | projlem28 5220 |
. . . . . 6
⊢ (φ
→ (0 < if(g ∈ ℝ,
g, 1) → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < if(g ∈ ℝ, g, 1)))) |
| 22 | 15, 21 | dedth 1784 |
. . . . 5
⊢ (g
∈ ℝ → (φ → (0 <
g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g)))) |
| 23 | 22 | com12 13 |
. . . 4
⊢ (φ
→ (g ∈ ℝ → (0 <
g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g)))) |
| 24 | 23 | r19.21aiv 1259 |
. . 3
⊢ (φ
→ ∀g ∈ ℝ (0 <
g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g))) |
| 25 | 7, 24 | jca 236 |
. 2
⊢ (φ
→ (F:ℕ–→ ℋ
∧ ∀g ∈ ℝ (0 <
g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g)))) |
| 26 | | hcauchy 5103 |
. 2
⊢ (F
∈ Cauchy ↔ (F:ℕ–→ ℋ ∧
∀g ∈ ℝ (0 < g → ∃z ∈ ℕ ∀x ∈ ℕ ∀y ∈ ℕ ((z ≤ x ∧
z ≤ y) → (norm ‘((F ‘x)
−v (F
‘y))) < g)))) |
| 27 | 25, 26 | sylibr 175 |
1
⊢ (φ
→ F ∈ Cauchy) |