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

Theorem iscusp 24309
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 6910 . . 3 (𝑤 = 𝑊 → (Fil‘(Base‘𝑤)) = (Fil‘(Base‘𝑊)))
2 2fveq3 6910 . . . . 5 (𝑤 = 𝑊 → (CauFilu‘(UnifSt‘𝑤)) = (CauFilu‘(UnifSt‘𝑊)))
32eleq2d 2826 . . . 4 (𝑤 = 𝑊 → (𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊))))
4 fveq2 6905 . . . . . 6 (𝑤 = 𝑊 → (TopOpen‘𝑤) = (TopOpen‘𝑊))
54oveq1d 7447 . . . . 5 (𝑤 = 𝑊 → ((TopOpen‘𝑤) fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐))
65neeq1d 2999 . . . 4 (𝑤 = 𝑊 → (((TopOpen‘𝑤) fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
73, 6imbi12d 344 . . 3 (𝑤 = 𝑊 → ((𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
81, 7raleqbidv 3345 . 2 (𝑤 = 𝑊 → (∀𝑐 ∈ (Fil‘(Base‘𝑤))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
9 df-cusp 24308 . 2 CUnifSp = {𝑤 ∈ UnifSp ∣ ∀𝑐 ∈ (Fil‘(Base‘𝑤))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅)}
108, 9elrab2 3694 1 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1539  wcel 2107  wne 2939  wral 3060  c0 4332  cfv 6560  (class class class)co 7432  Basecbs 17248  TopOpenctopn 17467  Filcfil 23854   fLim cflim 23943  UnifStcuss 24263  UnifSpcusp 24264  CauFiluccfilu 24296  CUnifSpccusp 24307
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ne 2940  df-ral 3061  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-iota 6513  df-fv 6568  df-ov 7435  df-cusp 24308
This theorem is referenced by:  cuspusp  24310  cuspcvg  24311  iscusp2  24312  cmetcusp  25389
  Copyright terms: Public domain W3C validator