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 21521 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top) | |
2 | 1 | adantr 483 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐽 ∈ Top) |
3 | fvssunirn 6699 | . . . . 5 ⊢ (Fil‘𝑋) ⊆ ∪ ran Fil | |
4 | 3 | sseli 3963 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ ∪ ran Fil) |
5 | 4 | adantl 484 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ∈ ∪ ran Fil) |
6 | filsspw 22459 | . . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋) | |
7 | 6 | adantl 484 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ⊆ 𝒫 𝑋) |
8 | toponuni 21522 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽) | |
9 | 8 | adantr 483 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = ∪ 𝐽) |
10 | 9 | pweqd 4558 | . . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝒫 𝑋 = 𝒫 ∪ 𝐽) |
11 | 7, 10 | sseqtrd 4007 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ⊆ 𝒫 ∪ 𝐽) |
12 | eqid 2821 | . . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
13 | 12 | elflim2 22572 | . . . 4 ⊢ (𝐴 ∈ (𝐽 fLim 𝐹) ↔ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 ∪ 𝐽) ∧ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
14 | 13 | baib 538 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ ∪ ran Fil ∧ 𝐹 ⊆ 𝒫 ∪ 𝐽) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
15 | 2, 5, 11, 14 | syl3anc 1367 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
16 | 9 | eleq2d 2898 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ 𝑋 ↔ 𝐴 ∈ ∪ 𝐽)) |
17 | 16 | anbi1d 631 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹) ↔ (𝐴 ∈ ∪ 𝐽 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
18 | 15, 17 | bitr4d 284 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fLim 𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝐴}) ⊆ 𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ⊆ wss 3936 𝒫 cpw 4539 {csn 4567 ∪ cuni 4838 ran crn 5556 ‘cfv 6355 (class class class)co 7156 Topctop 21501 TopOnctopon 21518 neicnei 21705 Filcfil 22453 fLim cflim 22542 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-fbas 20542 df-top 21502 df-topon 21519 df-fil 22454 df-flim 22547 |
This theorem is referenced by: flimss2 22580 flimss1 22581 neiflim 22582 flimopn 22583 hausflim 22589 flimclslem 22592 flfnei 22599 fclsfnflim 22635 |
Copyright terms: Public domain | W3C validator |