Theorem alexsub 24217

Description: The Alexander Subbase Theorem: If 𝐵 is a subbase for the topology 𝐽, and any cover taken from 𝐵 has a finite subcover, then the generated topology is compact. This proof uses the ultrafilter lemma; see alexsubALT 24223 for a proof using Zorn's lemma. (Contributed by Jeff Hankins, 24-Jan-2010.) (Revised by Mario Carneiro, 26-Aug-2015.)

Hypotheses

Ref	Expression
alexsub.1	⊢ (𝜑 → 𝑋 ∈ UFL)
alexsub.2	⊢ (𝜑 → 𝑋 = ∪ 𝐵)
alexsub.3	⊢ (𝜑 → 𝐽 = (topGen‘(fi‘𝐵)))
alexsub.4	⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)

Assertion

Ref	Expression
alexsub	⊢ (𝜑 → 𝐽 ∈ Comp)

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐽,𝑦   𝜑,𝑥,𝑦   𝑥,𝑋,𝑦

Proof of Theorem alexsub

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		alexsub.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ UFL)
2	1	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑋 ∈ UFL)
3		alexsub.2	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 = ∪ 𝐵)
4	3	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑋 = ∪ 𝐵)
5		alexsub.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 = (topGen‘(fi‘𝐵)))
6	5	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝐽 = (topGen‘(fi‘𝐵)))
7		alexsub.4	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)
8	7	adantlr 728	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦)
9		simprl 783	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑓 ∈ (UFil‘𝑋))
10		simprr 785	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → (𝐽 fLim 𝑓) = ∅)
11	2, 4, 6, 8, 9, 10	alexsublem 24216	. . . . . . 7 ⊢ ¬ (𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅))
12	11	pm2.21i 120	. . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → ¬ (𝐽 fLim 𝑓) = ∅)
13	12	expr 462	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ((𝐽 fLim 𝑓) = ∅ → ¬ (𝐽 fLim 𝑓) = ∅))
14	13	pm2.01d 192	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ¬ (𝐽 fLim 𝑓) = ∅)
15	14	neqned 2968	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → (𝐽 fLim 𝑓) ≠ ∅)
16	15	ralrimiva 3160	. 2 ⊢ (𝜑 → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)
17		fibas 23149	. . . . . 6 ⊢ (fi‘𝐵) ∈ TopBases
18		tgtopon 23143	. . . . . 6 ⊢ ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵)))
19	17, 18	ax-mp 5	. . . . 5 ⊢ (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵))
20	5, 19	eqeltrdi 2874	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ (fi‘𝐵)))
21	1	elexd 3481	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ V)
22	3, 21	eqeltrrd 2867	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵 ∈ V)
23		uniexb 7765	. . . . . . . 8 ⊢ (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V)
24	22, 23	sylibr 237	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ V)
25		fiuni 9390	. . . . . . 7 ⊢ (𝐵 ∈ V → ∪ 𝐵 = ∪ (fi‘𝐵))
26	24, 25	syl 18	. . . . . 6 ⊢ (𝜑 → ∪ 𝐵 = ∪ (fi‘𝐵))
27	3, 26	eqtrd 2801	. . . . 5 ⊢ (𝜑 → 𝑋 = ∪ (fi‘𝐵))
28	27	fveq2d 6889	. . . 4 ⊢ (𝜑 → (TopOn‘𝑋) = (TopOn‘∪ (fi‘𝐵)))
29	20, 28	eleqtrrd 2869	. . 3 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
30		ufilcmp 24204	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅))
31	1, 29, 30	syl2anc 596	. 2 ⊢ (𝜑 → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅))
32	16, 31	mpbird 260	1 ⊢ (𝜑 → 𝐽 ∈ Comp)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  ∃wrex 3092  Vcvv 3458   ∩ cin 3907   ⊆ wss 3908  ∅c0 4289  𝒫 cpw 4565  ∪ cuni 4875  ‘cfv 6540  (class class class)co 7416  Fincfn 8945  ficfi 9372  topGenctg 17500  TopOnctopon 23082  TopBasesctb 23117  Compccmp 23558  UFilcufil 24071  UFLcufl 24072   fLim cflim 24106

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5241  ax-sep 5260  ax-nul 5272  ax-pow 5339  ax-pr 5407  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-int 4916  df-iun 4961  df-iin 4962  df-br 5113  df-opab 5177  df-mpt 5196  df-tr 5222  df-id 5559  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-1o 8455  df-2o 8456  df-en 8946  df-dom 8947  df-fin 8949  df-fi 9373  df-topgen 17506  df-fbas 21534  df-fg 21535  df-top 23066  df-topon 23083  df-bases 23118  df-cld 23191  df-ntr 23192  df-cls 23193  df-nei 23270  df-cmp 23559  df-fil 24018  df-ufil 24073  df-ufl 24074  df-flim 24111  df-fcls 24113

This theorem is used by:  alexsubb  24218  ptcmplem5  24228