| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elflim | Structured version Visualization version GIF version | ||
| Description: The predicate "is a limit point of a filter." (Contributed by Jeff Hankins, 4-Sep-2009.) (Revised by Mario Carneiro, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| elflim | ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | topontop 23038 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top) | |
| 2 | 1 | adantr 485 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐽 ∈ Top) |
| 3 | fvssunirn 6913 | . . . . 5 ⊢ (Fil‘𝑋) ⊆ ∪ ran Fil | |
| 4 | 3 | sseli 3941 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ ∪ ran Fil) |
| 5 | 4 | adantl 486 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ∈ ∪ ran Fil) |
| 6 | filsspw 23976 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) | |
| 7 | 6 | adantl 486 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ⊆ 𝒫 𝑋) |
| 8 | toponuni 23039 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽) | |
| 9 | 8 | adantr 485 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = ∪ 𝐽) |
| 10 | 9 | pweqd 4584 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝒫 𝑋 = 𝒫 ∪ 𝐽) |
| 11 | 7, 10 | sseqtrd 3981 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ⊆ 𝒫 ∪ 𝐽) |
| 12 | eqid 2769 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 13 | 12 | elflim2 24089 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) ↔ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 ∪ 𝐽) ∧ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 14 | 13 | baib 544 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 ∪ 𝐽) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 15 | 2, 5, 11, 14 | syl3anc 1396 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 16 | 9 | eleq2d 2855 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ 𝑋 ↔ 𝐴 ∈ ∪ 𝐽)) |
| 17 | 16 | anbi1d 642 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 18 | 15, 17 | bitr4d 285 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 𝒫 cpw 4567 {csn 4594 ∪ cuni 4876 ran crn 5663 ‘cfv 6537 (class class class)co 7411 Topctop 23018 TopOnctopon 23035 neicnei 23222 Filcfil 23970 fLim cflim 24059 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-fbas 21487 df-top 23019 df-topon 23036 df-fil 23971 df-flim 24064 |
| This theorem is referenced by: flimss2 24097 flimss1 24098 neiflim 24099 flimopn 24100 hausflim 24106 flimclslem 24109 flfnei 24116 fclsfnflim 24152 |
| Copyright terms: Public domain | W3C validator |