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

Theorem flimss1 23929
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 2737 . . . . . . 7 𝐾 = 𝐾
21flimelbas 23924 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 𝐾)
32adantl 481 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 𝐾)
4 simpl2 1194 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘𝑋))
5 filunibas 23837 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → 𝐹 = 𝑋)
64, 5syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 = 𝑋)
71flimfil 23925 . . . . . . . 8 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐹 ∈ (Fil‘ 𝐾))
87adantl 481 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 ∈ (Fil‘ 𝐾))
9 filunibas 23837 . . . . . . 7 (𝐹 ∈ (Fil‘ 𝐾) → 𝐹 = 𝐾)
108, 9syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐹 = 𝐾)
116, 10eqtr3d 2774 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = 𝐾)
123, 11eleqtrrd 2840 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥𝑋)
13 simpl1 1193 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ (TopOn‘𝑋))
14 topontop 22869 . . . . . . 7 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1513, 14syl 17 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 ∈ Top)
16 flimtop 23921 . . . . . . 7 (𝑥 ∈ (𝐾 fLim 𝐹) → 𝐾 ∈ Top)
1716adantl 481 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐾 ∈ Top)
18 toponuni 22870 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1913, 18syl 17 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑋 = 𝐽)
2019, 11eqtr3d 2774 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽 = 𝐾)
21 simpl3 1195 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝐽𝐾)
22 eqid 2737 . . . . . . 7 𝐽 = 𝐽
2322, 1topssnei 23080 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐾 ∈ Top ∧ 𝐽 = 𝐾) ∧ 𝐽𝐾) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
2415, 17, 20, 21, 23syl31anc 1376 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ ((nei‘𝐾)‘{𝑥}))
25 flimneiss 23922 . . . . . 6 (𝑥 ∈ (𝐾 fLim 𝐹) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2625adantl 481 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐾)‘{𝑥}) ⊆ 𝐹)
2724, 26sstrd 3946 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)
28 elflim 23927 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
2913, 4, 28syl2anc 585 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥𝑋 ∧ ((nei‘𝐽)‘{𝑥}) ⊆ 𝐹)))
3012, 27, 29mpbir2and 714 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) ∧ 𝑥 ∈ (𝐾 fLim 𝐹)) → 𝑥 ∈ (𝐽 fLim 𝐹))
3130ex 412 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) → (𝑥 ∈ (𝐾 fLim 𝐹) → 𝑥 ∈ (𝐽 fLim 𝐹)))
3231ssrdv 3941 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐽𝐾) → (𝐾 fLim 𝐹) ⊆ (𝐽 fLim 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wss 3903  {csn 4582   cuni 4865  cfv 6500  (class class class)co 7368  Topctop 22849  TopOnctopon 22866  neicnei 23053  Filcfil 23801   fLim cflim 23890
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-fbas 21318  df-top 22850  df-topon 22867  df-ntr 22976  df-nei 23054  df-fil 23802  df-flim 23895
This theorem is referenced by:  flimcf  23938
  Copyright terms: Public domain W3C validator