Theorem neibastop3 34478

Description: The topology generated by a neighborhood base is unique. (Contributed by Jeff Hankins, 16-Sep-2009.) (Proof shortened by Mario Carneiro, 11-Sep-2015.)

Hypotheses

Ref	Expression
neibastop1.1	⊢ (𝜑 → 𝑋 ∈ 𝑉)
neibastop1.2	⊢ (𝜑 → 𝐹:𝑋⟶(𝒫 𝒫 𝑋 ∖ {∅}))
neibastop1.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑣 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥))) → ((𝐹‘𝑥) ∩ 𝒫 (𝑣 ∩ 𝑤)) ≠ ∅)
neibastop1.4	⊢ 𝐽 = {𝑜 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑜 ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅}
neibastop1.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑣 ∈ (𝐹‘𝑥))) → 𝑥 ∈ 𝑣)
neibastop1.6	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑣 ∈ (𝐹‘𝑥))) → ∃𝑡 ∈ (𝐹‘𝑥)∀𝑦 ∈ 𝑡 ((𝐹‘𝑦) ∩ 𝒫 𝑣) ≠ ∅)

Assertion

Ref	Expression
neibastop3	⊢ (𝜑 → ∃!𝑗 ∈ (TopOn‘𝑋)∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})

Distinct variable groups:   𝑡,𝑛,𝑣,𝑦,𝑗,𝑥   𝑗,𝐽   𝑥,𝑛,𝐽,𝑣,𝑦   𝑡,𝑜,𝑣,𝑤,𝑥,𝑦,𝑗,𝐹,𝑛   𝜑,𝑗,𝑛,𝑜,𝑡,𝑣,𝑤,𝑥,𝑦   𝑗,𝑋,𝑛,𝑜,𝑡,𝑣,𝑤,𝑥,𝑦

Allowed substitution hints:   𝐽(𝑤,𝑡,𝑜)   𝑉(𝑥,𝑦,𝑤,𝑣,𝑡,𝑗,𝑛,𝑜)

Proof of Theorem neibastop3

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		neibastop1.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
2		neibastop1.2	. . . 4 ⊢ (𝜑 → 𝐹:𝑋⟶(𝒫 𝒫 𝑋 ∖ {∅}))
3		neibastop1.3	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑣 ∈ (𝐹‘𝑥) ∧ 𝑤 ∈ (𝐹‘𝑥))) → ((𝐹‘𝑥) ∩ 𝒫 (𝑣 ∩ 𝑤)) ≠ ∅)
4		neibastop1.4	. . . 4 ⊢ 𝐽 = {𝑜 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑜 ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅}
5	1, 2, 3, 4	neibastop1 34475	. . 3 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
6		neibastop1.5	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑣 ∈ (𝐹‘𝑥))) → 𝑥 ∈ 𝑣)
7		neibastop1.6	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑣 ∈ (𝐹‘𝑥))) → ∃𝑡 ∈ (𝐹‘𝑥)∀𝑦 ∈ 𝑡 ((𝐹‘𝑦) ∩ 𝒫 𝑣) ≠ ∅)
8	1, 2, 3, 4, 6, 7	neibastop2 34477	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝑧}) ↔ (𝑛 ⊆ 𝑋 ∧ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅)))
9		velpw 4535	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝒫 𝑋 ↔ 𝑛 ⊆ 𝑋)
10	9	anbi1i 623	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝒫 𝑋 ∧ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅) ↔ (𝑛 ⊆ 𝑋 ∧ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅))
11	8, 10	bitr4di 288	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → (𝑛 ∈ ((nei‘𝐽)‘{𝑧}) ↔ (𝑛 ∈ 𝒫 𝑋 ∧ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅)))
12	11	abbi2dv 2876	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → ((nei‘𝐽)‘{𝑧}) = {𝑛 ∣ (𝑛 ∈ 𝒫 𝑋 ∧ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅)})
13		df-rab 3072	. . . . . 6 ⊢ {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅} = {𝑛 ∣ (𝑛 ∈ 𝒫 𝑋 ∧ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅)}
14	12, 13	eqtr4di 2797	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → ((nei‘𝐽)‘{𝑧}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅})
15	14	ralrimiva 3107	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑋 ((nei‘𝐽)‘{𝑧}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅})
16		sneq 4568	. . . . . . 7 ⊢ (𝑥 = 𝑧 → {𝑥} = {𝑧})
17	16	fveq2d 6760	. . . . . 6 ⊢ (𝑥 = 𝑧 → ((nei‘𝐽)‘{𝑥}) = ((nei‘𝐽)‘{𝑧}))
18		fveq2 6756	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
19	18	ineq1d 4142	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((𝐹‘𝑥) ∩ 𝒫 𝑛) = ((𝐹‘𝑧) ∩ 𝒫 𝑛))
20	19	neeq1d 3002	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅ ↔ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅))
21	20	rabbidv 3404	. . . . . 6 ⊢ (𝑥 = 𝑧 → {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅})
22	17, 21	eqeq12d 2754	. . . . 5 ⊢ (𝑥 = 𝑧 → (((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ((nei‘𝐽)‘{𝑧}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅}))
23	22	cbvralvw 3372	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 ((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ∀𝑧 ∈ 𝑋 ((nei‘𝐽)‘{𝑧}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑧) ∩ 𝒫 𝑛) ≠ ∅})
24	15, 23	sylibr 233	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})
25		toponuni 21971	. . . . . . . . . 10 ⊢ (𝑗 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑗)
26		eqimss2 3974	. . . . . . . . . 10 ⊢ (𝑋 = ∪ 𝑗 → ∪ 𝑗 ⊆ 𝑋)
27	25, 26	syl 17	. . . . . . . . 9 ⊢ (𝑗 ∈ (TopOn‘𝑋) → ∪ 𝑗 ⊆ 𝑋)
28		sspwuni 5025	. . . . . . . . 9 ⊢ (𝑗 ⊆ 𝒫 𝑋 ↔ ∪ 𝑗 ⊆ 𝑋)
29	27, 28	sylibr 233	. . . . . . . 8 ⊢ (𝑗 ∈ (TopOn‘𝑋) → 𝑗 ⊆ 𝒫 𝑋)
30	29	ad2antlr 723	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → 𝑗 ⊆ 𝒫 𝑋)
31		sseqin2 4146	. . . . . . 7 ⊢ (𝑗 ⊆ 𝒫 𝑋 ↔ (𝒫 𝑋 ∩ 𝑗) = 𝑗)
32	30, 31	sylib 217	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → (𝒫 𝑋 ∩ 𝑗) = 𝑗)
33		topontop 21970	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (TopOn‘𝑋) → 𝑗 ∈ Top)
34	33	ad3antlr 727	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ∧ 𝑜 ∈ 𝒫 𝑋) → 𝑗 ∈ Top)
35		eltop2 22033	. . . . . . . . . 10 ⊢ (𝑗 ∈ Top → (𝑜 ∈ 𝑗 ↔ ∀𝑥 ∈ 𝑜 ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜)))
36	34, 35	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ∧ 𝑜 ∈ 𝒫 𝑋) → (𝑜 ∈ 𝑗 ↔ ∀𝑥 ∈ 𝑜 ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜)))
37		elpwi 4539	. . . . . . . . . . . . . . 15 ⊢ (𝑜 ∈ 𝒫 𝑋 → 𝑜 ⊆ 𝑋)
38		ssralv 3983	. . . . . . . . . . . . . . 15 ⊢ (𝑜 ⊆ 𝑋 → (∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} → ∀𝑥 ∈ 𝑜 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
39	37, 38	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑜 ∈ 𝒫 𝑋 → (∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} → ∀𝑥 ∈ 𝑜 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
40	39	adantl 481	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) → (∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} → ∀𝑥 ∈ 𝑜 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
41		simprr 769	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})
42	41	eleq2d 2824	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → (𝑜 ∈ ((nei‘𝑗)‘{𝑥}) ↔ 𝑜 ∈ {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
43	33	ad3antlr 727	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → 𝑗 ∈ Top)
44	25	adantl 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) → 𝑋 = ∪ 𝑗)
45	44	sseq2d 3949	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) → (𝑜 ⊆ 𝑋 ↔ 𝑜 ⊆ ∪ 𝑗))
46	45	biimpa 476	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ⊆ 𝑋) → 𝑜 ⊆ ∪ 𝑗)
47	37, 46	sylan2 592	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) → 𝑜 ⊆ ∪ 𝑗)
48	47	sselda 3917	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ 𝑥 ∈ 𝑜) → 𝑥 ∈ ∪ 𝑗)
49	48	adantrr 713	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → 𝑥 ∈ ∪ 𝑗)
50	47	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → 𝑜 ⊆ ∪ 𝑗)
51		eqid 2738	. . . . . . . . . . . . . . . . . . 19 ⊢ ∪ 𝑗 = ∪ 𝑗
52	51	isneip 22164	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑗 ∈ Top ∧ 𝑥 ∈ ∪ 𝑗) → (𝑜 ∈ ((nei‘𝑗)‘{𝑥}) ↔ (𝑜 ⊆ ∪ 𝑗 ∧ ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜))))
53	52	baibd 539	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ ∪ 𝑗) ∧ 𝑜 ⊆ ∪ 𝑗) → (𝑜 ∈ ((nei‘𝑗)‘{𝑥}) ↔ ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜)))
54	43, 49, 50, 53	syl21anc 834	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → (𝑜 ∈ ((nei‘𝑗)‘{𝑥}) ↔ ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜)))
55		pweq 4546	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 = 𝑜 → 𝒫 𝑛 = 𝒫 𝑜)
56	55	ineq2d 4143	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑜 → ((𝐹‘𝑥) ∩ 𝒫 𝑛) = ((𝐹‘𝑥) ∩ 𝒫 𝑜))
57	56	neeq1d 3002	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑜 → (((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅ ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
58	57	elrab3 3618	. . . . . . . . . . . . . . . . 17 ⊢ (𝑜 ∈ 𝒫 𝑋 → (𝑜 ∈ {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
59	58	ad2antlr 723	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → (𝑜 ∈ {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
60	42, 54, 59	3bitr3d 308	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ (𝑥 ∈ 𝑜 ∧ ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})) → (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
61	60	expr 456	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ 𝑥 ∈ 𝑜) → (((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} → (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅)))
62	61	ralimdva 3102	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) → (∀𝑥 ∈ 𝑜 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} → ∀𝑥 ∈ 𝑜 (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅)))
63	40, 62	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) → (∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} → ∀𝑥 ∈ 𝑜 (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅)))
64	63	imp 406	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑜 ∈ 𝒫 𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → ∀𝑥 ∈ 𝑜 (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
65	64	an32s 648	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ∧ 𝑜 ∈ 𝒫 𝑋) → ∀𝑥 ∈ 𝑜 (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
66		ralbi 3092	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ 𝑜 (∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅) → (∀𝑥 ∈ 𝑜 ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ∀𝑥 ∈ 𝑜 ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
67	65, 66	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ∧ 𝑜 ∈ 𝒫 𝑋) → (∀𝑥 ∈ 𝑜 ∃𝑧 ∈ 𝑗 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑜) ↔ ∀𝑥 ∈ 𝑜 ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
68	36, 67	bitrd 278	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ∧ 𝑜 ∈ 𝒫 𝑋) → (𝑜 ∈ 𝑗 ↔ ∀𝑥 ∈ 𝑜 ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅))
69	68	rabbi2dva 4148	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → (𝒫 𝑋 ∩ 𝑗) = {𝑜 ∈ 𝒫 𝑋 ∣ ∀𝑥 ∈ 𝑜 ((𝐹‘𝑥) ∩ 𝒫 𝑜) ≠ ∅})
70	69, 4	eqtr4di 2797	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → (𝒫 𝑋 ∩ 𝑗) = 𝐽)
71	32, 70	eqtr3d 2780	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → 𝑗 = 𝐽)
72	71	expl 457	. . . 4 ⊢ (𝜑 → ((𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → 𝑗 = 𝐽))
73	72	alrimiv 1931	. . 3 ⊢ (𝜑 → ∀𝑗((𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → 𝑗 = 𝐽))
74		eleq1 2826	. . . . 5 ⊢ (𝑗 = 𝐽 → (𝑗 ∈ (TopOn‘𝑋) ↔ 𝐽 ∈ (TopOn‘𝑋)))
75		fveq2 6756	. . . . . . . 8 ⊢ (𝑗 = 𝐽 → (nei‘𝑗) = (nei‘𝐽))
76	75	fveq1d 6758	. . . . . . 7 ⊢ (𝑗 = 𝐽 → ((nei‘𝑗)‘{𝑥}) = ((nei‘𝐽)‘{𝑥}))
77	76	eqeq1d 2740	. . . . . 6 ⊢ (𝑗 = 𝐽 → (((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
78	77	ralbidv 3120	. . . . 5 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ∀𝑥 ∈ 𝑋 ((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
79	74, 78	anbi12d 630	. . . 4 ⊢ (𝑗 = 𝐽 → ((𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ↔ (𝐽 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})))
80	79	eqeu 3636	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐽 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝐽)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) ∧ ∀𝑗((𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}) → 𝑗 = 𝐽)) → ∃!𝑗(𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
81	5, 5, 24, 73, 80	syl121anc 1373	. 2 ⊢ (𝜑 → ∃!𝑗(𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
82		df-reu 3070	. 2 ⊢ (∃!𝑗 ∈ (TopOn‘𝑋)∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅} ↔ ∃!𝑗(𝑗 ∈ (TopOn‘𝑋) ∧ ∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅}))
83	81, 82	sylibr 233	1 ⊢ (𝜑 → ∃!𝑗 ∈ (TopOn‘𝑋)∀𝑥 ∈ 𝑋 ((nei‘𝑗)‘{𝑥}) = {𝑛 ∈ 𝒫 𝑋 ∣ ((𝐹‘𝑥) ∩ 𝒫 𝑛) ≠ ∅})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085  ∀wal 1537   = wceq 1539   ∈ wcel 2108  ∃!weu 2568  {cab 2715   ≠ wne 2942  ∀wral 3063  ∃wrex 3064  ∃!wreu 3065  {crab 3067   ∖ cdif 3880   ∩ cin 3882   ⊆ wss 3883  ∅c0 4253  𝒫 cpw 4530  {csn 4558  ∪ cuni 4836  ⟶wf 6414  ‘cfv 6418  Topctop 21950  TopOnctopon 21967  neicnei 22156

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-topgen 17071  df-top 21951  df-topon 21968  df-nei 22157

This theorem is referenced by: (None)