Theorem hauspwpwdom 24307

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 6900	. 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ∈ V)
2		haustop 23649	. . . . . 6 ⊢ (𝐽 ∈ Haus → 𝐽 ∈ Top)
3		hauspwpwf1.x	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
4	3	topopn 23224	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝑋 ∈ 𝐽)
5	2, 4	syl 18	. . . . 5 ⊢ (𝐽 ∈ Haus → 𝑋 ∈ 𝐽)
6	5	adantr 486	. . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ 𝐽)
7		simpr 490	. . . 4 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋)
8	6, 7	ssexd 5285	. . 3 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V)
9		pwexg 5339	. . 3 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
10		pwexg 5339	. . 3 ⊢ (𝒫 𝐴 ∈ V → 𝒫 𝒫 𝐴 ∈ V)
11	8, 9, 10	3syl 19	. 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → 𝒫 𝒫 𝐴 ∈ V)
12		eqid 2760	. . 3 ⊢ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}) = (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))})
13	3, 12	hauspwpwf1 24306	. 2 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴)
14		f1dom2g 8996	. 2 ⊢ ((((cls‘𝐽)‘𝐴) ∈ V ∧ 𝒫 𝒫 𝐴 ∈ V ∧ (𝑥 ∈ ((cls‘𝐽)‘𝐴) ↦ {𝑧 ∣ ∃𝑦 ∈ 𝐽 (𝑥 ∈ 𝑦 ∧ 𝑧 = (𝑦 ∩ 𝐴))}):((cls‘𝐽)‘𝐴)–1-1→𝒫 𝒫 𝐴) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)
15	1, 11, 13, 14	syl3anc 1398	1 ⊢ ((𝐽 ∈ Haus ∧ 𝐴 ⊆ 𝑋) → ((cls‘𝐽)‘𝐴) ≼ 𝒫 𝒫 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  ∪ cuni 4866   class class class wbr 5102   ↦ cmpt 5185  –1-1→wf1 6535  ‘cfv 6538   ≼ cdom 8971  Topctop 23211  clsccl 23336  Hauscha 23626

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-dom 8975  df-top 23212  df-cld 23337  df-ntr 23338  df-cls 23339  df-haus 23633

This theorem is used by: (None)