| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscusp | Structured version Visualization version GIF version | ||
| Description: The predicate "𝑊 is a complete uniform space." (Contributed by Thierry Arnoux, 3-Dec-2017.) |
| Ref | Expression |
|---|---|
| iscusp | ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2fveq3 6890 | . . 3 ⊢ (𝑤 = 𝑊 → (Fil‘(Base‘𝑤)) = (Fil‘(Base‘𝑊))) | |
| 2 | 2fveq3 6890 | . . . . 5 ⊢ (𝑤 = 𝑊 → (CauFilu‘(UnifSt‘𝑤)) = (CauFilu‘(UnifSt‘𝑊))) | |
| 3 | 2 | eleq2d 2847 | . . . 4 ⊢ (𝑤 = 𝑊 → (𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) ↔ 𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)))) |
| 4 | fveq2 6885 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (TopOpen‘𝑤) = (TopOpen‘𝑊)) | |
| 5 | 4 | oveq1d 7435 | . . . . 5 ⊢ (𝑤 = 𝑊 → ((TopOpen‘𝑤) fLim 𝑐) = ((TopOpen‘𝑊) fLim 𝑐)) |
| 6 | 5 | neeq1d 3015 | . . . 4 ⊢ (𝑤 = 𝑊 → (((TopOpen‘𝑤) fLim 𝑐) ≠ ∅ ↔ ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅)) |
| 7 | 3, 6 | imbi12d 347 | . . 3 ⊢ (𝑤 = 𝑊 → ((𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅) ↔ (𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) |
| 8 | 1, 7 | raleqbidv 3335 | . 2 ⊢ (𝑤 = 𝑊 → (∀𝑐 ∈ (Fil‘(Base‘𝑤))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅) ↔ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) |
| 9 | df-cusp 24616 | . 2 ⊢ CUnifSp = {𝑤 ∈ UnifSp ∣ ∀𝑐 ∈ (Fil‘(Base‘𝑤))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑤)) → ((TopOpen‘𝑤) fLim 𝑐) ≠ ∅)} | |
| 10 | 8, 9 | elrab2 3649 | 1 ⊢ (𝑊 ∈ CUnifSp ↔ (𝑊 ∈ UnifSp ∧ ∀𝑐 ∈ (Fil‘(Base‘𝑊))(𝑐 ∈ (CauFilu‘(UnifSt‘𝑊)) → ((TopOpen‘𝑊) fLim 𝑐) ≠ ∅))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 ∅c0 4279 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 TopOpenctopn 17592 Filcfil 24164 fLim cflim 24253 UnifStcuss 24572 UnifSpcusp 24573 CauFiluccfilu 24604 CUnifSpccusp 24615 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6494 df-fv 6546 df-ov 7423 df-cusp 24616 |
| This theorem is used by: cuspusp 24618 cuspcvg 24619 iscusp2 24620 cmetcusp 25675 |
| Copyright terms: Public domain | W3C validator |