| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fclstopon | Structured version Visualization version GIF version | ||
| Description: Reverse closure for the cluster point predicate. (Contributed by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| fclstopon | ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐹 ∈ (Fil‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fclstop 23898 | . . 3 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐽 ∈ Top) | |
| 2 | istopon 22799 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) ↔ (𝐽 ∈ Top ∧ 𝑋 = ∪ 𝐽)) | |
| 3 | 2 | baib 535 | . . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑋 = ∪ 𝐽)) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑋 = ∪ 𝐽)) |
| 5 | eqid 2729 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 6 | 5 | fclsfil 23897 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 ∈ (Fil‘∪ 𝐽)) |
| 7 | fveq2 6858 | . . . . 5 ⊢ (𝑋 = ∪ 𝐽 → (Fil‘𝑋) = (Fil‘∪ 𝐽)) | |
| 8 | 7 | eleq2d 2814 | . . . 4 ⊢ (𝑋 = ∪ 𝐽 → (𝐹 ∈ (Fil‘𝑋) ↔ 𝐹 ∈ (Fil‘∪ 𝐽))) |
| 9 | 6, 8 | syl5ibrcom 247 | . . 3 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝑋 = ∪ 𝐽 → 𝐹 ∈ (Fil‘𝑋))) |
| 10 | filunibas 23768 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐽) → ∪ 𝐹 = ∪ 𝐽) | |
| 11 | 6, 10 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → ∪ 𝐹 = ∪ 𝐽) |
| 12 | filunibas 23768 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 13 | 12 | eqeq1d 2731 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∪ 𝐹 = ∪ 𝐽 ↔ 𝑋 = ∪ 𝐽)) |
| 14 | 11, 13 | syl5ibcom 245 | . . 3 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐹 ∈ (Fil‘𝑋) → 𝑋 = ∪ 𝐽)) |
| 15 | 9, 14 | impbid 212 | . 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝑋 = ∪ 𝐽 ↔ 𝐹 ∈ (Fil‘𝑋))) |
| 16 | 4, 15 | bitrd 279 | 1 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐹 ∈ (Fil‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 ∪ cuni 4871 ‘cfv 6511 (class class class)co 7387 Topctop 22780 TopOnctopon 22797 Filcfil 23732 fClus cfcls 23823 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-fbas 21261 df-topon 22798 df-fil 23733 df-fcls 23828 |
| This theorem is referenced by: fclsopni 23902 fclselbas 23903 fclsss1 23909 fclsss2 23910 fclscf 23912 |
| Copyright terms: Public domain | W3C validator |