| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgdom | Structured version Visualization version GIF version | ||
| Description: A space has no more open sets than subsets of a basis. (Contributed by Stefan O'Rear, 22-Feb-2015.) (Revised by Mario Carneiro, 9-Apr-2015.) |
| Ref | Expression |
|---|---|
| tgdom | ⊢ (𝐵 ∈ 𝑉 → (topGen‘𝐵) ≼ 𝒫 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pwexg 5343 | . 2 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
| 2 | inss1 4135 | . . . . 5 ⊢ (𝐵 ∩ 𝒫 𝑥) ⊆ 𝐵 | |
| 3 | vpwex 5342 | . . . . . . 7 ⊢ 𝒫 𝑥 ∈ V | |
| 4 | 3 | inex2 5281 | . . . . . 6 ⊢ (𝐵 ∩ 𝒫 𝑥) ∈ V |
| 5 | 4 | elpw 4563 | . . . . 5 ⊢ ((𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵 ↔ (𝐵 ∩ 𝒫 𝑥) ⊆ 𝐵) |
| 6 | 2, 5 | mpbir 234 | . . . 4 ⊢ (𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵 |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝑥 ∈ (topGen‘𝐵) → (𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵) |
| 8 | unieq 4880 | . . . . . . 7 ⊢ ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) → ∪ (𝐵 ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑦)) | |
| 9 | 8 | adantl 487 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → ∪ (𝐵 ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑦)) |
| 10 | eltg4i 23290 | . . . . . . 7 ⊢ (𝑥 ∈ (topGen‘𝐵) → 𝑥 = ∪ (𝐵 ∩ 𝒫 𝑥)) | |
| 11 | 10 | ad2antrr 739 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑥 = ∪ (𝐵 ∩ 𝒫 𝑥)) |
| 12 | eltg4i 23290 | . . . . . . 7 ⊢ (𝑦 ∈ (topGen‘𝐵) → 𝑦 = ∪ (𝐵 ∩ 𝒫 𝑦)) | |
| 13 | 12 | ad2antlr 740 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑦 = ∪ (𝐵 ∩ 𝒫 𝑦)) |
| 14 | 9, 11, 13 | 3eqtr4d 2808 | . . . . 5 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑥 = 𝑦) |
| 15 | 14 | ex 418 | . . . 4 ⊢ ((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) → 𝑥 = 𝑦)) |
| 16 | pweq 4573 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝒫 𝑥 = 𝒫 𝑦) | |
| 17 | 16 | ineq2d 4119 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) |
| 18 | 15, 17 | impbid1 228 | . . 3 ⊢ ((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) ↔ 𝑥 = 𝑦)) |
| 19 | 7, 18 | dom2 9033 | . 2 ⊢ (𝒫 𝐵 ∈ V → (topGen‘𝐵) ≼ 𝒫 𝐵) |
| 20 | 1, 19 | syl 18 | 1 ⊢ (𝐵 ∈ 𝑉 → (topGen‘𝐵) ≼ 𝒫 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 Vcvv 3453 ⊆ wss 3899 ∩ cin 4091 𝒫 cpw 4559 ∪ cuni 4869 class class class wbr 5105 ‘cfv 6546 ≼ cdom 8982 topGenctg 17620 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-dom 8986 df-topgen 17626 |
| This theorem is used by: 2ndcredom 23780 kelac2lem 44206 |
| Copyright terms: Public domain | W3C validator |