Theorem dishaus 23550

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 23163	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Top)
2		simplrl 788	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑥 ∈ 𝐴)
3	2	snssd 4751	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑥} ⊆ 𝐴)
4		vsnex 5405	. . . . . . 7 ⊢ {𝑥} ∈ V
5	4	elpw 4565	. . . . . 6 ⊢ ({𝑥} ∈ 𝒫 𝐴 ↔ {𝑥} ⊆ 𝐴)
6	3, 5	sylibr 237	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑥} ∈ 𝒫 𝐴)
7		simplrr 789	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑦 ∈ 𝐴)
8	7	snssd 4751	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑦} ⊆ 𝐴)
9		vsnex 5405	. . . . . . 7 ⊢ {𝑦} ∈ V
10	9	elpw 4565	. . . . . 6 ⊢ ({𝑦} ∈ 𝒫 𝐴 ↔ {𝑦} ⊆ 𝐴)
11	8, 10	sylibr 237	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → {𝑦} ∈ 𝒫 𝐴)
12		vsnid 4628	. . . . . 6 ⊢ 𝑥 ∈ {𝑥}
13	12	a1i 11	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑥 ∈ {𝑥})
14		vsnid 4628	. . . . . 6 ⊢ 𝑦 ∈ {𝑦}
15	14	a1i 11	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → 𝑦 ∈ {𝑦})
16		disjsn2 4677	. . . . . 6 ⊢ (𝑥 ≠ 𝑦 → ({𝑥} ∩ {𝑦}) = ∅)
17	16	adantl 486	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → ({𝑥} ∩ {𝑦}) = ∅)
18		eleq2 2851	. . . . . . 7 ⊢ (𝑢 = {𝑥} → (𝑥 ∈ 𝑢 ↔ 𝑥 ∈ {𝑥}))
19		ineq1 4165	. . . . . . . 8 ⊢ (𝑢 = {𝑥} → (𝑢 ∩ 𝑣) = ({𝑥} ∩ 𝑣))
20	19	eqeq1d 2764	. . . . . . 7 ⊢ (𝑢 = {𝑥} → ((𝑢 ∩ 𝑣) = ∅ ↔ ({𝑥} ∩ 𝑣) = ∅))
21	18, 20	3anbi13d 1465	. . . . . 6 ⊢ (𝑢 = {𝑥} → ((𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ 𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅)))
22		eleq2 2851	. . . . . . 7 ⊢ (𝑣 = {𝑦} → (𝑦 ∈ 𝑣 ↔ 𝑦 ∈ {𝑦}))
23		ineq2 4166	. . . . . . . 8 ⊢ (𝑣 = {𝑦} → ({𝑥} ∩ 𝑣) = ({𝑥} ∩ {𝑦}))
24	23	eqeq1d 2764	. . . . . . 7 ⊢ (𝑣 = {𝑦} → (({𝑥} ∩ 𝑣) = ∅ ↔ ({𝑥} ∩ {𝑦}) = ∅))
25	22, 24	3anbi23d 1466	. . . . . 6 ⊢ (𝑣 = {𝑦} → ((𝑥 ∈ {𝑥} ∧ 𝑦 ∈ 𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)))
26	21, 25	rspc2ev 3593	. . . . 5 ⊢ (({𝑥} ∈ 𝒫 𝐴 ∧ {𝑦} ∈ 𝒫 𝐴 ∧ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)) → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅))
27	6, 11, 13, 15, 17, 26	syl113anc 1408	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ 𝑥 ≠ 𝑦) → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅))
28	27	ex 417	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ≠ 𝑦 → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅)))
29	28	ralrimivva 3207	. 2 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅)))
30		unipw 5430	. . . 4 ⊢ ∪ 𝒫 𝐴 = 𝐴
31	30	eqcomi 2771	. . 3 ⊢ 𝐴 = ∪ 𝒫 𝐴
32	31	ishaus 23490	. 2 ⊢ (𝒫 𝐴 ∈ Haus ↔ (𝒫 𝐴 ∈ Top ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ 𝒫 𝐴∃𝑣 ∈ 𝒫 𝐴(𝑥 ∈ 𝑢 ∧ 𝑦 ∈ 𝑣 ∧ (𝑢 ∩ 𝑣) = ∅))))
33	1, 29, 32	sylanbrc 594	1 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ Haus)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  ∃wrex 3088   ∩ cin 3903   ⊆ wss 3904  ∅c0 4285  𝒫 cpw 4561  {csn 4588  ∪ cuni 4871  Topctop 23061  Hauscha 23476

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-pw 4563  df-sn 4589  df-pr 4591  df-uni 4872  df-top 23062  df-haus 23483

This theorem is used by:  ssoninhaus  36987