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

Theorem cuspcvg 22910
 Description: In a complete uniform space, any Cauchy filter 𝐶 has a limit. (Contributed by Thierry Arnoux, 3-Dec-2017.)
Hypotheses
Ref Expression
cuspcvg.1 𝐵 = (Base‘𝑊)
cuspcvg.2 𝐽 = (TopOpen‘𝑊)
Assertion
Ref Expression
cuspcvg ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐽 fLim 𝐶) ≠ ∅)

Proof of Theorem cuspcvg
Dummy variable 𝑐 is distinct from all other variables.
StepHypRef Expression
1 eleq1 2880 . . . . 5 (𝑐 = 𝐶 → (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) ↔ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊))))
2 cuspcvg.2 . . . . . . . . 9 𝐽 = (TopOpen‘𝑊)
32eqcomi 2810 . . . . . . . 8 (TopOpen‘𝑊) = 𝐽
43a1i 11 . . . . . . 7 (𝑐 = 𝐶 → (TopOpen‘𝑊) = 𝐽)
5 id 22 . . . . . . 7 (𝑐 = 𝐶𝑐 = 𝐶)
64, 5oveq12d 7157 . . . . . 6 (𝑐 = 𝐶 → ((TopOpen‘𝑊) fLim 𝑐) = (𝐽 fLim 𝐶))
76neeq1d 3049 . . . . 5 (𝑐 = 𝐶 → (((TopOpen‘𝑊) fLim 𝑐) ≠ ∅ ↔ (𝐽 fLim 𝐶) ≠ ∅))
81, 7imbi12d 348 . . . 4 (𝑐 = 𝐶 → ((𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅) ↔ (𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) → (𝐽 fLim 𝐶) ≠ ∅)))
9 iscusp 22908 . . . . . 6 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
109simprbi 500 . . . . 5 (𝑊 ∈ CUnifSp → ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
1110adantr 484 . . . 4 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
12 simpr 488 . . . . 5 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → 𝐶 ∈ (Fil‘𝐵))
13 cuspcvg.1 . . . . . 6 𝐵 = (Base‘𝑊)
1413fveq2i 6652 . . . . 5 (Fil‘𝐵) = (Fil‘(Base‘𝑊))
1512, 14eleqtrdi 2903 . . . 4 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → 𝐶 ∈ (Fil‘(Base‘𝑊)))
168, 11, 15rspcdva 3576 . . 3 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) → (𝐽 fLim 𝐶) ≠ ∅))
17163impia 1114 . 2 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵) ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊))) → (𝐽 fLim 𝐶) ≠ ∅)
18173com23 1123 1 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐽 fLim 𝐶) ≠ ∅)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2112   ≠ wne 2990  ∀wral 3109  ∅c0 4246  ‘cfv 6328  (class class class)co 7139  Basecbs 16478  TopOpenctopn 16690  Filcfil 22453   fLim cflim 22542  UnifStcuss 22862  UnifSpcusp 22863  CauFiluccfilu 22895  CUnifSpccusp 22906 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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rab 3118  df-v 3446  df-un 3889  df-in 3891  df-ss 3901  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-iota 6287  df-fv 6336  df-ov 7142  df-cusp 22907 This theorem is referenced by:  cnextucn  22912
 Copyright terms: Public domain W3C validator