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 6724 | . . . 4 ⊢ (∞Met‘𝑋) ⊆ ∪ ran ∞Met | |
2 | 1 | sseli 3883 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐷 ∈ ∪ ran ∞Met) |
3 | dmeq 5757 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → dom 𝑑 = dom 𝐷) | |
4 | 3 | dmeqd 5759 | . . . . . 6 ⊢ (𝑑 = 𝐷 → dom dom 𝑑 = dom dom 𝐷) |
5 | 4 | fveq2d 6699 | . . . . 5 ⊢ (𝑑 = 𝐷 → (Fil‘dom dom 𝑑) = (Fil‘dom dom 𝐷)) |
6 | imaeq1 5909 | . . . . . . . 8 ⊢ (𝑑 = 𝐷 → (𝑑 “ (𝑦 × 𝑦)) = (𝐷 “ (𝑦 × 𝑦))) | |
7 | 6 | sseq1d 3918 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → ((𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))) |
8 | 7 | rexbidv 3206 | . . . . . 6 ⊢ (𝑑 = 𝐷 → (∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))) |
9 | 8 | ralbidv 3108 | . . . . 5 ⊢ (𝑑 = 𝐷 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))) |
10 | 5, 9 | rabeqbidv 3386 | . . . 4 ⊢ (𝑑 = 𝐷 → {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
11 | df-cfil 24106 | . . . 4 ⊢ CauFil = (𝑑 ∈ ∪ ran ∞Met ↦ {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) | |
12 | fvex 6708 | . . . . 5 ⊢ (Fil‘dom dom 𝐷) ∈ V | |
13 | 12 | rabex 5210 | . . . 4 ⊢ {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} ∈ V |
14 | 10, 11, 13 | fvmpt 6796 | . . 3 ⊢ (𝐷 ∈ ∪ ran ∞Met → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
15 | 2, 14 | syl 17 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
16 | xmetdmdm 23187 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = dom dom 𝐷) | |
17 | 16 | fveq2d 6699 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (Fil‘𝑋) = (Fil‘dom dom 𝐷)) |
18 | 17 | rabeqdv 3385 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
19 | 15, 18 | eqtr4d 2774 | 1 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2112 ∀wral 3051 ∃wrex 3052 {crab 3055 ⊆ wss 3853 ∪ cuni 4805 × cxp 5534 dom cdm 5536 ran crn 5537 “ cima 5539 ‘cfv 6358 (class class class)co 7191 0cc0 10694 ℝ+crp 12551 [,)cico 12902 ∞Metcxmet 20302 Filcfil 22696 CauFilccfil 24103 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-cnex 10750 ax-resscn 10751 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-sbc 3684 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-mpt 5121 df-id 5440 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-fv 6366 df-ov 7194 df-oprab 7195 df-mpo 7196 df-map 8488 df-xr 10836 df-xmet 20310 df-cfil 24106 |
This theorem is referenced by: iscfil 24116 |
Copyright terms: Public domain | W3C validator |