Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > flimss2 | Structured version Visualization version GIF version |
Description: A limit point of a filter is a limit point of a finer filter. (Contributed by Jeff Hankins, 5-Sep-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.) |
Ref | Expression |
---|---|
flimss2 | ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) → (𝐽 fLim 𝐺) ⊆ (𝐽 fLim 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
2 | 1 | flimelbas 23119 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 fLim 𝐺) → 𝑥 ∈ ∪ 𝐽) |
3 | 2 | adantl 482 | . . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑥 ∈ ∪ 𝐽) |
4 | simpl1 1190 | . . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝐽 ∈ (TopOn‘𝑋)) | |
5 | toponuni 22063 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽) | |
6 | 4, 5 | syl 17 | . . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑋 = ∪ 𝐽) |
7 | 3, 6 | eleqtrrd 2842 | . . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑥 ∈ 𝑋) |
8 | flimneiss 23117 | . . . . . 6 ⊢ (𝑥 ∈ (𝐽 fLim 𝐺) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐺) | |
9 | 8 | adantl 482 | . . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐺) |
10 | simpl3 1192 | . . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝐺 ⊆ 𝐹) | |
11 | 9, 10 | sstrd 3931 | . . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹) |
12 | simpl2 1191 | . . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝐹 ∈ (Fil‘𝑋)) | |
13 | elflim 23122 | . . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹))) | |
14 | 4, 12, 13 | syl2anc 584 | . . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹))) |
15 | 7, 11, 14 | mpbir2and 710 | . . 3 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑥 ∈ (𝐽 fLim 𝐹)) |
16 | 15 | ex 413 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) → (𝑥 ∈ (𝐽 fLim 𝐺) → 𝑥 ∈ (𝐽 fLim 𝐹))) |
17 | 16 | ssrdv 3927 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) → (𝐽 fLim 𝐺) ⊆ (𝐽 fLim 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ⊆ wss 3887 {csn 4561 ∪ cuni 4839 ‘cfv 6433 (class class class)co 7275 TopOnctopon 22059 neicnei 22248 Filcfil 22996 fLim cflim 23085 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-fbas 20594 df-top 22043 df-topon 22060 df-fil 22997 df-flim 23090 |
This theorem is referenced by: flimfnfcls 23179 cnpfcf 23192 |
Copyright terms: Public domain | W3C validator |