MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  flimss2 Structured version   Visualization version   GIF version

Theorem flimss2 24298
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.)
Assertion
Ref Expression
flimss2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) → (𝐽 fLim 𝐺) ⊆ (𝐽 fLim 𝐹))

Proof of Theorem flimss2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . . . . 7 ∪ 𝐽 = ∪ 𝐽
21flimelbas 24294 . . . . . 6 (𝑥 ∈ (𝐽 fLim 𝐺) → 𝑥 ∈ ∪ 𝐽)
32adantl 487 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑥 ∈ ∪ 𝐽)
4 simpl1 1210 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝐽 ∈ (TopOn‘𝑋))
5 toponuni 23239 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
64, 5syl 18 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑋 = ∪ 𝐽)
73, 6eleqtrrd 2863 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑥 ∈ 𝑋)
8 flimneiss 24292 . . . . . 6 (𝑥 ∈ (𝐽 fLim 𝐺) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐺)
98adantl 487 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐺)
10 simpl3 1212 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝐺 ⊆ 𝐹)
119, 10sstrd 3919 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)
12 simpl2 1211 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝐹 ∈ (Fil‘𝑋))
13 elflim 24297 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
144, 12, 13syl2anc 596 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
157, 11, 14mpbir2and 726 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) ∧ 𝑥 ∈ (𝐽 fLim 𝐺)) → 𝑥 ∈ (𝐽 fLim 𝐹))
1615ex 418 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) → (𝑥 ∈ (𝐽 fLim 𝐺) → 𝑥 ∈ (𝐽 fLim 𝐹)))
1716ssrdv 3915 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐺 ⊆ 𝐹) → (𝐽 fLim 𝐺) ⊆ (𝐽 fLim 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ⊆ wss 3896  {csn 4584  ∪ cuni 4866  ‘cfv 6541  (class class class)co 7422  TopOnctopon 23235  neicnei 23422  Filcfil 24171   fLim cflim 24260
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-fbas 21682  df-top 23219  df-topon 23236  df-fil 24172  df-flim 24265
This theorem is used by:  flimfnfcls  24354  cnpfcf  24367
  Copyright terms: Public domain W3C validator