| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscusp2 | Structured version Visualization version GIF version | ||
| Description: The predicate "𝑊 is a complete uniform space." (Contributed by Thierry Arnoux, 15-Dec-2017.) |
| Ref | Expression |
|---|---|
| iscusp2.1 | ⊢ 𝐵 = (Base‘𝑊) |
| iscusp2.2 | ⊢ 𝑈 = (UnifSt‘𝑊) |
| iscusp2.3 | ⊢ 𝐽 = (TopOpen‘𝑊) |
| Ref | Expression |
|---|---|
| iscusp2 | ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iscusp 24455 | . 2 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) | |
| 2 | iscusp2.1 | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 3 | 2 | fveq2i 6884 | . . . 4 ⊢ (Fil‘𝐵) = (Fil‘(Base‘𝑊)) |
| 4 | iscusp2.2 | . . . . . . 7 ⊢ 𝑈 = (UnifSt‘𝑊) | |
| 5 | 4 | fveq2i 6884 | . . . . . 6 ⊢ (CauFilu‘𝑈) = (CauFilu‘(UnifSt‘𝑊)) |
| 6 | 5 | eleq2i 2855 | . . . . 5 ⊢ (𝑐 ∈ (CauFilu‘𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊))) |
| 7 | iscusp2.3 | . . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝑊) | |
| 8 | 7 | oveq1i 7420 | . . . . . 6 ⊢ (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐) |
| 9 | 8 | neeq1i 3022 | . . . . 5 ⊢ ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅) |
| 10 | 6, 9 | imbi12i 353 | . . . 4 ⊢ ((𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)) |
| 11 | 3, 10 | raleqbii 3336 | . . 3 ⊢ (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)) |
| 12 | 11 | anbi2i 634 | . 2 ⊢ ((𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)) ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) |
| 13 | 1, 12 | bitr4i 281 | 1 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 ∅c0 4286 ‘cfv 6536 (class class class)co 7410 Basecbs 17264 TopOpenctopn 17469 Filcfil 24002 fLim cflim 24091 UnifStcuss 24410 UnifSpcusp 24411 CauFiluccfilu 24442 CUnifSpccusp 24453 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-iota 6492 df-fv 6544 df-ov 7413 df-cusp 24454 |
| This theorem is referenced by: cmetcusp1 25512 |
| Copyright terms: Public domain | W3C validator |