Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > alexsubALTlem1 | Structured version Visualization version GIF version |
Description: Lemma for alexsubALT 21665. A compact space has a subbase such that every cover taken from it has a finite subcover. (Contributed by Jeff Hankins, 27-Jan-2010.) |
Ref | Expression |
---|---|
alexsubALT.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
alexsubALTlem1 | ⊢ (𝐽 ∈ Comp → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cmptop 21008 | . . 3 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
2 | fitop 20530 | . . . . 5 ⊢ (𝐽 ∈ Top → (fi‘𝐽) = 𝐽) | |
3 | 2 | fveq2d 6107 | . . . 4 ⊢ (𝐽 ∈ Top → (topGen‘(fi‘𝐽)) = (topGen‘𝐽)) |
4 | tgtop 20588 | . . . 4 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽) | |
5 | 3, 4 | eqtr2d 2645 | . . 3 ⊢ (𝐽 ∈ Top → 𝐽 = (topGen‘(fi‘𝐽))) |
6 | 1, 5 | syl 17 | . 2 ⊢ (𝐽 ∈ Comp → 𝐽 = (topGen‘(fi‘𝐽))) |
7 | selpw 4115 | . . . 4 ⊢ (𝑐 ∈ 𝒫 𝐽 ↔ 𝑐 ⊆ 𝐽) | |
8 | alexsubALT.1 | . . . . . 6 ⊢ 𝑋 = ∪ 𝐽 | |
9 | 8 | cmpcov 21002 | . . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑐 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑) |
10 | 9 | 3exp 1256 | . . . 4 ⊢ (𝐽 ∈ Comp → (𝑐 ⊆ 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))) |
11 | 7, 10 | syl5bi 231 | . . 3 ⊢ (𝐽 ∈ Comp → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))) |
12 | 11 | ralrimiv 2948 | . 2 ⊢ (𝐽 ∈ Comp → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)) |
13 | fveq2 6103 | . . . . . 6 ⊢ (𝑥 = 𝐽 → (fi‘𝑥) = (fi‘𝐽)) | |
14 | 13 | fveq2d 6107 | . . . . 5 ⊢ (𝑥 = 𝐽 → (topGen‘(fi‘𝑥)) = (topGen‘(fi‘𝐽))) |
15 | 14 | eqeq2d 2620 | . . . 4 ⊢ (𝑥 = 𝐽 → (𝐽 = (topGen‘(fi‘𝑥)) ↔ 𝐽 = (topGen‘(fi‘𝐽)))) |
16 | pweq 4111 | . . . . 5 ⊢ (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽) | |
17 | 16 | raleqdv 3121 | . . . 4 ⊢ (𝑥 = 𝐽 → (∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑) ↔ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))) |
18 | 15, 17 | anbi12d 743 | . . 3 ⊢ (𝑥 = 𝐽 → ((𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)) ↔ (𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))) |
19 | 18 | spcegv 3267 | . 2 ⊢ (𝐽 ∈ Comp → ((𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)) → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))) |
20 | 6, 12, 19 | mp2and 711 | 1 ⊢ (𝐽 ∈ Comp → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∃wex 1695 ∈ wcel 1977 ∀wral 2896 ∃wrex 2897 ∩ cin 3539 ⊆ wss 3540 𝒫 cpw 4108 ∪ cuni 4372 ‘cfv 5804 Fincfn 7841 ficfi 8199 topGenctg 15921 Topctop 20517 Compccmp 20999 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-fin 7845 df-fi 8200 df-topgen 15927 df-top 20521 df-cmp 21000 |
This theorem is referenced by: alexsubALT 21665 |
Copyright terms: Public domain | W3C validator |