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

Theorem cfilss 25429
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 782 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (Fil‘𝑋))
2 simprr 784 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐹𝐺)
3 iscfil 25424 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
43simplbda 504 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) → ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
54adantr 485 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
6 ssrexv 4007 . . . 4 (𝐹𝐺 → (∃𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) → ∃𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
76ralimdv 3179 . . 3 (𝐹𝐺 → (∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) → ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
82, 5, 7sylc 66 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
9 iscfil 25424 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (𝐺 ∈ (CauFil‘𝐷) ↔ (𝐺 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
109ad2antrr 738 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → (𝐺 ∈ (CauFil‘𝐷) ↔ (𝐺 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
111, 8, 10mpbir2and 725 1 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (CauFil‘𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wcel 2143  wral 3079  wrex 3089  wss 3905   × cxp 5659  cima 5664  cfv 6536  (class class class)co 7410  0cc0 11095  +crp 13011  [,)cico 13369  ∞Metcxmet 21507  Filcfil 24002  CauFilccfil 25411
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-xr 11242  df-xmet 21515  df-cfil 25414
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator