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

Theorem cfilss 25255
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 776 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (Fil‘𝑋))
2 simprr 778 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐹𝐺)
3 iscfil 25250 . . . . 5 (𝐷 ∈ (∞Met‘𝑋) → (𝐹 ∈ (CauFil‘𝐷) ↔ (𝐹 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
43simplbda 500 . . . 4 ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) → ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
54adantr 481 . . 3 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → ∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
6 ssrexv 3984 . . . 4 (𝐹𝐺 → (∃𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) → ∃𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
76ralimdv 3153 . . 3 (𝐹𝐺 → (∀𝑥 ∈ ℝ+𝑦𝐹 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥) → ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥)))
82, 5, 7sylc 65 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))
9 iscfil 25250 . . 3 (𝐷 ∈ (∞Met‘𝑋) → (𝐺 ∈ (CauFil‘𝐷) ↔ (𝐺 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
109ad2antrr 732 . 2 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → (𝐺 ∈ (CauFil‘𝐷) ↔ (𝐺 ∈ (Fil‘𝑋) ∧ ∀𝑥 ∈ ℝ+𝑦𝐺 (𝐷 “ (𝑦 × 𝑦)) ⊆ (0[,)𝑥))))
111, 8, 10mpbir2and 719 1 (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐹 ∈ (CauFil‘𝐷)) ∧ (𝐺 ∈ (Fil‘𝑋) ∧ 𝐹𝐺)) → 𝐺 ∈ (CauFil‘𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wcel 2119  wral 3053  wrex 3063  wss 3883   × cxp 5616  cima 5621  cfv 6485  (class class class)co 7356  0cc0 11029  +crp 12933  [,)cico 13291  ∞Metcxmet 21332  Filcfil 23828  CauFilccfil 25237
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-cnex 11085  ax-resscn 11086
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8765  df-xr 11174  df-xmet 21340  df-cfil 25240
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator