| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cmpkgen | Structured version Visualization version GIF version | ||
| Description: A compact space is compactly generated. (Contributed by Mario Carneiro, 21-Mar-2015.) |
| Ref | Expression |
|---|---|
| cmpkgen | ⊢ (𝐽 ∈ Comp → 𝐽 ∈ ran 𝑘Gen) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . 2 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | cmptop 23720 | . 2 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ Top) |
| 4 | 1 | topopn 23231 | . . . . 5 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ 𝐽) |
| 5 | 3, 4 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∪ 𝐽 ∈ 𝐽) |
| 6 | simpr 490 | . . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝑥 ∈ ∪ 𝐽) | |
| 7 | 6 | snssd 4743 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → {𝑥} ⊆ ∪ 𝐽) |
| 8 | opnneiss 23443 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∪ 𝐽 ∈ 𝐽 ∧ {𝑥} ⊆ ∪ 𝐽) → ∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥})) | |
| 9 | 3, 5, 7, 8 | syl3anc 1398 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥})) |
| 10 | 1 | restid 17611 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ↾t ∪ 𝐽) = 𝐽) |
| 11 | 3, 10 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → (𝐽 ↾t ∪ 𝐽) = 𝐽) |
| 12 | simpl 488 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ Comp) | |
| 13 | 11, 12 | eqeltrd 2860 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → (𝐽 ↾t ∪ 𝐽) ∈ Comp) |
| 14 | oveq2 7430 | . . . . 5 ⊢ (𝑘 = ∪ 𝐽 → (𝐽 ↾t 𝑘) = (𝐽 ↾t ∪ 𝐽)) | |
| 15 | 14 | eleq1d 2845 | . . . 4 ⊢ (𝑘 = ∪ 𝐽 → ((𝐽 ↾t 𝑘) ∈ Comp ↔ (𝐽 ↾t ∪ 𝐽) ∈ Comp)) |
| 16 | 15 | rspcev 3576 | . . 3 ⊢ ((∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t ∪ 𝐽) ∈ Comp) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp) |
| 17 | 9, 13, 16 | syl2anc 596 | . 2 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp) |
| 18 | 1, 2, 17 | llycmpkgen2 23876 | 1 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ ran 𝑘Gen) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 ⊆ wss 3896 {csn 4584 ∪ cuni 4866 ran crn 5651 ‘cfv 6541 (class class class)co 7422 ↾t crest 17598 Topctop 23218 neicnei 23422 Compccmp 23711 𝑘Genckgen 23859 |
| 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 7753 |
| 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-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 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-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 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-1st 8003 df-2nd 8004 df-en 8979 df-fin 8982 df-fi 9408 df-rest 17600 df-topgen 17621 df-top 23219 df-topon 23236 df-bases 23271 df-ntr 23345 df-nei 23423 df-cmp 23712 df-kgen 23860 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |