| 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 2761 | . 2 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | cmptop 23706 | . 2 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ Top) |
| 4 | 1 | topopn 23217 | . . . . 5 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ 𝐽) |
| 5 | 3, 4 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∪ 𝐽 ∈ 𝐽) |
| 6 | simpr 490 | . . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝑥 ∈ ∪ 𝐽) | |
| 7 | 6 | snssd 4747 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → {𝑥} ⊆ ∪ 𝐽) |
| 8 | opnneiss 23429 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∪ 𝐽 ∈ 𝐽 ∧ {𝑥} ⊆ ∪ 𝐽) → ∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥})) | |
| 9 | 3, 5, 7, 8 | syl3anc 1398 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥})) |
| 10 | 1 | restid 17597 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ↾t ∪ 𝐽) = 𝐽) |
| 11 | 3, 10 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → (𝐽 ↾t ∪ 𝐽) = 𝐽) |
| 12 | simpl 488 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ Comp) | |
| 13 | 11, 12 | eqeltrd 2861 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → (𝐽 ↾t ∪ 𝐽) ∈ Comp) |
| 14 | oveq2 7426 | . . . . 5 ⊢ (𝑘 = ∪ 𝐽 → (𝐽 ↾t 𝑘) = (𝐽 ↾t ∪ 𝐽)) | |
| 15 | 14 | eleq1d 2846 | . . . 4 ⊢ (𝑘 = ∪ 𝐽 → ((𝐽 ↾t 𝑘) ∈ Comp ↔ (𝐽 ↾t ∪ 𝐽) ∈ Comp)) |
| 16 | 15 | rspcev 3577 | . . 3 ⊢ ((∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t ∪ 𝐽) ∈ Comp) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp) |
| 17 | 9, 13, 16 | syl2anc 596 | . 2 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp) |
| 18 | 1, 2, 17 | llycmpkgen2 23862 | 1 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ ran 𝑘Gen) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 ⊆ wss 3899 {csn 4584 ∪ cuni 4867 ran crn 5652 ‘cfv 6537 (class class class)co 7418 ↾t crest 17584 Topctop 23204 neicnei 23408 Compccmp 23697 𝑘Genckgen 23845 |
| 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-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-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-en 8967 df-fin 8970 df-fi 9396 df-rest 17586 df-topgen 17607 df-top 23205 df-topon 23222 df-bases 23257 df-ntr 23331 df-nei 23409 df-cmp 23698 df-kgen 23846 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |