Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  cfilfval Structured version   Visualization version   GIF version

Theorem cfilfval 23868
 Description: The set of Cauchy filters on a metric space. (Contributed by Mario Carneiro, 13-Oct-2015.)
Assertion
Ref Expression
cfilfval (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
Distinct variable groups:   𝑥,𝑦,𝑓,𝑋   𝐷,𝑓,𝑥,𝑦

Proof of Theorem cfilfval
Dummy variable 𝑑 is distinct from all other variables.
StepHypRef Expression
1 fvssunirn 6674 . . . 4 (∞Met‘𝑋) ⊆ ran ∞Met
21sseli 3911 . . 3 (𝐷 ∈ (∞Met‘𝑋) → 𝐷 ran ∞Met)
3 dmeq 5736 . . . . . . 7 (𝑑 = 𝐷 → dom 𝑑 = dom 𝐷)
43dmeqd 5738 . . . . . 6 (𝑑 = 𝐷 → dom dom 𝑑 = dom dom 𝐷)
54fveq2d 6649 . . . . 5 (𝑑 = 𝐷 → (Fil‘dom dom 𝑑) = (Fil‘dom dom 𝐷))
6 imaeq1 5891 . . . . . . . 8 (𝑑 = 𝐷 → (𝑑 “ (𝑦 × 𝑦)) = (𝐷 “ (𝑦 × 𝑦)))
76sseq1d 3946 . . . . . . 7 (𝑑 = 𝐷 → ((𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
87rexbidv 3256 . . . . . 6 (𝑑 = 𝐷 → (∃𝑦𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∃𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
98ralbidv 3162 . . . . 5 (𝑑 = 𝐷 → (∀𝑥 ∈ ℝ+𝑦𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
105, 9rabeqbidv 3433 . . . 4 (𝑑 = 𝐷 → {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
11 df-cfil 23859 . . . 4 CauFil = (𝑑 ran ∞Met ↦ {𝑓 ∈ (Fil‘dom dom 𝑑) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝑑 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
12 fvex 6658 . . . . 5 (Fil‘dom dom 𝐷) ∈ V
1312rabex 5199 . . . 4 {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} ∈ V
1410, 11, 13fvmpt 6745 . . 3 (𝐷 ran ∞Met → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
152, 14syl 17 . 2 (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
16 xmetdmdm 22942 . . . 4 (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = dom dom 𝐷)
1716fveq2d 6649 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (Fil‘𝑋) = (Fil‘dom dom 𝐷))
1817rabeqdv 3432 . 2 (𝐷 ∈ (∞Met‘𝑋) → {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} = {𝑓 ∈ (Fil‘dom dom 𝐷) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
1915, 18eqtr4d 2836 1 (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107  {crab 3110   ⊆ wss 3881  ∪ cuni 4800   × cxp 5517  dom cdm 5519  ran crn 5520   “ cima 5522  ‘cfv 6324  (class class class)co 7135  0cc0 10526  ℝ+crp 12377  [,)cico 12728  ∞Metcxmet 20076  Filcfil 22450  CauFilccfil 23856 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-xr 10668  df-xmet 20084  df-cfil 23859 This theorem is referenced by:  iscfil  23869
 Copyright terms: Public domain W3C validator