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 6699 | . . . 4 ⊢ (∞Met‘𝑋) ⊆ ∪ ran ∞Met | |
2 | 1 | sseli 3963 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐷 ∈ ∪ ran ∞Met) |
3 | dmeq 5772 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → dom 𝑑 = dom 𝐷) | |
4 | 3 | dmeqd 5774 | . . . . . 6 ⊢ (𝑑 = 𝐷 → dom dom 𝑑 = dom dom 𝐷) |
5 | 4 | fveq2d 6674 | . . . . 5 ⊢ (𝑑 = 𝐷 → (Fil‘dom dom 𝑑) = (Fil‘dom dom 𝐷)) |
6 | imaeq1 5924 | . . . . . . . 8 ⊢ (𝑑 = 𝐷 → (𝑑 “ (𝑦 × 𝑦)) = (𝐷 “ (𝑦 × 𝑦))) | |
7 | 6 | sseq1d 3998 | . . . . . . 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 23858 | . . . 4 ⊢ CauFil = (𝑑 ∈ ∪ ran ∞Met ↦ {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) | |
12 | fvex 6683 | . . . . 5 ⊢ (Fil‘dom dom 𝐷) ∈ V | |
13 | 12 | rabex 5235 | . . . 4 ⊢ {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} ∈ V |
14 | 10, 11, 13 | fvmpt 6768 | . . 3 ⊢ (𝐷 ∈ ∪ ran ∞Met → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
15 | 2, 14 | syl 17 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ 𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}) |
16 | xmetdmdm 22945 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = dom dom 𝐷) | |
17 | 16 | fveq2d 6674 | . . 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 1537 ∈ wcel 2114 ∀wral 3138 ∃wrex 3139 {crab 3142 ⊆ wss 3936 ∪ cuni 4838 × cxp 5553 dom cdm 5555 ran crn 5556 “ cima 5558 ‘cfv 6355 (class class class)co 7156 0cc0 10537 ℝ+crp 12390 [,)cico 12741 ∞Metcxmet 20530 Filcfil 22453 CauFilccfil 23855 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-map 8408 df-xr 10679 df-xmet 20538 df-cfil 23858 |
This theorem is referenced by: iscfil 23868 |
Copyright terms: Public domain | W3C validator |