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

Theorem iscusp2 24332
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 24329 . 2 (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)))
2 iscusp2.1 . . . . 5 𝐵 = (Base‘𝑊)
32fveq2i 6923 . . . 4 (Fil‘𝐵) = (Fil‘(Base‘𝑊))
4 iscusp2.2 . . . . . . 7 𝑈 = (UnifSt‘𝑊)
54fveq2i 6923 . . . . . 6 (CauFilu𝑈) = (CauFilu‘(UnifSt‘𝑊))
65eleq2i 2836 . . . . 5 (𝑐 ∈ (CauFilu𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)))
7 iscusp2.3 . . . . . . 7 𝐽 = (TopOpen‘𝑊)
87oveq1i 7458 . . . . . 6 (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐)
98neeq1i 3011 . . . . 5 ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)
106, 9imbi12i 350 . . . 4 ((𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
113, 10raleqbii 3352 . . 3 (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))
1211anbi2i 622 . 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 1537  wcel 2108  wne 2946  wral 3067  c0 4352  cfv 6573  (class class class)co 7448  Basecbs 17258  TopOpenctopn 17481  Filcfil 23874   fLim cflim 23963  UnifStcuss 24283  UnifSpcusp 24284  CauFiluccfilu 24316  CUnifSpccusp 24327
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-ov 7451  df-cusp 24328
This theorem is referenced by:  cmetcusp1  25406
  Copyright terms: Public domain W3C validator