| 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 23743 | . . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑘Gen‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))}) | |
| 2 | 1 | eleq2d 2851 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐴 ∈ (𝑘Gen‘𝐽) ↔ 𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})) |
| 3 | ineq1 4166 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ 𝑘) = (𝐴 ∩ 𝑘)) | |
| 4 | 3 | eleq1d 2850 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) ↔ (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))) |
| 5 | 4 | imbi2d 343 | . . . . 5 ⊢ (𝑥 = 𝐴 → (((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) ↔ ((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))) |
| 6 | 5 | ralbidv 3190 | . . . 4 ⊢ (𝑥 = 𝐴 → (∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) ↔ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))) |
| 7 | 6 | elrab 3652 | . . 3 ⊢ (𝐴 ∈ {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ↔ (𝐴 ∈ 𝒫 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝐴 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))) |
| 8 | toponmax 23133 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽) | |
| 9 | elpw2g 5306 | . . . . 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 2146 ∀wral 3081 {crab 3418 ∩ cin 3905 ⊆ wss 3906 𝒫 cpw 4564 ‘cfv 6540 (class class class)co 7419 ↾t crest 17495 TopOnctopon 23117 Compccmp 23593 𝑘Genckgen 23741 |
| 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-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 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-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-top 23101 df-topon 23118 df-kgen 23742 |
| This theorem is used by: kgeni 23745 kgentopon 23746 kgenss 23751 kgenidm 23755 iskgen3 23757 kgen2ss 23763 kgencn 23764 kgencn3 23766 txkgen 23860 |
| Copyright terms: Public domain | W3C validator |