| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscau | Structured version Visualization version GIF version | ||
| Description: Express the property "𝐹 is a Cauchy sequence of metric 𝐷". Part of Definition 1.4-3 of [Kreyszig] p. 28. The condition 𝐹 ⊆ (ℂ × 𝑋) allows to use objects more general than sequences when convenient; see the comment in df-lm 23556. (Contributed by NM, 7-Dec-2006.) (Revised by Mario Carneiro, 14-Nov-2013.) |
| Ref | Expression |
|---|---|
| iscau | ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝐹 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝐹‘𝑘)(ball‘𝐷)𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caufval 25605 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (Cau‘𝐷) = {𝑓 ∈ (𝑋 ↑pm ℂ) ∣ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝑓 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝑓‘𝑘)(ball‘𝐷)𝑥)}) | |
| 2 | 1 | eleq2d 2846 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (Cau‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ (𝑋 ↑pm ℂ) ∣ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝑓 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝑓‘𝑘)(ball‘𝐷)𝑥)})) |
| 3 | reseq1 5965 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓 ↾ (ℤ≥‘𝑘)) = (𝐹 ↾ (ℤ≥‘𝑘))) | |
| 4 | eqidd 2761 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (ℤ≥‘𝑘) = (ℤ≥‘𝑘)) | |
| 5 | fveq1 6889 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑘) = (𝐹‘𝑘)) | |
| 6 | 5 | oveq1d 7439 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑘)(ball‘𝐷)𝑥) = ((𝐹‘𝑘)(ball‘𝐷)𝑥)) |
| 7 | 3, 4, 6 | feq123d 6703 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝑓‘𝑘)(ball‘𝐷)𝑥) ↔ (𝐹 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝐹‘𝑘)(ball‘𝐷)𝑥))) |
| 8 | 7 | rexbidv 3186 | . . . 4 ⊢ (𝑓 = 𝐹 → (∃𝑘 ∈ ℤ (𝑓 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝑓‘𝑘)(ball‘𝐷)𝑥) ↔ ∃𝑘 ∈ ℤ (𝐹 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝐹‘𝑘)(ball‘𝐷)𝑥))) |
| 9 | 8 | ralbidv 3185 | . . 3 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝑓 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝑓‘𝑘)(ball‘𝐷)𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝐹 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝐹‘𝑘)(ball‘𝐷)𝑥))) |
| 10 | 9 | elrab 3644 | . 2 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑋 ↑pm ℂ) ∣ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝑓 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝑓‘𝑘)(ball‘𝐷)𝑥)} ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝐹 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝐹‘𝑘)(ball‘𝐷)𝑥))) |
| 11 | 2, 10 | bitrdi 290 | 1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (Cau‘𝐷) ↔ (𝐹 ∈ (𝑋 ↑pm ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑘 ∈ ℤ (𝐹 ↾ (ℤ≥‘𝑘)):(ℤ≥‘𝑘)⟶((𝐹‘𝑘)(ball‘𝐷)𝑥)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ∃wrex 3086 {crab 3412 ↾ cres 5653 ⟶wf 6539 ‘cfv 6543 (class class class)co 7424 ↑pm cpm 8855 ℂcc 11205 ℤcz 12700 ℤ≥cuz 12972 ℝ+crp 13127 ∞Metcxmet 21672 ballcbl 21674 Cauccau 25583 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-map 8856 df-xr 11354 df-xmet 21680 df-cau 25586 |
| This theorem is used by: iscau2 25607 caufpm 25612 lmcau 25643 |
| Copyright terms: Public domain | W3C validator |