![]() |
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 4210 | . 2 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V) | |
2 | inss1 3380 | . . . . 5 ⊢ (𝐵 ∩ 𝒫 𝑥) ⊆ 𝐵 | |
3 | vpwex 4209 | . . . . . . 7 ⊢ 𝒫 𝑥 ∈ V | |
4 | 3 | inex2 4165 | . . . . . 6 ⊢ (𝐵 ∩ 𝒫 𝑥) ∈ V |
5 | 4 | elpw 3608 | . . . . 5 ⊢ ((𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵 ↔ (𝐵 ∩ 𝒫 𝑥) ⊆ 𝐵) |
6 | 2, 5 | mpbir 146 | . . . 4 ⊢ (𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵 |
7 | 6 | a1i 9 | . . 3 ⊢ (𝑥 ∈ (topGen‘𝐵) → (𝐵 ∩ 𝒫 𝑥) ∈ 𝒫 𝐵) |
8 | unieq 3845 | . . . . . . 7 ⊢ ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) → ∪ (𝐵 ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑦)) | |
9 | 8 | adantl 277 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → ∪ (𝐵 ∩ 𝒫 𝑥) = ∪ (𝐵 ∩ 𝒫 𝑦)) |
10 | eltg4i 14234 | . . . . . . 7 ⊢ (𝑥 ∈ (topGen‘𝐵) → 𝑥 = ∪ (𝐵 ∩ 𝒫 𝑥)) | |
11 | 10 | ad2antrr 488 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑥 = ∪ (𝐵 ∩ 𝒫 𝑥)) |
12 | eltg4i 14234 | . . . . . . 7 ⊢ (𝑦 ∈ (topGen‘𝐵) → 𝑦 = ∪ (𝐵 ∩ 𝒫 𝑦)) | |
13 | 12 | ad2antlr 489 | . . . . . 6 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑦 = ∪ (𝐵 ∩ 𝒫 𝑦)) |
14 | 9, 11, 13 | 3eqtr4d 2236 | . . . . 5 ⊢ (((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) ∧ (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) → 𝑥 = 𝑦) |
15 | 14 | ex 115 | . . . 4 ⊢ ((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) → 𝑥 = 𝑦)) |
16 | pweq 3605 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝒫 𝑥 = 𝒫 𝑦) | |
17 | 16 | ineq2d 3361 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦)) |
18 | 15, 17 | impbid1 142 | . . 3 ⊢ ((𝑥 ∈ (topGen‘𝐵) ∧ 𝑦 ∈ (topGen‘𝐵)) → ((𝐵 ∩ 𝒫 𝑥) = (𝐵 ∩ 𝒫 𝑦) ↔ 𝑥 = 𝑦)) |
19 | 7, 18 | dom2 6831 | . 2 ⊢ (𝒫 𝐵 ∈ V → (topGen‘𝐵) ≼ 𝒫 𝐵) |
20 | 1, 19 | syl 14 | 1 ⊢ (𝐵 ∈ 𝑉 → (topGen‘𝐵) ≼ 𝒫 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 Vcvv 2760 ∩ cin 3153 ⊆ wss 3154 𝒫 cpw 3602 ∪ cuni 3836 class class class wbr 4030 ‘cfv 5255 ≼ cdom 6795 topGenctg 12868 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-dom 6798 df-topgen 12874 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |