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

Theorem alexsub 24271
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 24277 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.
StepHypRef Expression
1 alexsub.1 . . . . . . . . 9 (𝜑𝑋 ∈ UFL)
21adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑋 ∈ UFL)
3 alexsub.2 . . . . . . . . 9 (𝜑𝑋 = 𝐵)
43adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑋 = 𝐵)
5 alexsub.3 . . . . . . . . 9 (𝜑𝐽 = (topGen‘(fi‘𝐵)))
65adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝐽 = (topGen‘(fi‘𝐵)))
7 alexsub.4 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑋 = 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)
87adantlr 728 . . . . . . . 8 (((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) ∧ (𝑥𝐵𝑋 = 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)
9 simprl 783 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑓 ∈ (UFil‘𝑋))
10 simprr 785 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → (𝐽 fLim 𝑓) = ∅)
112, 4, 6, 8, 9, 10alexsublem 24270 . . . . . . 7 ¬ (𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅))
1211pm2.21i 120 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → ¬ (𝐽 fLim 𝑓) = ∅)
1312expr 462 . . . . 5 ((𝜑𝑓 ∈ (UFil‘𝑋)) → ((𝐽 fLim 𝑓) = ∅ → ¬ (𝐽 fLim 𝑓) = ∅))
1413pm2.01d 192 . . . 4 ((𝜑𝑓 ∈ (UFil‘𝑋)) → ¬ (𝐽 fLim 𝑓) = ∅)
1514neqned 2962 . . 3 ((𝜑𝑓 ∈ (UFil‘𝑋)) → (𝐽 fLim 𝑓) ≠ ∅)
1615ralrimiva 3154 . 2 (𝜑 → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)
17 fibas 23202 . . . . . 6 (fi‘𝐵) ∈ TopBases
18 tgtopon 23196 . . . . . 6 ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) ∈ (TopOn‘ (fi‘𝐵)))
1917, 18ax-mp 5 . . . . 5 (topGen‘(fi‘𝐵)) ∈ (TopOn‘ (fi‘𝐵))
205, 19eqeltrdi 2868 . . . 4 (𝜑𝐽 ∈ (TopOn‘ (fi‘𝐵)))
211elexd 3473 . . . . . . . . 9 (𝜑𝑋 ∈ V)
223, 21eqeltrrd 2861 . . . . . . . 8 (𝜑 𝐵 ∈ V)
23 uniexb 7763 . . . . . . . 8 (𝐵 ∈ V ↔ 𝐵 ∈ V)
2422, 23sylibr 237 . . . . . . 7 (𝜑𝐵 ∈ V)
25 fiuni 9398 . . . . . . 7 (𝐵 ∈ V → 𝐵 = (fi‘𝐵))
2624, 25syl 18 . . . . . 6 (𝜑 𝐵 = (fi‘𝐵))
273, 26eqtrd 2795 . . . . 5 (𝜑𝑋 = (fi‘𝐵))
2827fveq2d 6882 . . . 4 (𝜑 → (TopOn‘𝑋) = (TopOn‘ (fi‘𝐵)))
2920, 28eleqtrrd 2863 . . 3 (𝜑𝐽 ∈ (TopOn‘𝑋))
30 ufilcmp 24258 . . 3 ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅))
311, 29, 30syl2anc 596 . 2 (𝜑 → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅))
3216, 31mpbird 260 1 (𝜑𝐽 ∈ Comp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wne 2955  wral 3076  wrex 3086  Vcvv 3450  cin 3898  wss 3899  c0 4279  𝒫 cpw 4557   cuni 4867  cfv 6533  (class class class)co 7413  Fincfn 8952  ficfi 9380  topGenctg 17522  TopOnctopon 23135  TopBasesctb 23170  Compccmp 23611  UFilcufil 24125  UFLcufl 24126   fLim cflim 24160
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-1o 8455  df-2o 8456  df-en 8953  df-dom 8954  df-fin 8956  df-fi 9381  df-topgen 17528  df-fbas 21582  df-fg 21583  df-top 23119  df-topon 23136  df-bases 23171  df-cld 23244  df-ntr 23245  df-cls 23246  df-nei 23323  df-cmp 23612  df-fil 24072  df-ufil 24127  df-ufl 24128  df-flim 24165  df-fcls 24167
This theorem is used by:  alexsubb  24272  ptcmplem5  24282
  Copyright terms: Public domain W3C validator