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

Theorem iscusp2 24276
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 24273 . 2 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
2 iscusp2.1 . . . . 5 𝐵 = (Base‘𝑊)
32fveq2i 6837 . . . 4 (Fil‘𝐵) = (Fil‘(Base‘𝑊))
4 iscusp2.2 . . . . . . 7 𝑈 = (UnifSt‘𝑊)
54fveq2i 6837 . . . . . 6 (CauFilu𝑈) = (CauFilu‘(UnifSt‘𝑊))
65eleq2i 2829 . . . . 5 (𝑐 ∈ (CauFilu𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)))
7 iscusp2.3 . . . . . . 7 𝐽 = (TopOpen‘𝑊)
87oveq1i 7370 . . . . . 6 (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐)
98neeq1i 2997 . . . . 5 ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)
106, 9imbi12i 350 . . . 4 ((𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
113, 10raleqbii 3310 . . 3 (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
1211anbi2i 624 . 2 ((𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅)) ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
131, 12bitr4i 278 1 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wne 2933  wral 3052  c0 4274  cfv 6492  (class class class)co 7360  Basecbs 17170  TopOpenctopn 17375  Filcfil 23820   fLim cflim 23909  UnifStcuss 24228  UnifSpcusp 24229  CauFiluccfilu 24260  CUnifSpccusp 24271
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-iota 6448  df-fv 6500  df-ov 7363  df-cusp 24272
This theorem is referenced by:  cmetcusp1  25330
  Copyright terms: Public domain W3C validator