fclscmp - Metamath Proof Explorer

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

Theorem fclscmp 23754

Description: A space is compact iff every filter clusters. (Contributed by Jeff Hankins, 20-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)

**Assertion**
Ref	Expression
fclscmp	⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅))

Distinct variable groups: 𝑓,𝐽 𝑓,𝑋

Proof of Theorem fclscmp Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2730	. . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽
2	1	fclscmpi 23753	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑓 ∈ (Fil‘∪ 𝐽)) → (𝐽 fClus 𝑓) ≠ ∅)
3	2	ralrimiva 3144	. . 3 ⊢ (𝐽 ∈ Comp → ∀𝑓 ∈ (Fil‘∪ 𝐽)(𝐽 fClus 𝑓) ≠ ∅)
4		toponuni 22636	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
5	4	fveq2d 6894	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (Fil‘𝑋) = (Fil‘∪ 𝐽))
6	5	raleqdv 3323	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ ↔ ∀𝑓 ∈ (Fil‘∪ 𝐽)(𝐽 fClus 𝑓) ≠ ∅))
7	3, 6	imbitrrid 245	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Comp → ∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅))
8		elpwi 4608	. . . . . 6 ⊢ (𝑥 ∈ 𝒫 (Clsd‘𝐽) → 𝑥 ⊆ (Clsd‘𝐽))
9		vn0 4337	. . . . . . . . . 10 ⊢ V ≠ ∅
10		simpr 483	. . . . . . . . . . . . 13 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 = ∅) → 𝑥 = ∅)
11	10	inteqd 4954	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 = ∅) → ∩ 𝑥 = ∩ ∅)
12		int0 4965	. . . . . . . . . . . 12 ⊢ ∩ ∅ = V
13	11, 12	eqtrdi 2786	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 = ∅) → ∩ 𝑥 = V)
14	13	neeq1d 2998	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 = ∅) → (∩ 𝑥 ≠ ∅ ↔ V ≠ ∅))
15	9, 14	mpbiri 257	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 = ∅) → ∩ 𝑥 ≠ ∅)
16	15	a1d 25	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 = ∅) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∩ 𝑥 ≠ ∅))
17		ssfii 9416	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ V → 𝑥 ⊆ (fi‘𝑥))
18	17	elv 3478	. . . . . . . . . . . . . . 15 ⊢ 𝑥 ⊆ (fi‘𝑥)
19		simplrl 773	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ (Clsd‘𝐽))
20	1	cldss2 22754	. . . . . . . . . . . . . . . . . . 19 ⊢ (Clsd‘𝐽) ⊆ 𝒫 ∪ 𝐽
21	4	ad2antrr 722	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝑋 = ∪ 𝐽)
22	21	pweqd 4618	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝒫 𝑋 = 𝒫 ∪ 𝐽)
23	20, 22	sseqtrrid 4034	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → (Clsd‘𝐽) ⊆ 𝒫 𝑋)
24	19, 23	sstrd 3991	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ 𝒫 𝑋)
25		simpr 483	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝑥 ≠ ∅)
26		simplrr 774	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → ¬ ∅ ∈ (fi‘𝑥))
27		toponmax 22648	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
28	27	ad2antrr 722	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝑋 ∈ 𝐽)
29		fsubbas 23591	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑋 ∈ 𝐽 → ((fi‘𝑥) ∈ (fBas‘𝑋) ↔ (𝑥 ⊆ 𝒫 𝑋 ∧ 𝑥 ≠ ∅ ∧ ¬ ∅ ∈ (fi‘𝑥))))
30	28, 29	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → ((fi‘𝑥) ∈ (fBas‘𝑋) ↔ (𝑥 ⊆ 𝒫 𝑋 ∧ 𝑥 ≠ ∅ ∧ ¬ ∅ ∈ (fi‘𝑥))))
31	24, 25, 26, 30	mpbir3and 1340	. . . . . . . . . . . . . . . 16 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → (fi‘𝑥) ∈ (fBas‘𝑋))
32		ssfg 23596	. . . . . . . . . . . . . . . 16 ⊢ ((fi‘𝑥) ∈ (fBas‘𝑋) → (fi‘𝑥) ⊆ (𝑋filGen(fi‘𝑥)))
33	31, 32	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → (fi‘𝑥) ⊆ (𝑋filGen(fi‘𝑥)))
34	18, 33	sstrid 3992	. . . . . . . . . . . . . 14 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → 𝑥 ⊆ (𝑋filGen(fi‘𝑥)))
35	34	sselda 3981	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ (𝑋filGen(fi‘𝑥)))
36		fclssscls 23742	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (𝑋filGen(fi‘𝑥)) → (𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ ((cls‘𝐽)‘𝑦))
37	35, 36	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) ∧ 𝑦 ∈ 𝑥) → (𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ ((cls‘𝐽)‘𝑦))
38	19	sselda 3981	. . . . . . . . . . . . 13 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ (Clsd‘𝐽))
39		cldcls 22766	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (Clsd‘𝐽) → ((cls‘𝐽)‘𝑦) = 𝑦)
40	38, 39	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) ∧ 𝑦 ∈ 𝑥) → ((cls‘𝐽)‘𝑦) = 𝑦)
41	37, 40	sseqtrd 4021	. . . . . . . . . . 11 ⊢ ((((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) ∧ 𝑦 ∈ 𝑥) → (𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ 𝑦)
42	41	ralrimiva 3144	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → ∀𝑦 ∈ 𝑥 (𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ 𝑦)
43		ssint 4967	. . . . . . . . . 10 ⊢ ((𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ ∩ 𝑥 ↔ ∀𝑦 ∈ 𝑥 (𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ 𝑦)
44	42, 43	sylibr 233	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → (𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ ∩ 𝑥)
45		fgcl 23602	. . . . . . . . . 10 ⊢ ((fi‘𝑥) ∈ (fBas‘𝑋) → (𝑋filGen(fi‘𝑥)) ∈ (Fil‘𝑋))
46		oveq2 7419	. . . . . . . . . . . 12 ⊢ (𝑓 = (𝑋filGen(fi‘𝑥)) → (𝐽 fClus 𝑓) = (𝐽 fClus (𝑋filGen(fi‘𝑥))))
47	46	neeq1d 2998	. . . . . . . . . . 11 ⊢ (𝑓 = (𝑋filGen(fi‘𝑥)) → ((𝐽 fClus 𝑓) ≠ ∅ ↔ (𝐽 fClus (𝑋filGen(fi‘𝑥))) ≠ ∅))
48	47	rspcv 3607	. . . . . . . . . 10 ⊢ ((𝑋filGen(fi‘𝑥)) ∈ (Fil‘𝑋) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → (𝐽 fClus (𝑋filGen(fi‘𝑥))) ≠ ∅))
49	31, 45, 48	3syl 18	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → (𝐽 fClus (𝑋filGen(fi‘𝑥))) ≠ ∅))
50		ssn0 4399	. . . . . . . . 9 ⊢ (((𝐽 fClus (𝑋filGen(fi‘𝑥))) ⊆ ∩ 𝑥 ∧ (𝐽 fClus (𝑋filGen(fi‘𝑥))) ≠ ∅) → ∩ 𝑥 ≠ ∅)
51	44, 49, 50	syl6an 680	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) ∧ 𝑥 ≠ ∅) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∩ 𝑥 ≠ ∅))
52	16, 51	pm2.61dane 3027	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝑥 ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘𝑥))) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∩ 𝑥 ≠ ∅))
53	52	expr 455	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥 ⊆ (Clsd‘𝐽)) → (¬ ∅ ∈ (fi‘𝑥) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∩ 𝑥 ≠ ∅)))
54	8, 53	sylan2 591	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥 ∈ 𝒫 (Clsd‘𝐽)) → (¬ ∅ ∈ (fi‘𝑥) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∩ 𝑥 ≠ ∅)))
55	54	com23 86	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑥 ∈ 𝒫 (Clsd‘𝐽)) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → (¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅)))
56	55	ralrimdva 3152	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅)))
57		topontop 22635	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
58		cmpfi 23132	. . . 4 ⊢ (𝐽 ∈ Top → (𝐽 ∈ Comp ↔ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅)))
59	57, 58	syl 17	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Comp ↔ ∀𝑥 ∈ 𝒫 (Clsd‘𝐽)(¬ ∅ ∈ (fi‘𝑥) → ∩ 𝑥 ≠ ∅)))
60	56, 59	sylibrd 258	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → 𝐽 ∈ Comp))
61	7, 60	impbid 211	1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (Fil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∀wral 3059 Vcvv 3472 ⊆ wss 3947 ∅c0 4321 𝒫 cpw 4601 ∪ cuni 4907 ∩ cint 4949 ‘cfv 6542 (class class class)co 7411 ficfi 9407 fBascfbas 21132 filGencfg 21133 Topctop 22615 TopOnctopon 22632 Clsdccld 22740 clsccl 22742 Compccmp 23110 Filcfil 23569 fClus cfcls 23660

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1o 8468 df-er 8705 df-en 8942 df-fin 8945 df-fi 9408 df-fbas 21141 df-fg 21142 df-top 22616 df-topon 22633 df-cld 22743 df-cls 22745 df-cmp 23111 df-fil 23570 df-fcls 23665

This theorem is referenced by: ufilcmp 23756

W3C validator