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

Theorem alexsub 24419
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 24425 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 24418 . . . . . . 7 ¬ (𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅))
1211pm2.21i 120 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → ¬ (𝐽 fLim 𝑓) = ∅)
1312expr 462 . . . . 5 ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ((𝐽 fLim 𝑓) = ∅ → ¬ (𝐽 fLim 𝑓) = ∅))
1413pm2.01d 192 . . . 4 ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ¬ (𝐽 fLim 𝑓) = ∅)
1514neqned 2966 . . 3 ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → (𝐽 fLim 𝑓) ≠ ∅)
1615ralrimiva 3158 . 2 (𝜑 → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)
17 fibas 23350 . . . . . 6 (fi‘𝐵) ∈ TopBases
18 tgtopon 23344 . . . . . 6 ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵)))
1917, 18ax-mp 5 . . . . 5 (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵))
205, 19eqeltrdi 2872 . . . 4 (𝜑 → 𝐽 ∈ (TopOn‘∪ (fi‘𝐵)))
211elexd 3477 . . . . . . . . 9 (𝜑 → 𝑋 ∈ V)
223, 21eqeltrrd 2865 . . . . . . . 8 (𝜑 → ∪ 𝐵 ∈ V)
23 uniexb 7810 . . . . . . . 8 (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V)
2422, 23sylibr 237 . . . . . . 7 (𝜑 → 𝐵 ∈ V)
25 fiuni 9457 . . . . . . 7 (𝐵 ∈ V → ∪ 𝐵 = ∪ (fi‘𝐵))
2624, 25syl 18 . . . . . 6 (𝜑 → ∪ 𝐵 = ∪ (fi‘𝐵))
273, 26eqtrd 2798 . . . . 5 (𝜑 → 𝑋 = ∪ (fi‘𝐵))
2827fveq2d 6920 . . . 4 (𝜑 → (TopOn‘𝑋) = (TopOn‘∪ (fi‘𝐵)))
2920, 28eleqtrrd 2867 . . 3 (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
30 ufilcmp 24406 . . 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 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  (class class class)co 7451  Fincfn 9011  ficfi 9439  topGenctg 17658  TopOnctopon 23283  TopBasesctb 23318  Compccmp 23759  UFilcufil 24273  UFLcufl 24274   fLim cflim 24308
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-1o 8514  df-2o 8515  df-en 9012  df-dom 9013  df-fin 9015  df-fi 9440  df-topgen 17664  df-fbas 21726  df-fg 21727  df-top 23267  df-topon 23284  df-bases 23319  df-cld 23392  df-ntr 23393  df-cls 23394  df-nei 23471  df-cmp 23760  df-fil 24220  df-ufil 24275  df-ufl 24276  df-flim 24313  df-fcls 24315
This theorem is used by:  alexsubb  24420  ptcmplem5  24430
  Copyright terms: Public domain W3C validator