Theorem hausnei2 23362

Description: The Hausdorff condition still holds if one considers general neighborhoods instead of open sets. (Contributed by Jeff Hankins, 5-Sep-2009.)

Assertion

Ref	Expression
hausnei2	⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Haus ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)))

Distinct variable groups:   𝑥,𝑦   𝑣,𝑢,𝑥,𝑦,𝐽   𝑢,𝑋,𝑣,𝑥,𝑦

Proof of Theorem hausnei2

Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ishaus2 23360	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Haus ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
2		topontop 22920	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
3		simp1 1136	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) → 𝐽 ∈ Top)
4		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) → 𝑚 ∈ 𝐽)
5		simp1 1136	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → 𝑥 ∈ 𝑚)
6		opnneip 23128	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑥 ∈ 𝑚) → 𝑚 ∈ ((nei‘𝐽)‘{𝑥}))
7	3, 4, 5, 6	syl2an3an 1423	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) ∧ (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) → 𝑚 ∈ ((nei‘𝐽)‘{𝑥}))
8		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) → 𝑛 ∈ 𝐽)
9		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → 𝑦 ∈ 𝑛)
10		opnneip 23128	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑛 ∈ 𝐽 ∧ 𝑦 ∈ 𝑛) → 𝑛 ∈ ((nei‘𝐽)‘{𝑦}))
11	3, 8, 9, 10	syl2an3an 1423	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) ∧ (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) → 𝑛 ∈ ((nei‘𝐽)‘{𝑦}))
12		simpr3 1196	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) ∧ (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) → (𝑚 ∩ 𝑛) = ∅)
13		ineq1 4212	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑚 → (𝑢 ∩ 𝑣) = (𝑚 ∩ 𝑣))
14	13	eqeq1d 2738	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑚 → ((𝑢 ∩ 𝑣) = ∅ ↔ (𝑚 ∩ 𝑣) = ∅))
15		ineq2 4213	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑛 → (𝑚 ∩ 𝑣) = (𝑚 ∩ 𝑛))
16	15	eqeq1d 2738	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑛 → ((𝑚 ∩ 𝑣) = ∅ ↔ (𝑚 ∩ 𝑛) = ∅))
17	14, 16	rspc2ev 3634	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ((nei‘𝐽)‘{𝑥}) ∧ 𝑛 ∈ ((nei‘𝐽)‘{𝑦}) ∧ (𝑚 ∩ 𝑛) = ∅) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)
18	7, 11, 12, 17	syl3anc 1372	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) ∧ (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)
19	18	ex 412	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) → ((𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅))
20	19	3expib 1122	. . . . . . 7 ⊢ (𝐽 ∈ Top → ((𝑚 ∈ 𝐽 ∧ 𝑛 ∈ 𝐽) → ((𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)))
21	20	rexlimdvv 3211	. . . . . 6 ⊢ (𝐽 ∈ Top → (∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅))
22		neii2 23117	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑢 ∈ ((nei‘𝐽)‘{𝑥})) → ∃𝑚 ∈ 𝐽 ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢))
23	22	ex 412	. . . . . . . 8 ⊢ (𝐽 ∈ Top → (𝑢 ∈ ((nei‘𝐽)‘{𝑥}) → ∃𝑚 ∈ 𝐽 ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢)))
24		neii2 23117	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝑣 ∈ ((nei‘𝐽)‘{𝑦})) → ∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣))
25	24	ex 412	. . . . . . . 8 ⊢ (𝐽 ∈ Top → (𝑣 ∈ ((nei‘𝐽)‘{𝑦}) → ∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣)))
26		vex 3483	. . . . . . . . . . . . . . 15 ⊢ 𝑥 ∈ V
27	26	snss 4784	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑚 ↔ {𝑥} ⊆ 𝑚)
28	27	anbi1i 624	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) ↔ ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢))
29		vex 3483	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ 𝑦 ∈ V
30	29	snss 4784	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 ∈ 𝑛 ↔ {𝑦} ⊆ 𝑛)
31	30	anbi1i 624	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣) ↔ ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣))
32		simp1l 1197	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) ∧ (𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣) ∧ (𝑢 ∩ 𝑣) = ∅) → 𝑥 ∈ 𝑚)
33		simp2l 1199	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) ∧ (𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣) ∧ (𝑢 ∩ 𝑣) = ∅) → 𝑦 ∈ 𝑛)
34		ss2in 4244	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑚 ⊆ 𝑢 ∧ 𝑛 ⊆ 𝑣) → (𝑚 ∩ 𝑛) ⊆ (𝑢 ∩ 𝑣))
35		ssn0 4403	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((𝑚 ∩ 𝑛) ⊆ (𝑢 ∩ 𝑣) ∧ (𝑚 ∩ 𝑛) ≠ ∅) → (𝑢 ∩ 𝑣) ≠ ∅)
36	35	ex 412	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑚 ∩ 𝑛) ⊆ (𝑢 ∩ 𝑣) → ((𝑚 ∩ 𝑛) ≠ ∅ → (𝑢 ∩ 𝑣) ≠ ∅))
37	36	necon4d 2963	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑚 ∩ 𝑛) ⊆ (𝑢 ∩ 𝑣) → ((𝑢 ∩ 𝑣) = ∅ → (𝑚 ∩ 𝑛) = ∅))
38	34, 37	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑚 ⊆ 𝑢 ∧ 𝑛 ⊆ 𝑣) → ((𝑢 ∩ 𝑣) = ∅ → (𝑚 ∩ 𝑛) = ∅))
39	38	ad2ant2l 746	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) ∧ (𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣)) → ((𝑢 ∩ 𝑣) = ∅ → (𝑚 ∩ 𝑛) = ∅))
40	39	3impia 1117	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) ∧ (𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣) ∧ (𝑢 ∩ 𝑣) = ∅) → (𝑚 ∩ 𝑛) = ∅)
41	32, 33, 40	3jca 1128	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) ∧ (𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣) ∧ (𝑢 ∩ 𝑣) = ∅) → (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))
42	41	3exp 1119	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) → ((𝑦 ∈ 𝑛 ∧ 𝑛 ⊆ 𝑣) → ((𝑢 ∩ 𝑣) = ∅ → (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
43	31, 42	biimtrrid 243	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) → (({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → ((𝑢 ∩ 𝑣) = ∅ → (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
44	43	com3r 87	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑢 ∩ 𝑣) = ∅ → ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) → (({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
45	44	imp 406	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑢 ∩ 𝑣) = ∅ ∧ (𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢)) → (({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
46	45	3adant1 1130	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐽 ∈ Top ∧ (𝑢 ∩ 𝑣) = ∅ ∧ (𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢)) → (({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
47	46	reximdv 3169	. . . . . . . . . . . . . . . 16 ⊢ ((𝐽 ∈ Top ∧ (𝑢 ∩ 𝑣) = ∅ ∧ (𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢)) → (∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
48	47	3exp 1119	. . . . . . . . . . . . . . 15 ⊢ (𝐽 ∈ Top → ((𝑢 ∩ 𝑣) = ∅ → ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) → (∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))))
49	48	com34 91	. . . . . . . . . . . . . 14 ⊢ (𝐽 ∈ Top → ((𝑢 ∩ 𝑣) = ∅ → (∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) → ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))))
50	49	3imp 1110	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ (𝑢 ∩ 𝑣) = ∅ ∧ ∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣)) → ((𝑥 ∈ 𝑚 ∧ 𝑚 ⊆ 𝑢) → ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
51	28, 50	biimtrrid 243	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ (𝑢 ∩ 𝑣) = ∅ ∧ ∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣)) → (({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢) → ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
52	51	reximdv 3169	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ (𝑢 ∩ 𝑣) = ∅ ∧ ∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣)) → (∃𝑚 ∈ 𝐽 ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢) → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
53	52	3exp 1119	. . . . . . . . . 10 ⊢ (𝐽 ∈ Top → ((𝑢 ∩ 𝑣) = ∅ → (∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → (∃𝑚 ∈ 𝐽 ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢) → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))))
54	53	com24 95	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → (∃𝑚 ∈ 𝐽 ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢) → (∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣) → ((𝑢 ∩ 𝑣) = ∅ → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))))
55	54	impd 410	. . . . . . . 8 ⊢ (𝐽 ∈ Top → ((∃𝑚 ∈ 𝐽 ({𝑥} ⊆ 𝑚 ∧ 𝑚 ⊆ 𝑢) ∧ ∃𝑛 ∈ 𝐽 ({𝑦} ⊆ 𝑛 ∧ 𝑛 ⊆ 𝑣)) → ((𝑢 ∩ 𝑣) = ∅ → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
56	23, 25, 55	syl2and 608	. . . . . . 7 ⊢ (𝐽 ∈ Top → ((𝑢 ∈ ((nei‘𝐽)‘{𝑥}) ∧ 𝑣 ∈ ((nei‘𝐽)‘{𝑦})) → ((𝑢 ∩ 𝑣) = ∅ → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅))))
57	56	rexlimdvv 3211	. . . . . 6 ⊢ (𝐽 ∈ Top → (∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅ → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)))
58	21, 57	impbid 212	. . . . 5 ⊢ (𝐽 ∈ Top → (∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅) ↔ ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅))
59	58	imbi2d 340	. . . 4 ⊢ (𝐽 ∈ Top → ((𝑥 ≠ 𝑦 → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ (𝑥 ≠ 𝑦 → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)))
60	59	2ralbidv 3220	. . 3 ⊢ (𝐽 ∈ Top → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)))
61	2, 60	syl 17	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑚 ∈ 𝐽 ∃𝑛 ∈ 𝐽 (𝑥 ∈ 𝑚 ∧ 𝑦 ∈ 𝑛 ∧ (𝑚 ∩ 𝑛) = ∅)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)))
62	1, 61	bitrd 279	1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐽 ∈ Haus ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥 ≠ 𝑦 → ∃𝑢 ∈ ((nei‘𝐽)‘{𝑥})∃𝑣 ∈ ((nei‘𝐽)‘{𝑦})(𝑢 ∩ 𝑣) = ∅)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1539   ∈ wcel 2107   ≠ wne 2939  ∀wral 3060  ∃wrex 3069   ∩ cin 3949   ⊆ wss 3950  ∅c0 4332  {csn 4625  ‘cfv 6560  Topctop 22900  TopOnctopon 22917  neicnei 23106  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-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  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-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-top 22901  df-topon 22918  df-nei 23107  df-haus 23324

This theorem is referenced by:  hausflim  23990