Theorem hauspwpwdom 24334

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.

Step	Hyp	Ref	Expression
1		fvexd 6920	. 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ∈ V)
2		haustop 23676	. . . . . 6 ⊢ (𝐽 ∈ Haus → 𝐽 ∈ Top)
3		hauspwpwf1.x	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
4	3	topopn 23251	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
5	2, 4	syl 18	. . . . 5 ⊢ (𝐽 ∈ Haus → 𝑋 ∈ 𝐽)
6	5	adantr 486	. . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ 𝐽)
7		simpr 490	. . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋)
8	6, 7	ssexd 5290	. . 3 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V)
9		pwexg 5344	. . 3 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
10		pwexg 5344	. . 3 ⊢ (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V)
11	8, 9, 10	3syl 19	. 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝒫 𝒫 𝐴 ∈ V)
12		eqid 2763	. . 3 ⊢ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))})
13	3, 12	hauspwpwf1 24333	. 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)⟶1-1𝒫 𝒫 𝐴)
14		f1dom2g 9021	. 2 ⊢ ((((cls‘𝐽)‘𝐴) ∈ V ∧ 𝒫 𝒫 𝐴 ∈ V ∧ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)⟶1-1𝒫 𝒫 𝐴) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)
15	1, 11, 13, 14	syl3anc 1399	1 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4870   class class class wbr 5106   ↦ cmpt 5189  ⟶1-1wf1 6552  ‘cfv 6555   ≼ cdom 8996  Topctop 23238  clsccl 23363  Hauscha 23653

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-dom 9000  df-top 23239  df-cld 23364  df-ntr 23365  df-cls 23366  df-haus 23660

This theorem is used by: (None)