| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > flfneii | Structured version Visualization version GIF version | ||
| Description: A neighborhood of a limit point of a function contains the image of a filter element. (Contributed by Jeff Hankins, 11-Nov-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.) |
| Ref | Expression |
|---|---|
| flfneii.x | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| flfneii | ⊢ (((𝐽 ∈ Top ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴})) → ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flfneii.x | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
| 2 | 1 | toptopon 23290 | . . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋)) |
| 3 | flfnei 24365 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛))) | |
| 4 | 2, 3 | syl3an1b 1431 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ↔ (𝐴 ∈ 𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛))) |
| 5 | 4 | simplbda 505 | . . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹)) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛) |
| 6 | 5 | 3adant3 1150 | . 2 ⊢ (((𝐽 ∈ Top ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴})) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛) |
| 7 | sseq2 3939 | . . . . 5 ⊢ (𝑛 = 𝑁 → ((𝐹 “ 𝑠) ⊆ 𝑛 ↔ (𝐹 “ 𝑠) ⊆ 𝑁)) | |
| 8 | 7 | rexbidv 3190 | . . . 4 ⊢ (𝑛 = 𝑁 → (∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛 ↔ ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑁)) |
| 9 | 8 | rspcv 3576 | . . 3 ⊢ (𝑁 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛 → ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑁)) |
| 10 | 9 | 3ad2ant3 1153 | . 2 ⊢ (((𝐽 ∈ Top ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴})) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑛 → ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑁)) |
| 11 | 6, 10 | mpd 16 | 1 ⊢ (((𝐽 ∈ Top ∧ 𝐿 ∈ (Fil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝐴 ∈ ((𝐽 fLimf 𝐿)‘𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴})) → ∃𝑠 ∈ 𝐿 (𝐹 “ 𝑠) ⊆ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 {csn 4588 ∪ cuni 4872 “ cima 5661 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 Topctop 23266 TopOnctopon 23283 neicnei 23470 Filcfil 24219 fLimf cflf 24309 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-map 8887 df-fbas 21726 df-fg 21727 df-top 23267 df-topon 23284 df-nei 23471 df-fil 24220 df-fm 24312 df-flim 24313 df-flf 24314 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |