MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hauspwpwdom Structured version   Visualization version   GIF version

Theorem hauspwpwdom 23930
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.)
Hypothesis
Ref Expression
hauspwpwf1.x 𝑋 = 𝐽
Assertion
Ref Expression
hauspwpwdom ((𝐽 ∈ Haus ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)

Proof of Theorem hauspwpwdom
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvexd 6847 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝐴) ∈ V)
2 haustop 23273 . . . . . 6 (𝐽 ∈ Haus → 𝐽 ∈ Top)
3 hauspwpwf1.x . . . . . . 7 𝑋 = 𝐽
43topopn 22848 . . . . . 6 (𝐽 ∈ Top → 𝑋𝐽)
52, 4syl 17 . . . . 5 (𝐽 ∈ Haus → 𝑋𝐽)
65adantr 480 . . . 4 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝑋𝐽)
7 simpr 484 . . . 4 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝐴𝑋)
86, 7ssexd 5267 . . 3 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝐴 ∈ V)
9 pwexg 5321 . . 3 (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
10 pwexg 5321 . . 3 (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V)
118, 9, 103syl 18 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝒫 𝒫 𝐴 ∈ V)
12 eqid 2734 . . 3 (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))})
133, 12hauspwpwf1 23929 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴)
14 f1dom2g 8904 . 2 ((((cls‘𝐽)‘𝐴) ∈ V ∧ 𝒫 𝒫 𝐴 ∈ V ∧ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)
151, 11, 13, 14syl3anc 1373 1 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  {cab 2712  wrex 3058  Vcvv 3438  cin 3898  wss 3899  𝒫 cpw 4552   cuni 4861   class class class wbr 5096  cmpt 5177  1-1wf1 6487  cfv 6490  cdom 8879  Topctop 22835  clsccl 22960  Hauscha 23250
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 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-iin 4947  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-dom 8883  df-top 22836  df-cld 22961  df-ntr 22962  df-cls 22963  df-haus 23257
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator