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

Theorem flimsncls 24015
Description: If 𝐴 is a limit point of the filter 𝐹, then all the points which specialize 𝐴 (in the specialization preorder) are also limit points. Thus, the set of limit points is a union of closed sets (although this is only nontrivial for non-T1 spaces). (Contributed by Mario Carneiro, 20-Sep-2015.)
Assertion
Ref Expression
flimsncls (𝐴 ∈ (𝐽 fLim 𝐹) → ((cls‘𝐽)‘{𝐴}) ⊆ (𝐽 fLim 𝐹))

Proof of Theorem flimsncls
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 flimtop 23994 . . . . . 6 (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐽 ∈ Top)
2 eqid 2740 . . . . . . . 8 𝐽 = 𝐽
32flimelbas 23997 . . . . . . 7 (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐴 𝐽)
43snssd 4834 . . . . . 6 (𝐴 ∈ (𝐽 fLim 𝐹) → {𝐴} ⊆ 𝐽)
52clsss3 23088 . . . . . 6 ((𝐽 ∈ Top ∧ {𝐴} ⊆ 𝐽) → ((cls‘𝐽)‘{𝐴}) ⊆ 𝐽)
61, 4, 5syl2anc 583 . . . . 5 (𝐴 ∈ (𝐽 fLim 𝐹) → ((cls‘𝐽)‘{𝐴}) ⊆ 𝐽)
76sselda 4008 . . . 4 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → 𝑥 𝐽)
8 simpll 766 . . . . . . 7 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝐴 ∈ (𝐽 fLim 𝐹))
98, 1syl 17 . . . . . . . 8 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝐽 ∈ Top)
10 simprl 770 . . . . . . . 8 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝑦𝐽)
111adantr 480 . . . . . . . . . 10 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → 𝐽 ∈ Top)
124adantr 480 . . . . . . . . . 10 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → {𝐴} ⊆ 𝐽)
13 simpr 484 . . . . . . . . . 10 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → 𝑥 ∈ ((cls‘𝐽)‘{𝐴}))
1411, 12, 133jca 1128 . . . . . . . . 9 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → (𝐽 ∈ Top ∧ {𝐴} ⊆ 𝐽𝑥 ∈ ((cls‘𝐽)‘{𝐴})))
152clsndisj 23104 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ {𝐴} ⊆ 𝐽𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → (𝑦 ∩ {𝐴}) ≠ ∅)
16 disjsn 4736 . . . . . . . . . . 11 ((𝑦 ∩ {𝐴}) = ∅ ↔ ¬ 𝐴𝑦)
1716necon2abii 2997 . . . . . . . . . 10 (𝐴𝑦 ↔ (𝑦 ∩ {𝐴}) ≠ ∅)
1815, 17sylibr 234 . . . . . . . . 9 (((𝐽 ∈ Top ∧ {𝐴} ⊆ 𝐽𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝐴𝑦)
1914, 18sylan 579 . . . . . . . 8 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝐴𝑦)
20 opnneip 23148 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑦𝐽𝐴𝑦) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
219, 10, 19, 20syl3anc 1371 . . . . . . 7 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝑦 ∈ ((nei‘𝐽)‘{𝐴}))
22 flimnei 23996 . . . . . . 7 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑦 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑦𝐹)
238, 21, 22syl2anc 583 . . . . . 6 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ (𝑦𝐽𝑥𝑦)) → 𝑦𝐹)
2423expr 456 . . . . 5 (((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) ∧ 𝑦𝐽) → (𝑥𝑦𝑦𝐹))
2524ralrimiva 3152 . . . 4 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → ∀𝑦𝐽 (𝑥𝑦𝑦𝐹))
26 toptopon2 22945 . . . . . 6 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘ 𝐽))
2711, 26sylib 218 . . . . 5 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → 𝐽 ∈ (TopOn‘ 𝐽))
282flimfil 23998 . . . . . 6 (𝐴 ∈ (𝐽 fLim 𝐹) → 𝐹 ∈ (Fil‘ 𝐽))
2928adantr 480 . . . . 5 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → 𝐹 ∈ (Fil‘ 𝐽))
30 flimopn 24004 . . . . 5 ((𝐽 ∈ (TopOn‘ 𝐽) ∧ 𝐹 ∈ (Fil‘ 𝐽)) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 𝐽 ∧ ∀𝑦𝐽 (𝑥𝑦𝑦𝐹))))
3127, 29, 30syl2anc 583 . . . 4 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → (𝑥 ∈ (𝐽 fLim 𝐹) ↔ (𝑥 𝐽 ∧ ∀𝑦𝐽 (𝑥𝑦𝑦𝐹))))
327, 25, 31mpbir2and 712 . . 3 ((𝐴 ∈ (𝐽 fLim 𝐹) ∧ 𝑥 ∈ ((cls‘𝐽)‘{𝐴})) → 𝑥 ∈ (𝐽 fLim 𝐹))
3332ex 412 . 2 (𝐴 ∈ (𝐽 fLim 𝐹) → (𝑥 ∈ ((cls‘𝐽)‘{𝐴}) → 𝑥 ∈ (𝐽 fLim 𝐹)))
3433ssrdv 4014 1 (𝐴 ∈ (𝐽 fLim 𝐹) → ((cls‘𝐽)‘{𝐴}) ⊆ (𝐽 fLim 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087  wcel 2108  wne 2946  wral 3067  cin 3975  wss 3976  c0 4352  {csn 4648   cuni 4931  cfv 6573  (class class class)co 7448  Topctop 22920  TopOnctopon 22937  clsccl 23047  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-int 4971  df-iun 5017  df-iin 5018  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-cld 23048  df-ntr 23049  df-cls 23050  df-nei 23127  df-fil 23875  df-flim 23968
This theorem is referenced by:  tsmscls  24167
  Copyright terms: Public domain W3C validator