| 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 2765 | . 2 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 2 | cmptop 23581 | . 2 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top) | |
| 3 | 2 | adantr 486 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ Top) |
| 4 | 1 | topopn 23092 | . . . . 5 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ 𝐽) |
| 5 | 3, 4 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∪ 𝐽 ∈ 𝐽) |
| 6 | simpr 490 | . . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝑥 ∈ ∪ 𝐽) | |
| 7 | 6 | snssd 4754 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → {𝑥} ⊆ ∪ 𝐽) |
| 8 | opnneiss 23304 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ ∪ 𝐽 ∈ 𝐽 ∧ {𝑥} ⊆ ∪ 𝐽) → ∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥})) | |
| 9 | 3, 5, 7, 8 | syl3anc 1398 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥})) |
| 10 | 1 | restid 17503 | . . . . 5 ⊢ (𝐽 ∈ Top → (𝐽 ↾t ∪ 𝐽) = 𝐽) |
| 11 | 3, 10 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → (𝐽 ↾t ∪ 𝐽) = 𝐽) |
| 12 | simpl 488 | . . . 4 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → 𝐽 ∈ Comp) | |
| 13 | 11, 12 | eqeltrd 2865 | . . 3 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → (𝐽 ↾t ∪ 𝐽) ∈ Comp) |
| 14 | oveq2 7424 | . . . . 5 ⊢ (𝑘 = ∪ 𝐽 → (𝐽 ↾t 𝑘) = (𝐽 ↾t ∪ 𝐽)) | |
| 15 | 14 | eleq1d 2850 | . . . 4 ⊢ (𝑘 = ∪ 𝐽 → ((𝐽 ↾t 𝑘) ∈ Comp ↔ (𝐽 ↾t ∪ 𝐽) ∈ Comp)) |
| 16 | 15 | rspcev 3583 | . . 3 ⊢ ((∪ 𝐽 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t ∪ 𝐽) ∈ Comp) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp) |
| 17 | 9, 13, 16 | syl2anc 596 | . 2 ⊢ ((𝐽 ∈ Comp ∧ 𝑥 ∈ ∪ 𝐽) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp) |
| 18 | 1, 2, 17 | llycmpkgen2 23736 | 1 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ ran 𝑘Gen) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 ⊆ wss 3906 {csn 4591 ∪ cuni 4874 ran crn 5664 ‘cfv 6540 (class class class)co 7416 ↾t crest 17490 Topctop 23079 neicnei 23283 Compccmp 23572 𝑘Genckgen 23719 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-en 8946 df-fin 8949 df-fi 9374 df-rest 17492 df-topgen 17513 df-top 23080 df-topon 23097 df-bases 23132 df-ntr 23206 df-nei 23284 df-cmp 23573 df-kgen 23720 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |