| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > alexsub | Structured version Visualization version GIF version | ||
| 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 24376 for a proof using Zorn's lemma. (Contributed by Jeff Hankins, 24-Jan-2010.) (Revised by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| alexsub.1 | ⊢ (𝜑 → 𝑋 ∈ UFL) |
| alexsub.2 | ⊢ (𝜑 → 𝑋 = ∪ 𝐵) |
| alexsub.3 | ⊢ (𝜑 → 𝐽 = (topGen‘(fi‘𝐵))) |
| alexsub.4 | ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) |
| Ref | Expression |
|---|---|
| alexsub | ⊢ (𝜑 → 𝐽 ∈ Comp) |
| 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 24369 | . . . . . . 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 2962 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → (𝐽 fLim 𝑓) ≠ ∅) |
| 16 | 15 | ralrimiva 3154 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅) |
| 17 | fibas 23301 | . . . . . 6 ⊢ (fi‘𝐵) ∈ TopBases | |
| 18 | tgtopon 23295 | . . . . . 6 ⊢ ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵))) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵)) |
| 20 | 5, 19 | eqeltrdi 2868 | . . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ (fi‘𝐵))) |
| 21 | 1 | elexd 3473 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ V) |
| 22 | 3, 21 | eqeltrrd 2861 | . . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵 ∈ V) |
| 23 | uniexb 7779 | . . . . . . . 8 ⊢ (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V) | |
| 24 | 22, 23 | sylibr 237 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ V) |
| 25 | fiuni 9424 | . . . . . . 7 ⊢ (𝐵 ∈ V → ∪ 𝐵 = ∪ (fi‘𝐵)) | |
| 26 | 24, 25 | syl 18 | . . . . . 6 ⊢ (𝜑 → ∪ 𝐵 = ∪ (fi‘𝐵)) |
| 27 | 3, 26 | eqtrd 2795 | . . . . 5 ⊢ (𝜑 → 𝑋 = ∪ (fi‘𝐵)) |
| 28 | 27 | fveq2d 6890 | . . . 4 ⊢ (𝜑 → (TopOn‘𝑋) = (TopOn‘∪ (fi‘𝐵))) |
| 29 | 20, 28 | eleqtrrd 2863 | . . 3 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
| 30 | ufilcmp 24357 | . . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)) | |
| 31 | 1, 29, 30 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)) |
| 32 | 16, 31 | mpbird 260 | 1 ⊢ (𝜑 → 𝐽 ∈ Comp) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 Vcvv 3450 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 𝒫 cpw 4556 ∪ cuni 4866 ‘cfv 6539 (class class class)co 7421 Fincfn 8977 ficfi 9406 topGenctg 17614 TopOnctopon 23234 TopBasesctb 23269 Compccmp 23710 UFilcufil 24224 UFLcufl 24225 fLim cflim 24259 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-1o 8480 df-2o 8481 df-en 8978 df-dom 8979 df-fin 8981 df-fi 9407 df-topgen 17620 df-fbas 21681 df-fg 21682 df-top 23218 df-topon 23235 df-bases 23270 df-cld 23343 df-ntr 23344 df-cls 23345 df-nei 23422 df-cmp 23711 df-fil 24171 df-ufil 24226 df-ufl 24227 df-flim 24264 df-fcls 24266 |
| This theorem is used by: alexsubb 24371 ptcmplem5 24381 |
| Copyright terms: Public domain | W3C validator |