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

Theorem flimss1 24002
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 2740 . . . . . . 7 𝐾 = 𝐾
21flimelbas 23997 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 𝐾)
32adantl 481 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 𝐾)
4 simpl2 1192 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘𝑋))
5 filunibas 23910 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → 𝐹 = 𝑋)
64, 5syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 = 𝑋)
71flimfil 23998 . . . . . . . 8 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐹 ∈ (Fil‘ 𝐾))
87adantl 481 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘ 𝐾))
9 filunibas 23910 . . . . . . 7 (𝐹 ∈ (Fil‘ 𝐾) → 𝐹 = 𝐾)
108, 9syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 = 𝐾)
116, 10eqtr3d 2782 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = 𝐾)
123, 11eleqtrrd 2847 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥𝑋)
13 simpl1 1191 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ (TopOn‘𝑋))
14 topontop 22940 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1513, 14syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ Top)
16 flimtop 23994 . . . . . . 7 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐾 ∈ Top)
1716adantl 481 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐾 ∈ Top)
18 toponuni 22941 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1913, 18syl 17 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = 𝐽)
2019, 11eqtr3d 2782 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 = 𝐾)
21 simpl3 1193 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽𝐾)
22 eqid 2740 . . . . . . 7 𝐽 = 𝐽
2322, 1topssnei 23153 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐽 = 𝐾) ∧ 𝐽𝐾) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
2415, 17, 20, 21, 23syl31anc 1373 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
25 flimneiss 23995 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2625adantl 481 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2724, 26sstrd 4019 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)
28 elflim 24000 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
2913, 4, 28syl2anc 583 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
3012, 27, 29mpbir2and 712 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹))
3130ex 412 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) → (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹)))
3231ssrdv 4014 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) → (𝐾 fLim 𝐹) ⊆ (𝐽 fLim 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2108  wss 3976  {csn 4648   cuni 4931  cfv 6573  (class class class)co 7448  Topctop 22920  TopOnctopon 22937  neicnei 23126  Filcfil 23874   fLim cflim 23963
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-fbas 21384  df-top 22921  df-topon 22938  df-ntr 23049  df-nei 23127  df-fil 23875  df-flim 23968
This theorem is referenced by:  flimcf  24011
  Copyright terms: Public domain W3C validator