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

Theorem alexsub 24357
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 24363 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 24356 . . . . . . 7 ¬ (𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅))
1211pm2.21i 120 . . . . . 6 ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → ¬ (𝐽 fLim 𝑓) = ∅)
1312expr 462 . . . . 5 ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ((𝐽 fLim 𝑓) = ∅ → ¬ (𝐽 fLim 𝑓) = ∅))
1413pm2.01d 192 . . . 4 ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ¬ (𝐽 fLim 𝑓) = ∅)
1514neqned 2963 . . 3 ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → (𝐽 fLim 𝑓) ≠ ∅)
1615ralrimiva 3155 . 2 (𝜑 → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)
17 fibas 23288 . . . . . 6 (fi‘𝐵) ∈ TopBases
18 tgtopon 23282 . . . . . 6 ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵)))
1917, 18ax-mp 5 . . . . 5 (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵))
205, 19eqeltrdi 2869 . . . 4 (𝜑 → 𝐽 ∈ (TopOn‘∪ (fi‘𝐵)))
211elexd 3474 . . . . . . . . 9 (𝜑 → 𝑋 ∈ V)
223, 21eqeltrrd 2862 . . . . . . . 8 (𝜑 → ∪ 𝐵 ∈ V)
23 uniexb 7776 . . . . . . . 8 (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V)
2422, 23sylibr 237 . . . . . . 7 (𝜑 → 𝐵 ∈ V)
25 fiuni 9413 . . . . . . 7 (𝐵 ∈ V → ∪ 𝐵 = ∪ (fi‘𝐵))
2624, 25syl 18 . . . . . 6 (𝜑 → ∪ 𝐵 = ∪ (fi‘𝐵))
273, 26eqtrd 2796 . . . . 5 (𝜑 → 𝑋 = ∪ (fi‘𝐵))
2827fveq2d 6887 . . . 4 (𝜑 → (TopOn‘𝑋) = (TopOn‘∪ (fi‘𝐵)))
2920, 28eleqtrrd 2864 . . 3 (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
30 ufilcmp 24344 . . 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 2956  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6537  (class class class)co 7418  Fincfn 8966  ficfi 9395  topGenctg 17601  TopOnctopon 23221  TopBasesctb 23256  Compccmp 23697  UFilcufil 24211  UFLcufl 24212   fLim cflim 24246
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 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 3367  df-rab 3414  df-v 3453  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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-1o 8469  df-2o 8470  df-en 8967  df-dom 8968  df-fin 8970  df-fi 9396  df-topgen 17607  df-fbas 21668  df-fg 21669  df-top 23205  df-topon 23222  df-bases 23257  df-cld 23330  df-ntr 23331  df-cls 23332  df-nei 23409  df-cmp 23698  df-fil 24158  df-ufil 24213  df-ufl 24214  df-flim 24251  df-fcls 24253
This theorem is used by:  alexsubb  24358  ptcmplem5  24368
  Copyright terms: Public domain W3C validator