Theorem fclscmpi 24165

Description: Forward direction of fclscmp 24166. Every filter clusters in a compact space. (Contributed by Mario Carneiro, 11-Apr-2015.) (Revised by Stefan O'Rear, 8-Aug-2015.)

Hypothesis

Ref	Expression
flimfnfcls.x	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
fclscmpi	⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐽 fClus 𝐹) ≠ ∅)

Proof of Theorem fclscmpi

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cmptop 23531	. . . 4 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top)
2		flimfnfcls.x	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
3	2	fclsval 24144	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐽 fClus 𝐹) = if(𝑋 = 𝑋, ∩ 𝑥 ∈ 𝐹 ((cls‘𝐽)‘𝑥), ∅))
4		eqid 2761	. . . . . 6 ⊢ 𝑋 = 𝑋
5	4	iftruei 4493	. . . . 5 ⊢ if(𝑋 = 𝑋, ∩ 𝑥 ∈ 𝐹 ((cls‘𝐽)‘𝑥), ∅) = ∩ 𝑥 ∈ 𝐹 ((cls‘𝐽)‘𝑥)
6	3, 5	eqtrdi 2812	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐽 fClus 𝐹) = ∩ 𝑥 ∈ 𝐹 ((cls‘𝐽)‘𝑥))
7	1, 6	sylan 591	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐽 fClus 𝐹) = ∩ 𝑥 ∈ 𝐹 ((cls‘𝐽)‘𝑥))
8		fvex 6894	. . . 4 ⊢ ((cls‘𝐽)‘𝑥) ∈ V
9	8	dfiin3 5961	. . 3 ⊢ ∩ 𝑥 ∈ 𝐹 ((cls‘𝐽)‘𝑥) = ∩ ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥))
10	7, 9	eqtrdi 2812	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐽 fClus 𝐹) = ∩ ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)))
11		simpl 487	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐽 ∈ Comp)
12	11	adantr 485	. . . . . . 7 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝐽 ∈ Comp)
13	12, 1	syl 18	. . . . . 6 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝐽 ∈ Top)
14		filelss 23988	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ 𝐹) → 𝑥 ⊆ 𝑋)
15	14	adantll 726	. . . . . 6 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝑥 ⊆ 𝑋)
16	2	clscld 23183	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((cls‘𝐽)‘𝑥) ∈ (Clsd‘𝐽))
17	13, 15, 16	syl2anc 595	. . . . 5 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → ((cls‘𝐽)‘𝑥) ∈ (Clsd‘𝐽))
18	17	fmpttd 7110	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)):𝐹⟶(Clsd‘𝐽))
19	18	frnd 6714	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)) ⊆ (Clsd‘𝐽))
20		simpr 489	. . . . . 6 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ∈ (Fil‘𝑋))
21	20	adantr 485	. . . . . . . . 9 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝐹 ∈ (Fil‘𝑋))
22		simpr 489	. . . . . . . . 9 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝑥 ∈ 𝐹)
23	2	clsss3 23195	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → ((cls‘𝐽)‘𝑥) ⊆ 𝑋)
24	13, 15, 23	syl2anc 595	. . . . . . . . 9 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → ((cls‘𝐽)‘𝑥) ⊆ 𝑋)
25	2	sscls 23192	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑥 ⊆ 𝑋) → 𝑥 ⊆ ((cls‘𝐽)‘𝑥))
26	13, 15, 25	syl2anc 595	. . . . . . . . 9 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝑥 ⊆ ((cls‘𝐽)‘𝑥))
27		filss 23989	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ ((cls‘𝐽)‘𝑥) ⊆ 𝑋 ∧ 𝑥 ⊆ ((cls‘𝐽)‘𝑥))) → ((cls‘𝐽)‘𝑥) ∈ 𝐹)
28	21, 22, 24, 26, 27	syl13anc 1397	. . . . . . . 8 ⊢ (((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑥 ∈ 𝐹) → ((cls‘𝐽)‘𝑥) ∈ 𝐹)
29	28	fmpttd 7110	. . . . . . 7 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)):𝐹⟶𝐹)
30	29	frnd 6714	. . . . . 6 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)) ⊆ 𝐹)
31		fiss 9383	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)) ⊆ 𝐹) → (fi‘ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥))) ⊆ (fi‘𝐹))
32	20, 30, 31	syl2anc 595	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (fi‘ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥))) ⊆ (fi‘𝐹))
33		filfi 23995	. . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → (fi‘𝐹) = 𝐹)
34	20, 33	syl 18	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (fi‘𝐹) = 𝐹)
35	32, 34	sseqtrd 3972	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (fi‘ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥))) ⊆ 𝐹)
36		0nelfil 23985	. . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹)
37	20, 36	syl 18	. . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → ¬ ∅ ∈ 𝐹)
38	35, 37	ssneldd 3939	. . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → ¬ ∅ ∈ (fi‘ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥))))
39		cmpfii 23545	. . 3 ⊢ ((𝐽 ∈ Comp ∧ ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)) ⊆ (Clsd‘𝐽) ∧ ¬ ∅ ∈ (fi‘ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)))) → ∩ ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)) ≠ ∅)
40	11, 19, 38, 39	syl3anc 1396	. 2 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → ∩ ran (𝑥 ∈ 𝐹 ↦ ((cls‘𝐽)‘𝑥)) ≠ ∅)
41	10, 40	eqnetrd 3023	1 ⊢ ((𝐽 ∈ Comp ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐽 fClus 𝐹) ≠ ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1568   ∈ wcel 2141   ≠ wne 2956   ⊆ wss 3904  ∅c0 4285  ifcif 4486  ∪ cuni 4871  ∩ cint 4911  ∩ ciin 4956   ↦ cmpt 5191  ran crn 5662  ‘cfv 6536  (class class class)co 7410  ficfi 9369  Topctop 23029  Clsdccld 23152  clsccl 23154  Compccmp 23522  Filcfil 23981   fClus cfcls 24072

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7862  df-1o 8452  df-2o 8453  df-en 8943  df-dom 8944  df-fin 8946  df-fi 9370  df-fbas 21498  df-top 23030  df-cld 23155  df-cls 23157  df-cmp 23523  df-fil 23982  df-fcls 24077

This theorem is referenced by:  fclscmp  24166  ufilcmp  24168  relcmpcmet  25456