| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > flimtopon | Structured version Visualization version GIF version | ||
| Description: Reverse closure for the limit point predicate. (Contributed by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| flimtopon | ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐹 ∈ (Fil‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flimtop 23907 | . . 3 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐽 ∈ Top) | |
| 2 | istopon 22854 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) ↔ (𝐽 ∈ Top ∧ 𝑋 = ∪ 𝐽)) | |
| 3 | 2 | baib 535 | . . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑋 = ∪ 𝐽)) |
| 4 | 1, 3 | syl 17 | . 2 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝑋 = ∪ 𝐽)) |
| 5 | eqid 2734 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 6 | 5 | flimfil 23911 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐹 ∈ (Fil‘∪ 𝐽)) |
| 7 | fveq2 6832 | . . . . 5 ⊢ (𝑋 = ∪ 𝐽 → (Fil‘𝑋) = (Fil‘∪ 𝐽)) | |
| 8 | 7 | eleq2d 2820 | . . . 4 ⊢ (𝑋 = ∪ 𝐽 → (𝐹 ∈ (Fil‘𝑋) ↔ 𝐹 ∈ (Fil‘∪ 𝐽))) |
| 9 | 6, 8 | syl5ibrcom 247 | . . 3 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝑋 = ∪ 𝐽 → 𝐹 ∈ (Fil‘𝑋))) |
| 10 | filunibas 23823 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘∪ 𝐽) → ∪ 𝐹 = ∪ 𝐽) | |
| 11 | 6, 10 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → ∪ 𝐹 = ∪ 𝐽) |
| 12 | filunibas 23823 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋) | |
| 13 | 12 | eqeq1d 2736 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∪ 𝐹 = ∪ 𝐽 ↔ 𝑋 = ∪ 𝐽)) |
| 14 | 11, 13 | syl5ibcom 245 | . . 3 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝐹 ∈ (Fil‘𝑋) → 𝑋 = ∪ 𝐽)) |
| 15 | 9, 14 | impbid 212 | . 2 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝑋 = ∪ 𝐽 ↔ 𝐹 ∈ (Fil‘𝑋))) |
| 16 | 4, 15 | bitrd 279 | 1 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐹 ∈ (Fil‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 ∪ cuni 4861 ‘cfv 6490 (class class class)co 7356 Topctop 22835 TopOnctopon 22852 Filcfil 23787 fLim cflim 23876 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-fbas 21304 df-top 22836 df-topon 22853 df-nei 23040 df-fil 23788 df-flim 23881 |
| This theorem is referenced by: fclsfnflim 23969 |
| Copyright terms: Public domain | W3C validator |