Theorem supnfcls 22871

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

Step	Hyp	Ref	Expression
1		disjdif 4372	. 2 ⊢ (𝑈 ∩ (𝑋 ∖ 𝑈)) = ∅
2		simpr 488	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥}))
3		simpl2 1194	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → 𝑈 ∈ 𝐽)
4		simpl3 1195	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → 𝐴 ∈ 𝑈)
5		sseq2 3913	. . . . . 6 ⊢ (𝑥 = (𝑋 ∖ 𝑈) → ((𝑋 ∖ 𝑈) ⊆ 𝑥 ↔ (𝑋 ∖ 𝑈) ⊆ (𝑋 ∖ 𝑈)))
6		difss 4032	. . . . . . 7 ⊢ (𝑋 ∖ 𝑈) ⊆ 𝑋
7		simpl1 1193	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → 𝐽 ∈ (TopOn‘𝑋))
8		toponmax 21777	. . . . . . . 8 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
9		elpw2g 5222	. . . . . . . 8 ⊢ (𝑋 ∈ 𝐽 → ((𝑋 ∖ 𝑈) ∈ 𝒫 𝑋 ↔ (𝑋 ∖ 𝑈) ⊆ 𝑋))
10	7, 8, 9	3syl 18	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → ((𝑋 ∖ 𝑈) ∈ 𝒫 𝑋 ↔ (𝑋 ∖ 𝑈) ⊆ 𝑋))
11	6, 10	mpbiri 261	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → (𝑋 ∖ 𝑈) ∈ 𝒫 𝑋)
12		ssidd 3910	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → (𝑋 ∖ 𝑈) ⊆ (𝑋 ∖ 𝑈))
13	5, 11, 12	elrabd 3593	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → (𝑋 ∖ 𝑈) ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})
14		fclsopni 22866	. . . . 5 ⊢ ((𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥}) ∧ (𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈 ∧ (𝑋 ∖ 𝑈) ∈ {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → (𝑈 ∩ (𝑋 ∖ 𝑈)) ≠ ∅)
15	2, 3, 4, 13, 14	syl13anc 1374	. . . 4 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) ∧ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})) → (𝑈 ∩ (𝑋 ∖ 𝑈)) ≠ ∅)
16	15	ex 416	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) → (𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥}) → (𝑈 ∩ (𝑋 ∖ 𝑈)) ≠ ∅))
17	16	necon2bd 2948	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) → ((𝑈 ∩ (𝑋 ∖ 𝑈)) = ∅ → ¬ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥})))
18	1, 17	mpi 20	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑈 ∈ 𝐽 ∧ 𝐴 ∈ 𝑈) → ¬ 𝐴 ∈ (𝐽 fClus {𝑥 ∈ 𝒫 𝑋 ∣ (𝑋 ∖ 𝑈) ⊆ 𝑥}))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1089   = wceq 1543   ∈ wcel 2112   ≠ wne 2932  {crab 3055   ∖ cdif 3850   ∩ cin 3852   ⊆ wss 3853  ∅c0 4223  𝒫 cpw 4499  ‘cfv 6358  (class class class)co 7191  TopOnctopon 21761   fClus cfcls 22787

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-nel 3037  df-ral 3056  df-rex 3057  df-reu 3058  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-int 4846  df-iun 4892  df-iin 4893  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7194  df-oprab 7195  df-mpo 7196  df-fbas 20314  df-top 21745  df-topon 21762  df-cld 21870  df-ntr 21871  df-cls 21872  df-fil 22697  df-fcls 22792

This theorem is referenced by:  fclscf  22876