| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elkgen | Structured version Visualization version GIF version | ||
| Description: Value of the compact generator. (Contributed by Mario Carneiro, 20-Mar-2015.) |
| Ref | Expression |
|---|---|
| elkgen | ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐴 ∈ (𝑘Gen‘𝐽) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | kgenval 23762 | . . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑘Gen‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))}) | |
| 2 | 1 | eleq2d 2846 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐴 ∈ (𝑘Gen‘𝐽) ↔ 𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})) |
| 3 | ineq1 4159 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ 𝑘) = (𝐴 ∩ 𝑘)) | |
| 4 | 3 | eleq1d 2845 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) ↔ (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))) |
| 5 | 4 | imbi2d 343 | . . . . 5 ⊢ (𝑥 = 𝐴 → (((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) ↔ ((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))) |
| 6 | 5 | ralbidv 3185 | . . . 4 ⊢ (𝑥 = 𝐴 → (∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) ↔ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))) |
| 7 | 6 | elrab 3645 | . . 3 ⊢ (𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ↔ (𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))) |
| 8 | toponmax 23152 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽) | |
| 9 | elpw2g 5298 | . . . . 5 ⊢ (𝑋 ∈ 𝐽 → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) |
| 11 | 10 | anbi1d 643 | . . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → ((𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))) |
| 12 | 7, 11 | bitrid 286 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))) |
| 13 | 2, 12 | bitrd 282 | 1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐴 ∈ (𝑘Gen‘𝐽) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 {crab 3412 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 ‘cfv 6533 (class class class)co 7414 ↾t crest 17506 TopOnctopon 23136 Compccmp 23612 𝑘Genckgen 23760 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7417 df-top 23120 df-topon 23137 df-kgen 23761 |
| This theorem is used by: kgeni 23764 kgentopon 23765 kgenss 23770 kgenidm 23774 iskgen3 23776 kgen2ss 23782 kgencn 23783 kgencn3 23785 txkgen 23879 |
| Copyright terms: Public domain | W3C validator |