| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eltg3 | Structured version Visualization version GIF version | ||
| Description: Membership in a topology generated by a basis. (Contributed by NM, 15-Jul-2006.) (Proof shortened by Mario Carneiro, 30-Aug-2015.) |
| Ref | Expression |
|---|---|
| eltg3 | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfvdm 6897 | . . . 4 ⊢ (𝐴 ∈ (topGen‘𝐵) → 𝐵 ∈ dom topGen) | |
| 2 | inex1g 5274 | . . . 4 ⊢ (𝐵 ∈ dom topGen → (𝐵 ∩ 𝒫 𝐴) ∈ V) | |
| 3 | 1, 2 | syl 17 | . . 3 ⊢ (𝐴 ∈ (topGen‘𝐵) → (𝐵 ∩ 𝒫 𝐴) ∈ V) |
| 4 | eltg4i 23000 | . . 3 ⊢ (𝐴 ∈ (topGen‘𝐵) → 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴)) | |
| 5 | inss1 4188 | . . . . . 6 ⊢ (𝐵 ∩ 𝒫 𝐴) ⊆ 𝐵 | |
| 6 | sseq1 3961 | . . . . . 6 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝑥 ⊆ 𝐵 ↔ (𝐵 ∩ 𝒫 𝐴) ⊆ 𝐵)) | |
| 7 | 5, 6 | mpbiri 260 | . . . . 5 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝐵) |
| 8 | 7 | biantrurd 540 | . . . 4 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝐴 = ∪ 𝑥 ↔ (𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
| 9 | unieq 4875 | . . . . 5 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → ∪ 𝑥 = ∪ (𝐵 ∩ 𝒫 𝐴)) | |
| 10 | 9 | eqeq2d 2772 | . . . 4 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝐴 = ∪ 𝑥 ↔ 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴))) |
| 11 | 8, 10 | bitr3d 283 | . . 3 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → ((𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) ↔ 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴))) |
| 12 | 3, 4, 11 | spcedv 3557 | . 2 ⊢ (𝐴 ∈ (topGen‘𝐵) → ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥)) |
| 13 | eltg3i 23001 | . . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑥 ⊆ 𝐵) → ∪ 𝑥 ∈ (topGen‘𝐵)) | |
| 14 | eleq1 2849 | . . . . 5 ⊢ (𝐴 = ∪ 𝑥 → (𝐴 ∈ (topGen‘𝐵) ↔ ∪ 𝑥 ∈ (topGen‘𝐵))) | |
| 15 | 13, 14 | syl5ibrcom 249 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑥 ⊆ 𝐵) → (𝐴 = ∪ 𝑥 → 𝐴 ∈ (topGen‘𝐵))) |
| 16 | 15 | expimpd 457 | . . 3 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) → 𝐴 ∈ (topGen‘𝐵))) |
| 17 | 16 | exlimdv 1952 | . 2 ⊢ (𝐵 ∈ 𝑉 → (∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) → 𝐴 ∈ (topGen‘𝐵))) |
| 18 | 12, 17 | impbid2 228 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∃wex 1798 ∈ wcel 2141 Vcvv 3453 ∩ cin 3903 ⊆ wss 3904 𝒫 cpw 4554 ∪ cuni 4864 dom cdm 5645 ‘cfv 6517 topGenctg 17449 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-iota 6473 df-fun 6519 df-fv 6525 df-topgen 17455 |
| This theorem is referenced by: tgval3 23003 tgtop 23013 eltop3 23016 tgidm 23020 bastop1 23033 tgrest 23199 tgcn 23292 txbasval 23646 opnmblALT 25645 mbfimaopnlem 25697 isfne3 36667 fneuni 36671 dissneqlem 37798 tgqioo2 46087 |
| Copyright terms: Public domain | W3C validator |