Theorem dishaus 23391

Description: A discrete topology is Hausdorff. Morris, Topology without tears, p.72, ex. 13. (Contributed by FL, 24-Jun-2007.) (Proof shortened by Mario Carneiro, 8-Apr-2015.)

Assertion

Ref	Expression
dishaus	⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Haus)

Proof of Theorem dishaus

Dummy variables 𝑣 𝑢 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		distop 23003	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Top)
2		simplrl 776	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑥 ∈ 𝐴)
3	2	snssd 4808	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑥} ⊆ 𝐴)
4		vsnex 5433	. . . . . . 7 ⊢ {𝑥} ∈ V
5	4	elpw 4603	. . . . . 6 ⊢ ({𝑥} ∈ 𝒫 𝐴 ↔ {𝑥} ⊆ 𝐴)
6	3, 5	sylibr 234	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑥} ∈ 𝒫 𝐴)
7		simplrr 777	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑦 ∈ 𝐴)
8	7	snssd 4808	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑦} ⊆ 𝐴)
9		vsnex 5433	. . . . . . 7 ⊢ {𝑦} ∈ V
10	9	elpw 4603	. . . . . 6 ⊢ ({𝑦} ∈ 𝒫 𝐴 ↔ {𝑦} ⊆ 𝐴)
11	8, 10	sylibr 234	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑦} ∈ 𝒫 𝐴)
12		vsnid 4662	. . . . . 6 ⊢ 𝑥 ∈ {𝑥}
13	12	a1i 11	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑥 ∈ {𝑥})
14		vsnid 4662	. . . . . 6 ⊢ 𝑦 ∈ {𝑦}
15	14	a1i 11	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑦 ∈ {𝑦})
16		disjsn2 4711	. . . . . 6 ⊢ (𝑥 ≠ 𝑦 → ({𝑥} ∩ {𝑦}) = ∅)
17	16	adantl 481	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → ({𝑥} ∩ {𝑦}) = ∅)
18		eleq2 2829	. . . . . . 7 ⊢ (𝑢 = {𝑥} → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ {𝑥}))
19		ineq1 4212	. . . . . . . 8 ⊢ (𝑢 = {𝑥} → (𝑢 ∩ 𝑣) = ({𝑥} ∩ 𝑣))
20	19	eqeq1d 2738	. . . . . . 7 ⊢ (𝑢 = {𝑥} → ((𝑢 ∩ 𝑣) = ∅ ↔ ({𝑥} ∩ 𝑣) = ∅))
21	18, 20	3anbi13d 1439	. . . . . 6 ⊢ (𝑢 = {𝑥} → ((𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ 𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅)))
22		eleq2 2829	. . . . . . 7 ⊢ (𝑣 = {𝑦} → (𝑦 ∈ 𝑣 ↔ 𝑦 ∈ {𝑦}))
23		ineq2 4213	. . . . . . . 8 ⊢ (𝑣 = {𝑦} → ({𝑥} ∩ 𝑣) = ({𝑥} ∩ {𝑦}))
24	23	eqeq1d 2738	. . . . . . 7 ⊢ (𝑣 = {𝑦} → (({𝑥} ∩ 𝑣) = ∅ ↔ ({𝑥} ∩ {𝑦}) = ∅))
25	22, 24	3anbi23d 1440	. . . . . 6 ⊢ (𝑣 = {𝑦} → ((𝑥 ∈ {𝑥} ∧ 𝑦 ∈ 𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)))
26	21, 25	rspc2ev 3634	. . . . 5 ⊢ (({𝑥} ∈ 𝒫 𝐴 ∧ {𝑦} ∈ 𝒫 𝐴 ∧ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)) → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅))
27	6, 11, 13, 15, 17, 26	syl113anc 1383	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅))
28	27	ex 412	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ≠ 𝑦 → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅)))
29	28	ralrimivva 3201	. 2 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅)))
30		unipw 5454	. . . 4 ⊢ ∪ 𝒫 𝐴 = 𝐴
31	30	eqcomi 2745	. . 3 ⊢ 𝐴 = ∪ 𝒫 𝐴
32	31	ishaus 23331	. 2 ⊢ (𝒫 𝐴 ∈ Haus ↔ (𝒫 𝐴 ∈ Top ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅))))
33	1, 29, 32	sylanbrc 583	1 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Haus)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107   ≠ wne 2939  ∀wral 3060  ∃wrex 3069   ∩ cin 3949   ⊆ wss 3950  ∅c0 4332  𝒫 cpw 4599  {csn 4625  ∪ cuni 4906  Topctop 22900  Hauscha 23317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707  ax-sep 5295  ax-pow 5364  ax-pr 5431  ax-un 7756

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-pw 4601  df-sn 4626  df-pr 4628  df-uni 4907  df-top 22901  df-haus 23324

This theorem is referenced by:  ssoninhaus  36450