![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > hauspwpwdom | Structured version Visualization version GIF version |
Description: If 𝑋 is a Hausdorff space, then the cardinality of the closure of a set 𝐴 is bounded by the double powerset of 𝐴. In particular, a Hausdorff space with a dense subset 𝐴 has cardinality at most 𝒫 𝒫 𝐴, and a separable Hausdorff space has cardinality at most 𝒫 𝒫 ℕ. (Contributed by Mario Carneiro, 9-Apr-2015.) (Revised by Mario Carneiro, 28-Jul-2015.) |
Ref | Expression |
---|---|
hauspwpwf1.x | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
hauspwpwdom | ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvexd 6906 | . 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ∈ V) | |
2 | haustop 22834 | . . . . . 6 ⊢ (𝐽 ∈ Haus → 𝐽 ∈ Top) | |
3 | hauspwpwf1.x | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
4 | 3 | topopn 22407 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
5 | 2, 4 | syl 17 | . . . . 5 ⊢ (𝐽 ∈ Haus → 𝑋 ∈ 𝐽) |
6 | 5 | adantr 481 | . . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ 𝐽) |
7 | simpr 485 | . . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋) | |
8 | 6, 7 | ssexd 5324 | . . 3 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V) |
9 | pwexg 5376 | . . 3 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V) | |
10 | pwexg 5376 | . . 3 ⊢ (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V) | |
11 | 8, 9, 10 | 3syl 18 | . 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝒫 𝒫 𝐴 ∈ V) |
12 | eqid 2732 | . . 3 ⊢ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}) | |
13 | 3, 12 | hauspwpwf1 23490 | . 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴) |
14 | f1dom2g 8964 | . 2 ⊢ ((((cls‘𝐽)‘𝐴) ∈ V ∧ 𝒫 𝒫 𝐴 ∈ V ∧ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴) | |
15 | 1, 11, 13, 14 | syl3anc 1371 | 1 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 {cab 2709 ∃wrex 3070 Vcvv 3474 ∩ cin 3947 ⊆ wss 3948 𝒫 cpw 4602 ∪ cuni 4908 class class class wbr 5148 ↦ cmpt 5231 –1-1→wf1 6540 ‘cfv 6543 ≼ cdom 8936 Topctop 22394 clsccl 22521 Hauscha 22811 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-dom 8940 df-top 22395 df-cld 22522 df-ntr 22523 df-cls 22524 df-haus 22818 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |