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

Theorem iscusp2 24426
Description: The predicate "𝑊 is a complete uniform space." (Contributed by Thierry Arnoux, 15-Dec-2017.)
Hypotheses
Ref Expression
iscusp2.1 𝐵 = (Base‘𝑊)
iscusp2.2 𝑈 = (UnifSt‘𝑊)
iscusp2.3 𝐽 = (TopOpen‘𝑊)
Assertion
Ref Expression
iscusp2 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅)))
Distinct variable group:   𝑊,𝑐
Allowed substitution hints:   𝐵(𝑐)   𝑈(𝑐)   𝐽(𝑐)

Proof of Theorem iscusp2
StepHypRef Expression
1 iscusp 24423 . 2 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
2 iscusp2.1 . . . . 5 𝐵 = (Base‘𝑊)
32fveq2i 6885 . . . 4 (Fil‘𝐵) = (Fil‘(Base‘𝑊))
4 iscusp2.2 . . . . . . 7 𝑈 = (UnifSt‘𝑊)
54fveq2i 6885 . . . . . 6 (CauFilu𝑈) = (CauFilu‘(UnifSt‘𝑊))
65eleq2i 2861 . . . . 5 (𝑐 ∈ (CauFilu𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)))
7 iscusp2.3 . . . . . . 7 𝐽 = (TopOpen‘𝑊)
87oveq1i 7421 . . . . . 6 (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐)
98neeq1i 3028 . . . . 5 ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)
106, 9imbi12i 353 . . . 4 ((𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
113, 10raleqbii 3343 . . 3 (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
1211anbi2i 634 . 2 ((𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅)) ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
131, 12bitr4i 281 1 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wne 2964  wral 3085  c0 4294  cfv 6537  (class class class)co 7411  Basecbs 17268  TopOpenctopn 17473  Filcfil 23970   fLim cflim 24059  UnifStcuss 24378  UnifSpcusp 24379  CauFiluccfilu 24410  CUnifSpccusp 24421
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-iota 6493  df-fv 6545  df-ov 7414  df-cusp 24422
This theorem is referenced by:  cmetcusp1  25480
  Copyright terms: Public domain W3C validator