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

Theorem dishaus 22733
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 22345 . 2 (𝐴𝑉 → 𝒫 𝐴 ∈ Top)
2 simplrl 775 . . . . . . 7 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑥𝐴)
32snssd 4769 . . . . . 6 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑥} ⊆ 𝐴)
4 vsnex 5386 . . . . . . 7 {𝑥} ∈ V
54elpw 4564 . . . . . 6 ({𝑥} ∈ 𝒫 𝐴 ↔ {𝑥} ⊆ 𝐴)
63, 5sylibr 233 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑥} ∈ 𝒫 𝐴)
7 simplrr 776 . . . . . . 7 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑦𝐴)
87snssd 4769 . . . . . 6 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑦} ⊆ 𝐴)
9 vsnex 5386 . . . . . . 7 {𝑦} ∈ V
109elpw 4564 . . . . . 6 ({𝑦} ∈ 𝒫 𝐴 ↔ {𝑦} ⊆ 𝐴)
118, 10sylibr 233 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → {𝑦} ∈ 𝒫 𝐴)
12 vsnid 4623 . . . . . 6 𝑥 ∈ {𝑥}
1312a1i 11 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑥 ∈ {𝑥})
14 vsnid 4623 . . . . . 6 𝑦 ∈ {𝑦}
1514a1i 11 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → 𝑦 ∈ {𝑦})
16 disjsn2 4673 . . . . . 6 (𝑥𝑦 → ({𝑥} ∩ {𝑦}) = ∅)
1716adantl 482 . . . . 5 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → ({𝑥} ∩ {𝑦}) = ∅)
18 eleq2 2826 . . . . . . 7 (𝑢 = {𝑥} → (𝑥𝑢𝑥 ∈ {𝑥}))
19 ineq1 4165 . . . . . . . 8 (𝑢 = {𝑥} → (𝑢𝑣) = ({𝑥} ∩ 𝑣))
2019eqeq1d 2738 . . . . . . 7 (𝑢 = {𝑥} → ((𝑢𝑣) = ∅ ↔ ({𝑥} ∩ 𝑣) = ∅))
2118, 203anbi13d 1438 . . . . . 6 (𝑢 = {𝑥} → ((𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅)))
22 eleq2 2826 . . . . . . 7 (𝑣 = {𝑦} → (𝑦𝑣𝑦 ∈ {𝑦}))
23 ineq2 4166 . . . . . . . 8 (𝑣 = {𝑦} → ({𝑥} ∩ 𝑣) = ({𝑥} ∩ {𝑦}))
2423eqeq1d 2738 . . . . . . 7 (𝑣 = {𝑦} → (({𝑥} ∩ 𝑣) = ∅ ↔ ({𝑥} ∩ {𝑦}) = ∅))
2522, 243anbi23d 1439 . . . . . 6 (𝑣 = {𝑦} → ((𝑥 ∈ {𝑥} ∧ 𝑦𝑣 ∧ ({𝑥} ∩ 𝑣) = ∅) ↔ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)))
2621, 25rspc2ev 3592 . . . . 5 (({𝑥} ∈ 𝒫 𝐴 ∧ {𝑦} ∈ 𝒫 𝐴 ∧ (𝑥 ∈ {𝑥} ∧ 𝑦 ∈ {𝑦} ∧ ({𝑥} ∩ {𝑦}) = ∅)) → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅))
276, 11, 13, 15, 17, 26syl113anc 1382 . . . 4 (((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) ∧ 𝑥𝑦) → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅))
2827ex 413 . . 3 ((𝐴𝑉 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥𝑦 → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅)))
2928ralrimivva 3197 . 2 (𝐴𝑉 → ∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅)))
30 unipw 5407 . . . 4 𝒫 𝐴 = 𝐴
3130eqcomi 2745 . . 3 𝐴 = 𝒫 𝐴
3231ishaus 22673 . 2 (𝒫 𝐴 ∈ Haus ↔ (𝒫 𝐴 ∈ Top ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦 → ∃𝑢 ∈ 𝒫 𝐴𝑣 ∈ 𝒫 𝐴(𝑥𝑢𝑦𝑣 ∧ (𝑢𝑣) = ∅))))
331, 29, 32sylanbrc 583 1 (𝐴𝑉 → 𝒫 𝐴 ∈ Haus)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wne 2943  wral 3064  wrex 3073  cin 3909  wss 3910  c0 4282  𝒫 cpw 4560  {csn 4586   cuni 4865  Topctop 22242  Hauscha 22659
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2707  ax-sep 5256  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-pw 4562  df-sn 4587  df-pr 4589  df-uni 4866  df-top 22243  df-haus 22666
This theorem is referenced by:  ssoninhaus  34920
  Copyright terms: Public domain W3C validator