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

Theorem flimss1 24304
Description: A limit point of a filter is a limit point in a coarser topology. (Contributed by Mario Carneiro, 9-Apr-2015.) (Revised by Stefan O'Rear, 8-Aug-2015.)
Assertion
Ref Expression
flimss1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝐾 fLim 𝐹) ⊆ (𝐽 fLim 𝐹))

Proof of Theorem flimss1
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . . . . 7 ∪ 𝐾 = ∪ 𝐾
21flimelbas 24299 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 ∈ ∪ 𝐾)
32adantl 487 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ ∪ 𝐾)
4 simpl2 1211 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘𝑋))
5 filunibas 24212 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
64, 5syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ∪ 𝐹 = 𝑋)
71flimfil 24300 . . . . . . . 8 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐹 ∈ (Fil‘∪ 𝐾))
87adantl 487 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘∪ 𝐾))
9 filunibas 24212 . . . . . . 7 (𝐹 ∈ (Fil‘∪ 𝐾) → ∪ 𝐹 = ∪ 𝐾)
108, 9syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ∪ 𝐹 = ∪ 𝐾)
116, 10eqtr3d 2800 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = ∪ 𝐾)
123, 11eleqtrrd 2866 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ 𝑋)
13 simpl1 1210 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ (TopOn‘𝑋))
14 topontop 23243 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1513, 14syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ Top)
16 flimtop 24296 . . . . . . 7 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐾 ∈ Top)
1716adantl 487 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐾 ∈ Top)
18 toponuni 23244 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
1913, 18syl 18 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = ∪ 𝐽)
2019, 11eqtr3d 2800 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ∪ 𝐽 = ∪ 𝐾)
21 simpl3 1212 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ⊆ 𝐾)
22 eqid 2763 . . . . . . 7 ∪ 𝐽 = ∪ 𝐽
2322, 1topssnei 23454 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∪ 𝐽 = ∪ 𝐾) ∧ 𝐽 ⊆ 𝐾) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
2415, 17, 20, 21, 23syl31anc 1400 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
25 flimneiss 24297 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2625adantl 487 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2724, 26sstrd 3922 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)
28 elflim 24302 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
2913, 4, 28syl2anc 596 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 ∈ 𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
3012, 27, 29mpbir2and 726 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹))
3130ex 418 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹)))
3231ssrdv 3918 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 2146   ⊆ wss 3899  {csn 4587  ∪ cuni 4869  ‘cfv 6546  (class class class)co 7427  Topctop 23223  TopOnctopon 23240  neicnei 23427  Filcfil 24176   fLim cflim 24265
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-fbas 21687  df-top 23224  df-topon 23241  df-ntr 23350  df-nei 23428  df-fil 24177  df-flim 24270
This theorem is used by:  flimcf  24313
  Copyright terms: Public domain W3C validator