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

Theorem iscusp 24672
Description: The predicate "𝑊 is a complete uniform space." (Contributed by Thierry Arnoux, 3-Dec-2017.)
Assertion
Ref Expression
iscusp (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
Distinct variable group:   𝑊,𝑐

Proof of Theorem iscusp
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 2fveq3 6921 . . 3 (𝑤 = 𝑊 → (Fil‘(Base‘𝑤)) = (Fil‘(Base‘𝑊)))
2 2fveq3 6921 . . . . 5 (𝑤 = 𝑊 → (CauFilu‘(UnifSt‘𝑤)) = (CauFilu‘(UnifSt‘𝑊)))
32eleq2d 2850 . . . 4 (𝑤 = 𝑊 → (𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊))))
4 fveq2 6916 . . . . . 6 (𝑤 = 𝑊 → (TopOpen‘𝑤) = (TopOpen‘𝑊))
54oveq1d 7466 . . . . 5 (𝑤 = 𝑊 → ((TopOpen‘𝑤) fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐))
65neeq1d 3018 . . . 4 (𝑤 = 𝑊 → (((TopOpen‘𝑤) fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
73, 6imbi12d 347 . . 3 (𝑤 = 𝑊 → ((𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
81, 7raleqbidv 3338 . 2 (𝑤 = 𝑊 → (∀𝑐 ∈ (Fil‘(Base‘𝑤))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
9 df-cusp 24671 . 2 CUnifSp = {𝑤 ∈ UnifSp ∣ ∀𝑐 ∈ (Fil‘(Base‘𝑤))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅)}
108, 9elrab2 3652 1 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∅c0 4281  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  TopOpenctopn 17642  Filcfil 24219   fLim cflim 24308  UnifStcuss 24627  UnifSpcusp 24628  CauFiluccfilu 24659  CUnifSpccusp 24670
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454  df-cusp 24671
This theorem is used by:  cuspusp  24673  cuspcvg  24674  iscusp2  24675  cmetcusp  25730
  Copyright terms: Public domain W3C validator