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

Theorem supnfcls 22037
Description: The filter of supersets of 𝑋𝑈 does not cluster at any point of the open set 𝑈. (Contributed by Mario Carneiro, 11-Apr-2015.) (Revised by Mario Carneiro, 26-Aug-2015.)
Assertion
Ref Expression
supnfcls ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) → ¬ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥}))
Distinct variable groups:   𝑥,𝐽   𝑥,𝑋   𝑥,𝑈
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem supnfcls
StepHypRef Expression
1 disjdif 4236 . 2 (𝑈 ∩ (𝑋𝑈)) = ∅
2 simpr 473 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥}))
3 simpl2 1237 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → 𝑈𝐽)
4 simpl3 1239 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → 𝐴𝑈)
5 difss 3936 . . . . . . 7 (𝑋𝑈) ⊆ 𝑋
6 simpl1 1235 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → 𝐽 ∈ (TopOn‘𝑋))
7 toponmax 20944 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝑋𝐽)
8 elpw2g 5019 . . . . . . . 8 (𝑋𝐽 → ((𝑋𝑈) ∈ 𝒫 𝑋 ↔ (𝑋𝑈) ⊆ 𝑋))
96, 7, 83syl 18 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → ((𝑋𝑈) ∈ 𝒫 𝑋 ↔ (𝑋𝑈) ⊆ 𝑋))
105, 9mpbiri 249 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → (𝑋𝑈) ∈ 𝒫 𝑋)
11 ssidd 3821 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → (𝑋𝑈) ⊆ (𝑋𝑈))
12 sseq2 3824 . . . . . . 7 (𝑥 = (𝑋𝑈) → ((𝑋𝑈) ⊆ 𝑥 ↔ (𝑋𝑈) ⊆ (𝑋𝑈)))
1312elrab 3559 . . . . . 6 ((𝑋𝑈) ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥} ↔ ((𝑋𝑈) ∈ 𝒫 𝑋 ∧ (𝑋𝑈) ⊆ (𝑋𝑈)))
1410, 11, 13sylanbrc 574 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → (𝑋𝑈) ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})
15 fclsopni 22032 . . . . 5 ((𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥}) ∧ (𝑈𝐽𝐴𝑈 ∧ (𝑋𝑈) ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → (𝑈 ∩ (𝑋𝑈)) ≠ ∅)
162, 3, 4, 14, 15syl13anc 1484 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})) → (𝑈 ∩ (𝑋𝑈)) ≠ ∅)
1716ex 399 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) → (𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥}) → (𝑈 ∩ (𝑋𝑈)) ≠ ∅))
1817necon2bd 2994 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) → ((𝑈 ∩ (𝑋𝑈)) = ∅ → ¬ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥})))
191, 18mpi 20 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈𝐽𝐴𝑈) → ¬ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋𝑈) ⊆ 𝑥}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wa 384  w3a 1100   = wceq 1637  wcel 2156  wne 2978  {crab 3100  cdif 3766  cin 3768  wss 3769  c0 4116  𝒫 cpw 4351  cfv 6101  (class class class)co 6874  TopOnctopon 20928   fClus cfcls 21953
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2068  ax-7 2104  ax-8 2158  ax-9 2165  ax-10 2185  ax-11 2201  ax-12 2214  ax-13 2420  ax-ext 2784  ax-rep 4964  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5096  ax-un 7179
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2061  df-eu 2634  df-mo 2635  df-clab 2793  df-cleq 2799  df-clel 2802  df-nfc 2937  df-ne 2979  df-nel 3082  df-ral 3101  df-rex 3102  df-reu 3103  df-rab 3105  df-v 3393  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4117  df-if 4280  df-pw 4353  df-sn 4371  df-pr 4373  df-op 4377  df-uni 4631  df-int 4670  df-iun 4714  df-iin 4715  df-br 4845  df-opab 4907  df-mpt 4924  df-id 5219  df-xp 5317  df-rel 5318  df-cnv 5319  df-co 5320  df-dm 5321  df-rn 5322  df-res 5323  df-ima 5324  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-f1 6106  df-fo 6107  df-f1o 6108  df-fv 6109  df-ov 6877  df-oprab 6878  df-mpt2 6879  df-fbas 19951  df-top 20912  df-topon 20929  df-cld 21037  df-ntr 21038  df-cls 21039  df-fil 21863  df-fcls 21958
This theorem is referenced by:  fclscf  22042
  Copyright terms: Public domain W3C validator