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 23451 | . 2 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) | |
2 | iscusp2.1 | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
3 | 2 | fveq2i 6777 | . . . 4 ⊢ (Fil‘𝐵) = (Fil‘(Base‘𝑊)) |
4 | iscusp2.2 | . . . . . . 7 ⊢ 𝑈 = (UnifSt‘𝑊) | |
5 | 4 | fveq2i 6777 | . . . . . 6 ⊢ (CauFilu‘𝑈) = (CauFilu‘(UnifSt‘𝑊)) |
6 | 5 | eleq2i 2830 | . . . . 5 ⊢ (𝑐 ∈ (CauFilu‘𝑈) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊))) |
7 | iscusp2.3 | . . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝑊) | |
8 | 7 | oveq1i 7285 | . . . . . 6 ⊢ (𝐽 fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐) |
9 | 8 | neeq1i 3008 | . . . . 5 ⊢ ((𝐽 fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅) |
10 | 6, 9 | imbi12i 351 | . . . 4 ⊢ ((𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)) |
11 | 3, 10 | raleqbii 3163 | . . 3 ⊢ (∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)) |
12 | 11 | anbi2i 623 | . 2 ⊢ ((𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅)) ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) |
13 | 1, 12 | bitr4i 277 | 1 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘𝐵)(𝑐 ∈ (CauFilu‘𝑈) → (𝐽 fLim 𝑐) ≠ ∅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∅c0 4256 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 TopOpenctopn 17132 Filcfil 22996 fLim cflim 23085 UnifStcuss 23405 UnifSpcusp 23406 CauFiluccfilu 23438 CUnifSpccusp 23449 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-iota 6391 df-fv 6441 df-ov 7278 df-cusp 23450 |
This theorem is referenced by: cmetcusp1 24517 |
Copyright terms: Public domain | W3C validator |