Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cfilfval | Structured version Visualization version GIF version |
Description: The set of Cauchy filters on a metric space. (Contributed by Mario Carneiro, 13-Oct-2015.) |
Ref | Expression |
---|---|
cfilfval | ⊢ (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvssunirn 6698 | . . . 4 ⊢ (∞Met‘𝑋) ⊆ ∪ ran ∞Met | |
2 | 1 | sseli 3962 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐷 ∈ ∪ ran ∞Met) |
3 | dmeq 5771 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → dom 𝑑 = dom 𝐷) | |
4 | 3 | dmeqd 5773 | . . . . . 6 ⊢ (𝑑 = 𝐷 → dom dom 𝑑 = dom dom 𝐷) |
5 | 4 | fveq2d 6673 | . . . . 5 ⊢ (𝑑 = 𝐷 → (Fil‘dom dom 𝑑) = (Fil‘dom dom 𝐷)) |
6 | imaeq1 5923 | . . . . . . . 8 ⊢ (𝑑 = 𝐷 → (𝑑 “ (𝑦 × 𝑦)) = (𝐷 “ (𝑦 × 𝑦))) | |
7 | 6 | sseq1d 3997 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → ((𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))) |
8 | 7 | rexbidv 3297 | . . . . . 6 ⊢ (𝑑 = 𝐷 → (∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))) |
9 | 8 | ralbidv 3197 | . . . . 5 ⊢ (𝑑 = 𝐷 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))) |
10 | 5, 9 | rabeqbidv 3485 | . . . 4 ⊢ (𝑑 = 𝐷 → {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
11 | df-cfil 23857 | . . . 4 ⊢ CauFil = (𝑑 ∈ ∪ ran ∞Met ↦ {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) | |
12 | fvex 6682 | . . . . 5 ⊢ (Fil‘dom dom 𝐷) ∈ V | |
13 | 12 | rabex 5234 | . . . 4 ⊢ {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} ∈ V |
14 | 10, 11, 13 | fvmpt 6767 | . . 3 ⊢ (𝐷 ∈ ∪ ran ∞Met → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
15 | 2, 14 | syl 17 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
16 | xmetdmdm 22944 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = dom dom 𝐷) | |
17 | 16 | fveq2d 6673 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (Fil‘𝑋) = (Fil‘dom dom 𝐷)) |
18 | 17 | rabeqdv 3484 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
19 | 15, 18 | eqtr4d 2859 | 1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 {crab 3142 ⊆ wss 3935 ∪ cuni 4837 × cxp 5552 dom cdm 5554 ran crn 5555 “ cima 5557 ‘cfv 6354 (class class class)co 7155 0cc0 10536 ℝ+crp 12388 [,)cico 12739 ∞Metcxmet 20529 Filcfil 22452 CauFilccfil 23854 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-fv 6362 df-ov 7158 df-oprab 7159 df-mpo 7160 df-map 8407 df-xr 10678 df-xmet 20537 df-cfil 23857 |
This theorem is referenced by: iscfil 23867 |
Copyright terms: Public domain | W3C validator |