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

Theorem dishaus 23368
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.
StepHypRef Expression
1 distop 22981 . 2 (𝐴𝑉 → 𝒫 𝐴 ∈ Top)
2 simplrl 783 . . . . . . 7 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑥𝐴)
32snssd 4720 . . . . . 6 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑥} ⊆ 𝐴)
4 vsnex 5366 . . . . . . 7 {𝑥} ∈ V
54elpw 4535 . . . . . 6 ({𝑥} ∈ 𝒫 𝐴 ↔ {𝑥} ⊆ 𝐴)
63, 5sylibr 236 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑥} ∈ 𝒫 𝐴)
7 simplrr 784 . . . . . . 7 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑦𝐴)
87snssd 4720 . . . . . 6 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑦} ⊆ 𝐴)
9 vsnex 5366 . . . . . . 7 {𝑦} ∈ V
109elpw 4535 . . . . . 6 ({𝑦} ∈ 𝒫 𝐴 ↔ {𝑦} ⊆ 𝐴)
118, 10sylibr 236 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑦} ∈ 𝒫 𝐴)
12 vsnid 4597 . . . . . 6 𝑥 ∈ {𝑥}
1312a1i 11 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑥 ∈ {𝑥})
14 vsnid 4597 . . . . . 6 𝑦 ∈ {𝑦}
1514a1i 11 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑦 ∈ {𝑦})
16 disjsn2 4646 . . . . . 6 (𝑥𝑦 → ({𝑥} ∩ {𝑦}) = ∅)
1716adantl 483 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → ({𝑥} ∩ {𝑦}) = ∅)
18 eleq2 2830 . . . . . . 7 (𝑢 = {𝑥} → (𝑥𝑢𝑥 ∈ {𝑥}))
19 ineq1 4144 . . . . . . . 8 (𝑢 = {𝑥} → (𝑢𝑣) = ({𝑥} ∩ 𝑣))
2019eqeq1d 2743 . . . . . . 7 (𝑢 = {𝑥} → ((𝑢𝑣) = ∅ ↔ ({𝑥} ∩ 𝑣) = ∅))
2118, 203anbi13d 1447 . . . . . 6 (𝑢 = {𝑥} → ((𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅)))
22 eleq2 2830 . . . . . . 7 (𝑣 = {𝑦} → (𝑦𝑣𝑦 ∈ {𝑦}))
23 ineq2 4145 . . . . . . . 8 (𝑣 = {𝑦} → ({𝑥} ∩ 𝑣) = ({𝑥} ∩ {𝑦}))
2423eqeq1d 2743 . . . . . . 7 (𝑣 = {𝑦} → (({𝑥} ∩ 𝑣) = ∅ ↔ ({𝑥} ∩ {𝑦}) = ∅))
2522, 243anbi23d 1448 . . . . . 6 (𝑣 = {𝑦} → ((𝑥 ∈ {𝑥} ∧ 𝑦𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)))
2621, 25rspc2ev 3574 . . . . 5 (({𝑥} ∈ 𝒫 𝐴 ∧ {𝑦} ∈ 𝒫 𝐴 ∧ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)) → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅))
276, 11, 13, 15, 17, 26syl113anc 1391 . . . 4 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅))
2827ex 414 . . 3 ((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦 → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅)))
2928ralrimivva 3184 . 2 (𝐴𝑉 → ∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅)))
30 unipw 5391 . . . 4 𝒫 𝐴 = 𝐴
3130eqcomi 2750 . . 3 𝐴 = 𝒫 𝐴
3231ishaus 23308 . 2 (𝒫 𝐴 ∈ Haus ↔ (𝒫 𝐴 ∈ Top ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅))))
331, 29, 32sylanbrc 590 1 (𝐴𝑉 → 𝒫 𝐴 ∈ Haus)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1093   = wceq 1548  wcel 2121  wne 2936  wral 3055  wrex 3065  cin 3883  wss 3884  c0 4263  𝒫 cpw 4531  {csn 4557   cuni 4840  Topctop 22879  Hauscha 23294
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5220  ax-pow 5296  ax-pr 5364  ax-un 7681
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-pw 4533  df-sn 4558  df-pr 4560  df-uni 4841  df-top 22880  df-haus 23301
This theorem is referenced by:  ssoninhaus  36689
  Copyright terms: Public domain W3C validator