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

Theorem hauspwpwdom 23932
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 6849 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → ((cls‘𝐽)‘𝐴) ∈ V)
2 haustop 23275 . . . . . 6 (𝐽 ∈ Haus → 𝐽 ∈ Top)
3 hauspwpwf1.x . . . . . . 7 𝑋 = 𝐽
43topopn 22850 . . . . . 6 (𝐽 ∈ Top → 𝑋𝐽)
52, 4syl 17 . . . . 5 (𝐽 ∈ Haus → 𝑋𝐽)
65adantr 480 . . . 4 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝑋𝐽)
7 simpr 484 . . . 4 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝐴𝑋)
86, 7ssexd 5269 . . 3 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝐴 ∈ V)
9 pwexg 5323 . . 3 (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
10 pwexg 5323 . . 3 (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V)
118, 9, 103syl 18 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → 𝒫 𝒫 𝐴 ∈ V)
12 eqid 2736 . . 3 (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))})
133, 12hauspwpwf1 23931 . 2 ((𝐽 ∈ Haus ∧ 𝐴𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦𝐽 (𝑥𝑦𝑧 = (𝑦𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴)
14 f1dom2g 8906 . 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 2714  wrex 3060  Vcvv 3440  cin 3900  wss 3901  𝒫 cpw 4554   cuni 4863   class class class wbr 5098  cmpt 5179  1-1wf1 6489  cfv 6492  cdom 8881  Topctop 22837  clsccl 22962  Hauscha 23252
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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-iin 4949  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-dom 8885  df-top 22838  df-cld 22963  df-ntr 22964  df-cls 22965  df-haus 23259
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator