| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tgdom | 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 4317 | . 2 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
| 2 | inss1 3451 | . . . . 5 ⊢ (𝐵 ∩ 𝒫 𝑥) ⊆ 𝐵 | |
| 3 | vpwex 4316 | . . . . . . 7 ⊢ 𝒫 𝑥 ∈ V | |
| 4 | 3 | inex2 4268 | . . . . . 6 ⊢ (𝐵 ∩ 𝒫 𝑥) ∈ V |
| 5 | 4 | elpw 3694 | . . . . 5 ⊢ ((𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵 ↔ (𝐵 ∩ 𝒫 𝑥) ⊆ 𝐵) |
| 6 | 2, 5 | mpbir 146 | . . . 4 ⊢ (𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵 |
| 7 | 6 | a1i 9 | . . 3 ⊢ (𝑥 ∈ (topGen‘𝐵) → (𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵) |
| 8 | unieq 3944 | . . . . . . 7 ⊢ ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) → ∪ (𝐵 ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑦)) | |
| 9 | 8 | adantl 277 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → ∪ (𝐵 ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑦)) |
| 10 | eltg4i 15156 | . . . . . . 7 ⊢ (𝑥 ∈ (topGen‘𝐵) → 𝑥 = ∪ (𝐵 ∩ 𝒫 𝑥)) | |
| 11 | 10 | ad2antrr 492 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑥 = ∪ (𝐵 ∩ 𝒫 𝑥)) |
| 12 | eltg4i 15156 | . . . . . . 7 ⊢ (𝑦 ∈ (topGen‘𝐵) → 𝑦 = ∪ (𝐵 ∩ 𝒫 𝑦)) | |
| 13 | 12 | ad2antlr 493 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑦 = ∪ (𝐵 ∩ 𝒫 𝑦)) |
| 14 | 9, 11, 13 | 3eqtr4d 2281 | . . . . 5 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑥 = 𝑦) |
| 15 | 14 | ex 115 | . . . 4 ⊢ ((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) → 𝑥 = 𝑦)) |
| 16 | pweq 3691 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝒫 𝑥 = 𝒫 𝑦) | |
| 17 | 16 | ineq2d 3432 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) |
| 18 | 15, 17 | impbid1 142 | . . 3 ⊢ ((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) ↔ 𝑥 = 𝑦)) |
| 19 | 7, 18 | dom2 7061 | . 2 ⊢ (𝒫 𝐵 ∈ V → (topGen‘𝐵) ≼ 𝒫 𝐵) |
| 20 | 1, 19 | syl 14 | 1 ⊢ (𝐵 ∈ 𝑉 → (topGen‘𝐵) ≼ 𝒫 𝐵) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∩ cin 3219 ⊆ wss 3220 𝒫 cpw 3688 ∪ cuni 3935 class class class wbr 4130 ‘cfv 5377 ≼ cdom 7021 topGenctg 13608 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-dom 7024 df-topgen 13614 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |