Theorem hausnei 23661

Description: Neighborhood property of a Hausdorff space. (Contributed by NM, 8-Mar-2007.)

Hypothesis

Ref	Expression
ist0.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
hausnei	⊢ ((𝐽 ∈ Haus ∧ (𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋 ∧ 𝑃 ≠ 𝑄)) → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))

Distinct variable groups:   𝑚,𝑛,𝐽   𝑃,𝑚,𝑛   𝑄,𝑚,𝑛

Allowed substitution hints:   𝑋(𝑚, 𝑛)

Proof of Theorem hausnei

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

Step	Hyp	Ref	Expression
1		ist0.1	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐽
2	1	ishaus 23655	. . . . . 6 ⊢ (𝐽 ∈ Haus ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))))
3	2	simprbi 503	. . . . 5 ⊢ (𝐽 ∈ Haus → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
4		neeq1 3021	. . . . . . 7 ⊢ (𝑥 = 𝑃 → (𝑥 ≠ 𝑦 ↔ 𝑃 ≠ 𝑦))
5		eleq1 2852	. . . . . . . . 9 ⊢ (𝑥 = 𝑃 → (𝑥 ∈ 𝑛 ↔ 𝑃 ∈ 𝑛))
6	5	3anbi1d 1468	. . . . . . . 8 ⊢ (𝑥 = 𝑃 → ((𝑥 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ (𝑃 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
7	6	2rexbidv 3231	. . . . . . 7 ⊢ (𝑥 = 𝑃 → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
8	4, 7	imbi12d 347	. . . . . 6 ⊢ (𝑥 = 𝑃 → ((𝑥 ≠ 𝑦 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) ↔ (𝑃 ≠ 𝑦 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))))
9		neeq2 3022	. . . . . . 7 ⊢ (𝑦 = 𝑄 → (𝑃 ≠ 𝑦 ↔ 𝑃 ≠ 𝑄))
10		eleq1 2852	. . . . . . . . 9 ⊢ (𝑦 = 𝑄 → (𝑦 ∈ 𝑚 ↔ 𝑄 ∈ 𝑚))
11	10	3anbi2d 1469	. . . . . . . 8 ⊢ (𝑦 = 𝑄 → ((𝑃 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
12	11	2rexbidv 3231	. . . . . . 7 ⊢ (𝑦 = 𝑄 → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
13	9, 12	imbi12d 347	. . . . . 6 ⊢ (𝑦 = 𝑄 → ((𝑃 ≠ 𝑦 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) ↔ (𝑃 ≠ 𝑄 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))))
14	8, 13	rspc2v 3590	. . . . 5 ⊢ ((𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑥 ∈ 𝑛 ∧ 𝑦 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑃 ≠ 𝑄 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))))
15	3, 14	syl5 35	. . . 4 ⊢ ((𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) → (𝐽 ∈ Haus → (𝑃 ≠ 𝑄 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))))
16	15	ex 418	. . 3 ⊢ (𝑃 ∈ 𝑋 → (𝑄 ∈ 𝑋 → (𝐽 ∈ Haus → (𝑃 ≠ 𝑄 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))))
17	16	com3r 88	. 2 ⊢ (𝐽 ∈ Haus → (𝑃 ∈ 𝑋 → (𝑄 ∈ 𝑋 → (𝑃 ≠ 𝑄 → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))))
18	17	3imp2 1368	1 ⊢ ((𝐽 ∈ Haus ∧ (𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋 ∧ 𝑃 ≠ 𝑄)) → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑃 ∈ 𝑛 ∧ 𝑄 ∈ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ∩ cin 4092  ∅c0 4281  ∪ cuni 4870  Topctop 23226  Hauscha 23641

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-uni 4871  df-haus 23648

This theorem is used by:  haust1  23685  cnhaus  23687  lmmo  23713  hauscmplem  23739  pthaus  23972  txhaus  23981  xkohaus  23987  hausflimi  24314  hauspwpwf1  24321