| 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 24099 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 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑋 ∈ UFL) |
| 3 | alexsub.2 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 = ∪ 𝐵) | |
| 4 | 3 | adantr 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑋 = ∪ 𝐵) |
| 5 | alexsub.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐽 = (topGen‘(fi‘𝐵))) | |
| 6 | 5 | adantr 484 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝐽 = (topGen‘(fi‘𝐵))) |
| 7 | alexsub.4 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) | |
| 8 | 7 | adantlr 725 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) ∧ (𝑥 ⊆ 𝐵 ∧ 𝑋 = ∪ 𝑥)) → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = ∪ 𝑦) |
| 9 | simprl 780 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → 𝑓 ∈ (UFil‘𝑋)) | |
| 10 | simprr 782 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → (𝐽 fLim 𝑓) = ∅) | |
| 11 | 2, 4, 6, 8, 9, 10 | alexsublem 24092 | . . . . . . 7 ⊢ ¬ (𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) |
| 12 | 11 | pm2.21i 119 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑓 ∈ (UFil‘𝑋) ∧ (𝐽 fLim 𝑓) = ∅)) → ¬ (𝐽 fLim 𝑓) = ∅) |
| 13 | 12 | expr 460 | . . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ((𝐽 fLim 𝑓) = ∅ → ¬ (𝐽 fLim 𝑓) = ∅)) |
| 14 | 13 | pm2.01d 191 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → ¬ (𝐽 fLim 𝑓) = ∅) |
| 15 | 14 | neqned 2963 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ (UFil‘𝑋)) → (𝐽 fLim 𝑓) ≠ ∅) |
| 16 | 15 | ralrimiva 3153 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅) |
| 17 | fibas 23025 | . . . . . 6 ⊢ (fi‘𝐵) ∈ TopBases | |
| 18 | tgtopon 23019 | . . . . . 6 ⊢ ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵))) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ (topGen‘(fi‘𝐵)) ∈ (TopOn‘∪ (fi‘𝐵)) |
| 20 | 5, 19 | eqeltrdi 2869 | . . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ (fi‘𝐵))) |
| 21 | 1 | elexd 3476 | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ V) |
| 22 | 3, 21 | eqeltrrd 2862 | . . . . . . . 8 ⊢ (𝜑 → ∪ 𝐵 ∈ V) |
| 23 | uniexb 7742 | . . . . . . . 8 ⊢ (𝐵 ∈ V ↔ ∪ 𝐵 ∈ V) | |
| 24 | 22, 23 | sylibr 236 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ V) |
| 25 | fiuni 9368 | . . . . . . 7 ⊢ (𝐵 ∈ V → ∪ 𝐵 = ∪ (fi‘𝐵)) | |
| 26 | 24, 25 | syl 17 | . . . . . 6 ⊢ (𝜑 → ∪ 𝐵 = ∪ (fi‘𝐵)) |
| 27 | 3, 26 | eqtrd 2796 | . . . . 5 ⊢ (𝜑 → 𝑋 = ∪ (fi‘𝐵)) |
| 28 | 27 | fveq2d 6866 | . . . 4 ⊢ (𝜑 → (TopOn‘𝑋) = (TopOn‘∪ (fi‘𝐵))) |
| 29 | 20, 28 | eleqtrrd 2864 | . . 3 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
| 30 | ufilcmp 24080 | . . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝐽 ∈ (TopOn‘𝑋)) → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)) | |
| 31 | 1, 29, 30 | syl2anc 593 | . 2 ⊢ (𝜑 → (𝐽 ∈ Comp ↔ ∀𝑓 ∈ (UFil‘𝑋)(𝐽 fLim 𝑓) ≠ ∅)) |
| 32 | 16, 31 | mpbird 259 | 1 ⊢ (𝜑 → 𝐽 ∈ Comp) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 ∃wrex 3085 Vcvv 3453 ∩ cin 3901 ⊆ wss 3902 ∅c0 4283 𝒫 cpw 4552 ∪ cuni 4862 ‘cfv 6516 (class class class)co 7391 Fincfn 8921 ficfi 9350 topGenctg 17457 TopOnctopon 22958 TopBasesctb 22993 Compccmp 23434 UFilcufil 23947 UFLcufl 23948 fLim cflim 23982 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-1o 8431 df-2o 8432 df-en 8922 df-dom 8923 df-fin 8925 df-fi 9351 df-topgen 17463 df-fbas 21409 df-fg 21410 df-top 22942 df-topon 22959 df-bases 22994 df-cld 23067 df-ntr 23068 df-cls 23069 df-nei 23146 df-cmp 23435 df-fil 23894 df-ufil 23949 df-ufl 23950 df-flim 23987 df-fcls 23989 |
| This theorem is referenced by: alexsubb 24094 ptcmplem5 24104 |
| Copyright terms: Public domain | W3C validator |