| 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 24339 | . . 3 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐽 ∈ Top) | |
| 2 | istopon 23239 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) ↔ (𝐽 ∈ Top ∧ 𝑋 = ∪ 𝐽)) | |
| 3 | 2 | baib 545 | . . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑋 = ∪ 𝐽)) |
| 4 | 1, 3 | syl 18 | . 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑋 = ∪ 𝐽)) |
| 5 | eqid 2760 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 6 | 5 | fclsfil 24338 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐹 ∈ (Fil‘∪ 𝐽)) |
| 7 | fveq2 6890 | . . . . 5 ⊢ (𝑋 = ∪ 𝐽 → (Fil‘𝑋) = (Fil‘∪ 𝐽)) | |
| 8 | 7 | eleq2d 2846 | . . . 4 ⊢ (𝑋 = ∪ 𝐽 → (𝐹 ∈ (Fil‘𝑋) ↔ 𝐹 ∈ (Fil‘∪ 𝐽))) |
| 9 | 6, 8 | syl5ibrcom 250 | . . 3 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝑋 = ∪ 𝐽 → 𝐹 ∈ (Fil‘𝑋))) |
| 10 | filunibas 24209 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐽) → ∪ 𝐹 = ∪ 𝐽) | |
| 11 | 6, 10 | syl 18 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → ∪ 𝐹 = ∪ 𝐽) |
| 12 | filunibas 24209 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 13 | 12 | eqeq1d 2762 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∪ 𝐹 = ∪ 𝐽 ↔ 𝑋 = ∪ 𝐽)) |
| 14 | 11, 13 | syl5ibcom 248 | . . 3 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐹 ∈ (Fil‘𝑋) → 𝑋 = ∪ 𝐽)) |
| 15 | 9, 14 | impbid 215 | . 2 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝑋 = ∪ 𝐽 ↔ 𝐹 ∈ (Fil‘𝑋))) |
| 16 | 4, 15 | bitrd 282 | 1 ⊢ (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐹 ∈ (Fil‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ∪ cuni 4866 ‘cfv 6543 (class class class)co 7424 Topctop 23220 TopOnctopon 23237 Filcfil 24173 fClus cfcls 24264 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-fbas 21684 df-topon 23238 df-fil 24174 df-fcls 24269 |
| This theorem is used by: fclsopni 24343 fclselbas 24344 fclsss1 24350 fclsss2 24351 fclscf 24353 |
| Copyright terms: Public domain | W3C validator |