Theorem ufilcmp 24027

Description: A space is compact iff every ultrafilter converges. (Contributed by Jeff Hankins, 11-Dec-2009.) (Proof shortened by Mario Carneiro, 12-Apr-2015.) (Revised by Mario Carneiro, 26-Aug-2015.)

Assertion

Ref	Expression
ufilcmp	⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅))

Distinct variable groups:   𝑓,𝐽   𝑓,𝑋

Proof of Theorem ufilcmp

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ufilfil 23899	. . . . . 6 ⊢ (𝑓 ∈ (UFil‘∪ 𝐽) → 𝑓 ∈ (Fil‘∪ 𝐽))
2		eqid 2726	. . . . . . 7 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	fclscmpi 24024	. . . . . 6 ⊢ ((𝐽 ∈ Comp ∧ 𝑓 ∈ (Fil‘∪ 𝐽)) → (𝐽 fClus 𝑓) ≠ ∅)
4	1, 3	sylan2 591	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑓 ∈ (UFil‘∪ 𝐽)) → (𝐽 fClus 𝑓) ≠ ∅)
5	4	ralrimiva 3136	. . . 4 ⊢ (𝐽 ∈ Comp → ∀𝑓 ∈ (UFil‘∪ 𝐽)(𝐽 fClus 𝑓) ≠ ∅)
6		toponuni 22907	. . . . . . 7 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
7	6	fveq2d 6905	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (UFil‘𝑋) = (UFil‘∪ 𝐽))
8	7	raleqdv 3315	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ ↔ ∀𝑓 ∈ (UFil‘∪ 𝐽)(𝐽 fClus 𝑓) ≠ ∅))
9	8	adantl 480	. . . 4 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ ↔ ∀𝑓 ∈ (UFil‘∪ 𝐽)(𝐽 fClus 𝑓) ≠ ∅))
10	5, 9	imbitrrid 245	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅))
11		ufli 23909	. . . . . . 7 ⊢ ((𝑋 ∈ UFL ∧ 𝑔 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓)
12	11	adantlr 713	. . . . . 6 ⊢ (((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓)
13		r19.29 3104	. . . . . . 7 ⊢ ((∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ ∧ ∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓) → ∃𝑓 ∈ (UFil‘𝑋)((𝐽 fClus 𝑓) ≠ ∅ ∧ 𝑔 ⊆ 𝑓))
14		simpllr 774	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ (𝑓 ∈ (UFil‘𝑋) ∧ 𝑔 ⊆ 𝑓)) → 𝐽 ∈ (TopOn‘𝑋))
15		simplr 767	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ (𝑓 ∈ (UFil‘𝑋) ∧ 𝑔 ⊆ 𝑓)) → 𝑔 ∈ (Fil‘𝑋))
16		simprr 771	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ (𝑓 ∈ (UFil‘𝑋) ∧ 𝑔 ⊆ 𝑓)) → 𝑔 ⊆ 𝑓)
17		fclsss2 24018	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑔 ∈ (Fil‘𝑋) ∧ 𝑔 ⊆ 𝑓) → (𝐽 fClus 𝑓) ⊆ (𝐽 fClus 𝑔))
18	14, 15, 16, 17	syl3anc 1368	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ (𝑓 ∈ (UFil‘𝑋) ∧ 𝑔 ⊆ 𝑓)) → (𝐽 fClus 𝑓) ⊆ (𝐽 fClus 𝑔))
19		ssn0 4405	. . . . . . . . . . . 12 ⊢ (((𝐽 fClus 𝑓) ⊆ (𝐽 fClus 𝑔) ∧ (𝐽 fClus 𝑓) ≠ ∅) → (𝐽 fClus 𝑔) ≠ ∅)
20	19	ex 411	. . . . . . . . . . 11 ⊢ ((𝐽 fClus 𝑓) ⊆ (𝐽 fClus 𝑔) → ((𝐽 fClus 𝑓) ≠ ∅ → (𝐽 fClus 𝑔) ≠ ∅))
21	18, 20	syl 17	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ (𝑓 ∈ (UFil‘𝑋) ∧ 𝑔 ⊆ 𝑓)) → ((𝐽 fClus 𝑓) ≠ ∅ → (𝐽 fClus 𝑔) ≠ ∅))
22	21	expr 455	. . . . . . . . 9 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ 𝑓 ∈ (UFil‘𝑋)) → (𝑔 ⊆ 𝑓 → ((𝐽 fClus 𝑓) ≠ ∅ → (𝐽 fClus 𝑔) ≠ ∅)))
23	22	impcomd 410	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) ∧ 𝑓 ∈ (UFil‘𝑋)) → (((𝐽 fClus 𝑓) ≠ ∅ ∧ 𝑔 ⊆ 𝑓) → (𝐽 fClus 𝑔) ≠ ∅))
24	23	rexlimdva 3145	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) → (∃𝑓 ∈ (UFil‘𝑋)((𝐽 fClus 𝑓) ≠ ∅ ∧ 𝑔 ⊆ 𝑓) → (𝐽 fClus 𝑔) ≠ ∅))
25	13, 24	syl5 34	. . . . . 6 ⊢ (((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) → ((∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ ∧ ∃𝑓 ∈ (UFil‘𝑋)𝑔 ⊆ 𝑓) → (𝐽 fClus 𝑔) ≠ ∅))
26	12, 25	mpan2d 692	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) ∧ 𝑔 ∈ (Fil‘𝑋)) → (∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → (𝐽 fClus 𝑔) ≠ ∅))
27	26	ralrimdva 3144	. . . 4 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → ∀𝑔 ∈ (Fil‘𝑋)(𝐽 fClus 𝑔) ≠ ∅))
28		fclscmp 24025	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Comp ↔ ∀𝑔 ∈ (Fil‘𝑋)(𝐽 fClus 𝑔) ≠ ∅))
29	28	adantl 480	. . . 4 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑔 ∈ (Fil‘𝑋)(𝐽 fClus 𝑔) ≠ ∅))
30	27, 29	sylibrd 258	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ → 𝐽 ∈ Comp))
31	10, 30	impbid 211	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅))
32		uffclsflim 24026	. . . 4 ⊢ (𝑓 ∈ (UFil‘𝑋) → (𝐽 fClus 𝑓) = (𝐽 fLim 𝑓))
33	32	neeq1d 2990	. . 3 ⊢ (𝑓 ∈ (UFil‘𝑋) → ((𝐽 fClus 𝑓) ≠ ∅ ↔ (𝐽 fLim 𝑓) ≠ ∅))
34	33	ralbiia 3081	. 2 ⊢ (∀𝑓 ∈ (UFil‘𝑋)(𝐽 fClus 𝑓) ≠ ∅ ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)
35	31, 34	bitrdi 286	1 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∈ wcel 2099   ≠ wne 2930  ∀wral 3051  ∃wrex 3060   ⊆ wss 3947  ∅c0 4325  ∪ cuni 4913  ‘cfv 6554  (class class class)co 7424  TopOnctopon 22903  Compccmp 23381  Filcfil 23840  UFilcufil 23894  UFLcufl 23895   fLim cflim 23929   fClus cfcls 23931

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5290  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433  ax-un 7746

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3967  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-int 4955  df-iun 5003  df-iin 5004  df-br 5154  df-opab 5216  df-mpt 5237  df-tr 5271  df-id 5580  df-eprel 5586  df-po 5594  df-so 5595  df-fr 5637  df-we 5639  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-ord 6379  df-on 6380  df-lim 6381  df-suc 6382  df-iota 6506  df-fun 6556  df-fn 6557  df-f 6558  df-f1 6559  df-fo 6560  df-f1o 6561  df-fv 6562  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7877  df-1o 8496  df-2o 8497  df-en 8975  df-dom 8976  df-fin 8978  df-fi 9454  df-fbas 21340  df-fg 21341  df-top 22887  df-topon 22904  df-cld 23014  df-ntr 23015  df-cls 23016  df-nei 23093  df-cmp 23382  df-fil 23841  df-ufil 23896  df-ufl 23897  df-flim 23934  df-fcls 23936

This theorem is referenced by:  alexsub  24040