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 6826 | . 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ∈ V) | |
2 | haustop 22562 | . . . . . 6 ⊢ (𝐽 ∈ Haus → 𝐽 ∈ Top) | |
3 | hauspwpwf1.x | . . . . . . 7 ⊢ 𝑋 = ∪ 𝐽 | |
4 | 3 | topopn 22135 | . . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽) |
5 | 2, 4 | syl 17 | . . . . 5 ⊢ (𝐽 ∈ Haus → 𝑋 ∈ 𝐽) |
6 | 5 | adantr 481 | . . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ 𝐽) |
7 | simpr 485 | . . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋) | |
8 | 6, 7 | ssexd 5262 | . . 3 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V) |
9 | pwexg 5315 | . . 3 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V) | |
10 | pwexg 5315 | . . 3 ⊢ (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V) | |
11 | 8, 9, 10 | 3syl 18 | . 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝒫 𝒫 𝐴 ∈ V) |
12 | eqid 2736 | . . 3 ⊢ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}) | |
13 | 3, 12 | hauspwpwf1 23218 | . 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴) |
14 | f1dom2g 8808 | . 2 ⊢ ((((cls‘𝐽)‘𝐴) ∈ V ∧ 𝒫 𝒫 𝐴 ∈ V ∧ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴) | |
15 | 1, 11, 13, 14 | syl3anc 1370 | 1 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1540 ∈ wcel 2105 {cab 2713 ∃wrex 3070 Vcvv 3440 ∩ cin 3895 ⊆ wss 3896 𝒫 cpw 4544 ∪ cuni 4849 class class class wbr 5086 ↦ cmpt 5169 –1-1→wf1 6462 ‘cfv 6465 ≼ cdom 8780 Topctop 22122 clsccl 22249 Hauscha 22539 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5223 ax-sep 5237 ax-nul 5244 ax-pow 5302 ax-pr 5366 ax-un 7629 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3350 df-rab 3404 df-v 3442 df-sbc 3726 df-csb 3842 df-dif 3899 df-un 3901 df-in 3903 df-ss 3913 df-nul 4267 df-if 4471 df-pw 4546 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4850 df-int 4892 df-iun 4938 df-iin 4939 df-br 5087 df-opab 5149 df-mpt 5170 df-id 5506 df-xp 5613 df-rel 5614 df-cnv 5615 df-co 5616 df-dm 5617 df-rn 5618 df-res 5619 df-ima 5620 df-iota 6417 df-fun 6467 df-fn 6468 df-f 6469 df-f1 6470 df-fo 6471 df-f1o 6472 df-fv 6473 df-dom 8784 df-top 22123 df-cld 22250 df-ntr 22251 df-cls 22252 df-haus 22546 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |