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

Theorem hauspwpwdom 22885
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 6732 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝐴) ∈ V)
2 haustop 22228 . . . . . 6 (𝐽 ∈ Haus → 𝐽 ∈ Top)
3 hauspwpwf1.x . . . . . . 7 𝑋 = 𝐽
43topopn 21803 . . . . . 6 (𝐽 ∈ Top → 𝑋𝐽)
52, 4syl 17 . . . . 5 (𝐽 ∈ Haus → 𝑋𝐽)
65adantr 484 . . . 4 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝑋𝐽)
7 simpr 488 . . . 4 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝐴𝑋)
86, 7ssexd 5217 . . 3 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝐴 ∈ V)
9 pwexg 5271 . . 3 (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
10 pwexg 5271 . . 3 (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V)
118, 9, 103syl 18 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝒫 𝒫 𝐴 ∈ V)
12 eqid 2737 . . 3 (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))})
133, 12hauspwpwf1 22884 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴)
14 f1dom2g 8646 . 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 399   = wceq 1543  wcel 2110  {cab 2714  wrex 3062  Vcvv 3408  cin 3865  wss 3866  𝒫 cpw 4513   cuni 4819   class class class wbr 5053  cmpt 5135  1-1wf1 6377  cfv 6380  cdom 8624  Topctop 21790  clsccl 21915  Hauscha 22205
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5179  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-int 4860  df-iun 4906  df-iin 4907  df-br 5054  df-opab 5116  df-mpt 5136  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-dom 8628  df-top 21791  df-cld 21916  df-ntr 21917  df-cls 21918  df-haus 22212
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator