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

Theorem cuspcvg 24624
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 2848 . . . . 5 (𝑐 = 𝐶 → (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) ↔ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊))))
2 cuspcvg.2 . . . . . . . . 9 𝐽 = (TopOpen‘𝑊)
32eqcomi 2769 . . . . . . . 8 (TopOpen‘𝑊) = 𝐽
43a1i 11 . . . . . . 7 (𝑐 = 𝐶 → (TopOpen‘𝑊) = 𝐽)
5 id 23 . . . . . . 7 (𝑐 = 𝐶 → 𝑐 = 𝐶)
64, 5oveq12d 7438 . . . . . 6 (𝑐 = 𝐶 → ((TopOpen‘𝑊) fLim 𝑐) = (𝐽 fLim 𝐶))
76neeq1d 3014 . . . . 5 (𝑐 = 𝐶 → (((TopOpen‘𝑊) fLim 𝑐) ≠ ∅ ↔ (𝐽 fLim 𝐶) ≠ ∅))
81, 7imbi12d 347 . . . 4 (𝑐 = 𝐶 → ((𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅) ↔ (𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) → (𝐽 fLim 𝐶) ≠ ∅)))
9 iscusp 24622 . . . . . 6 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
109simprbi 503 . . . . 5 (𝑊 ∈ CUnifSp → ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
1110adantr 486 . . . 4 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
12 simpr 490 . . . . 5 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → 𝐶 ∈ (Fil‘𝐵))
13 cuspcvg.1 . . . . . 6 𝐵 = (Base‘𝑊)
1413fveq2i 6888 . . . . 5 (Fil‘𝐵) = (Fil‘(Base‘𝑊))
1512, 14eleqtrdi 2870 . . . 4 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → 𝐶 ∈ (Fil‘(Base‘𝑊)))
168, 11, 15rspcdva 3577 . . 3 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) → (𝐽 fLim 𝐶) ≠ ∅))
17163impia 1135 . 2 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (Fil‘𝐵) ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊))) → (𝐽 fLim 𝐶) ≠ ∅)
18173com23 1144 1 ((𝑊 ∈ CUnifSp ∧ 𝐶 ∈ (CauFilu‘(UnifSt‘𝑊)) ∧ 𝐶 ∈ (Fil‘𝐵)) → (𝐽 fLim 𝐶) ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∅c0 4278  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  TopOpenctopn 17597  Filcfil 24169   fLim cflim 24258  UnifStcuss 24577  UnifSpcusp 24578  CauFiluccfilu 24609  CUnifSpccusp 24620
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546  df-ov 7423  df-cusp 24621
This theorem is used by:  cnextucn  24626
  Copyright terms: Public domain W3C validator