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

Theorem iscfil 25180
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 25179 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (CauFil‘𝐷) = {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)})
21eleq2d 2814 . 2 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ 𝐹 ∈ {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)}))
3 rexeq 3316 . . . 4 (𝑓 = 𝐹 → (∃𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∃𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
43ralbidv 3172 . . 3 (𝑓 = 𝐹 → (∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) ↔ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
54elrab 3680 . 2 (𝐹 ∈ {𝑓 ∈ (Fil‘𝑋) ∣ ∀𝑥 ∈ ℝ+𝑦𝑓 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)} ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
62, 5bitrdi 287 1 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1534  wcel 2099  wral 3056  wrex 3065  {crab 3427  wss 3944   × cxp 5670  cima 5675  cfv 6542  (class class class)co 7414  0cc0 11130  +crp 12998  [,)cico 13350  ∞Metcxmet 21251  Filcfil 23736  CauFilccfil 25167
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734  ax-cnex 11186  ax-resscn 11187
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-sbc 3775  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-fv 6550  df-ov 7417  df-oprab 7418  df-mpo 7419  df-map 8838  df-xr 11274  df-xmet 21259  df-cfil 25170
This theorem is referenced by:  iscfil2  25181  cfilfil  25182  cfilss  25185  cfilucfil3  25235  cmetcusp  25269
  Copyright terms: Public domain W3C validator