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

Theorem iscfil 23851
Description: The property of being a Cauchy filter. (Contributed by Mario Carneiro, 13-Oct-2015.)
Assertion
Ref Expression
iscfil (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝑋,𝑦   𝑥,𝐷,𝑦

Proof of Theorem iscfil
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 cfilfval 23850 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
21eleq2d 2898 . 2 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}))
3 rexeq 3406 . . . 4 (𝑓 = 𝐹 → (∃𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∃𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
43ralbidv 3197 . . 3 (𝑓 = 𝐹 → (∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
54elrab 3671 . 2 (𝐹 ∈ {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
62, 5syl6bb 289 1 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wral 3138  wrex 3139  {crab 3142  wss 3924   × cxp 5539  cima 5544  cfv 6341  (class class class)co 7142  0cc0 10523  +crp 12376  [,)cico 12727  ∞Metcxmet 20513  Filcfil 22436  CauFilccfil 23838
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 5189  ax-nul 5196  ax-pow 5252  ax-pr 5316  ax-un 7447  ax-cnex 10579  ax-resscn 10580
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 3488  df-sbc 3764  df-dif 3927  df-un 3929  df-in 3931  df-ss 3940  df-nul 4280  df-if 4454  df-pw 4527  df-sn 4554  df-pr 4556  df-op 4560  df-uni 4825  df-br 5053  df-opab 5115  df-mpt 5133  df-id 5446  df-xp 5547  df-rel 5548  df-cnv 5549  df-co 5550  df-dm 5551  df-rn 5552  df-res 5553  df-ima 5554  df-iota 6300  df-fun 6343  df-fn 6344  df-f 6345  df-fv 6349  df-ov 7145  df-oprab 7146  df-mpo 7147  df-map 8394  df-xr 10665  df-xmet 20521  df-cfil 23841
This theorem is referenced by:  iscfil2  23852  cfilfil  23853  cfilss  23856  cfilucfil3  23906  cmetcusp  23940
  Copyright terms: Public domain W3C validator