| 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 22857 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐽 ∈ Top) |
| 3 | fvssunirn 6865 | . . . . 5 ⊢ (Fil‘𝑋) ⊆ ∪ ran Fil | |
| 4 | 3 | sseli 3929 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ ∪ ran Fil) |
| 5 | 4 | adantl 481 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ∈ ∪ ran Fil) |
| 6 | filsspw 23795 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) | |
| 7 | 6 | adantl 481 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ⊆ 𝒫 𝑋) |
| 8 | toponuni 22858 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽) | |
| 9 | 8 | adantr 480 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = ∪ 𝐽) |
| 10 | 9 | pweqd 4571 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝒫 𝑋 = 𝒫 ∪ 𝐽) |
| 11 | 7, 10 | sseqtrd 3970 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ⊆ 𝒫 ∪ 𝐽) |
| 12 | eqid 2736 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 13 | 12 | elflim2 23908 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) ↔ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 ∪ 𝐽) ∧ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 14 | 13 | baib 535 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 ∪ 𝐽) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 15 | 2, 5, 11, 14 | syl3anc 1373 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 16 | 9 | eleq2d 2822 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ 𝑋 ↔ 𝐴 ∈ ∪ 𝐽)) |
| 17 | 16 | anbi1d 631 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| 18 | 15, 17 | bitr4d 282 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ⊆ wss 3901 𝒫 cpw 4554 {csn 4580 ∪ cuni 4863 ran crn 5625 ‘cfv 6492 (class class class)co 7358 Topctop 22837 TopOnctopon 22854 neicnei 23041 Filcfil 23789 fLim cflim 23878 |
| 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 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-fbas 21306 df-top 22838 df-topon 22855 df-fil 23790 df-flim 23883 |
| This theorem is referenced by: flimss2 23916 flimss1 23917 neiflim 23918 flimopn 23919 hausflim 23925 flimclslem 23928 flfnei 23935 fclsfnflim 23971 |
| Copyright terms: Public domain | W3C validator |