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

Theorem flimss1 24292
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 2761 . . . . . . 7 ∪ 𝐾 = ∪ 𝐾
21flimelbas 24287 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 ∈ ∪ 𝐾)
32adantl 487 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ ∪ 𝐾)
4 simpl2 1211 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘𝑋))
5 filunibas 24200 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → ∪ 𝐹 = 𝑋)
64, 5syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ∪ 𝐹 = 𝑋)
71flimfil 24288 . . . . . . . 8 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐹 ∈ (Fil‘∪ 𝐾))
87adantl 487 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘∪ 𝐾))
9 filunibas 24200 . . . . . . 7 (𝐹 ∈ (Fil‘∪ 𝐾) → ∪ 𝐹 = ∪ 𝐾)
108, 9syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ∪ 𝐹 = ∪ 𝐾)
116, 10eqtr3d 2798 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = ∪ 𝐾)
123, 11eleqtrrd 2864 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ 𝑋)
13 simpl1 1210 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ (TopOn‘𝑋))
14 topontop 23231 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1513, 14syl 18 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ Top)
16 flimtop 24284 . . . . . . 7 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐾 ∈ Top)
1716adantl 487 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐾 ∈ Top)
18 toponuni 23232 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
1913, 18syl 18 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = ∪ 𝐽)
2019, 11eqtr3d 2798 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ∪ 𝐽 = ∪ 𝐾)
21 simpl3 1212 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ⊆ 𝐾)
22 eqid 2761 . . . . . . 7 ∪ 𝐽 = ∪ 𝐽
2322, 1topssnei 23442 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ ∪ 𝐽 = ∪ 𝐾) ∧ 𝐽 ⊆ 𝐾) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
2415, 17, 20, 21, 23syl31anc 1400 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
25 flimneiss 24285 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2625adantl 487 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2724, 26sstrd 3941 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)
28 elflim 24290 . . . . 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 3937 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 1570   ∈ wcel 2145   ⊆ wss 3899  {csn 4584  ∪ cuni 4867  ‘cfv 6538  (class class class)co 7420  Topctop 23211  TopOnctopon 23228  neicnei 23415  Filcfil 24164   fLim cflim 24253
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-fbas 21675  df-top 23212  df-topon 23229  df-ntr 23338  df-nei 23416  df-fil 24165  df-flim 24258
This theorem is used by:  flimcf  24301
  Copyright terms: Public domain W3C validator