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

Theorem cfilss 25250
Description: A filter finer than a Cauchy filter is Cauchy. (Contributed by Mario Carneiro, 13-Oct-2015.)
Assertion
Ref Expression
cfilss (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (CauFil‘𝐷))

Proof of Theorem cfilss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprl 771 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (Fil‘𝑋))
2 simprr 773 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐹𝐺)
3 iscfil 25245 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
43simplbda 499 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) → ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
54adantr 480 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
6 ssrexv 3992 . . . 4 (𝐹𝐺 → (∃𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) → ∃𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
76ralimdv 3152 . . 3 (𝐹𝐺 → (∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) → ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
82, 5, 7sylc 65 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
9 iscfil 25245 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (𝐺 ∈ (CauFil‘𝐷) ↔ (𝐺 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
109ad2antrr 727 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → (𝐺 ∈ (CauFil‘𝐷) ↔ (𝐺 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
111, 8, 10mpbir2and 714 1 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (CauFil‘𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2114  wral 3052  wrex 3062  wss 3890   × cxp 5623  cima 5628  cfv 6493  (class class class)co 7361  0cc0 11032  +crp 12936  [,)cico 13294  ∞Metcxmet 21332  Filcfil 23823  CauFilccfil 25232
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683  ax-cnex 11088  ax-resscn 11089
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-map 8769  df-xr 11177  df-xmet 21340  df-cfil 25235
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator