Theorem neiptopreu 23049

Description: If, to each element 𝑃 of a set 𝑋, we associate a set (𝑁‘𝑃) fulfilling Properties V_i, V_ii, V_iii and Property V_iv of [BourbakiTop1] p. I.2. , corresponding to ssnei 23026, innei 23041, elnei 23027 and neissex 23043, then there is a unique topology 𝑗 such that for any point 𝑝, (𝑁‘𝑝) is the set of neighborhoods of 𝑝. Proposition 2 of [BourbakiTop1] p. I.3. This can be used to build a topology from a set of neighborhoods. Note that innei 23041 uses binary intersections whereas Property V_ii mentions finite intersections (which includes the empty intersection of subsets of 𝑋, which is equal to 𝑋), so we add the hypothesis that 𝑋 is a neighborhood of all points. TODO: when df-fi 9302 includes the empty intersection, remove that extra hypothesis. (Contributed by Thierry Arnoux, 6-Jan-2018.)

Hypotheses

Ref	Expression
neiptop.o	⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
neiptop.0	⊢ (𝜑 → 𝑁:𝑋⟶𝒫 𝒫 𝑋)
neiptop.1	⊢ ((((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑏 ∈ (𝑁‘𝑝))
neiptop.2	⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))
neiptop.3	⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎)
neiptop.4	⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑏 ∈ (𝑁‘𝑝)∀𝑞 ∈ 𝑏 𝑎 ∈ (𝑁‘𝑞))
neiptop.5	⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝))

Assertion

Ref	Expression
neiptopreu	⊢ (𝜑 → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))

Distinct variable groups:   𝑝,𝑎,𝑁   𝑋,𝑎,𝑏,𝑝   𝐽,𝑎,𝑝   𝑋,𝑝   𝜑,𝑝   𝑁,𝑏   𝑋,𝑏   𝜑,𝑎,𝑏,𝑞,𝑝   𝑁,𝑝,𝑞   𝑋,𝑞   𝜑,𝑞   𝑗,𝑎,𝑏,𝐽,𝑝   𝑗,𝑞,𝑁   𝑗,𝑋   𝜑,𝑗

Allowed substitution hint:   𝐽(𝑞)

Proof of Theorem neiptopreu

Step	Hyp	Ref	Expression
1		neiptop.o	. . . . 5 ⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}
2		neiptop.0	. . . . 5 ⊢ (𝜑 → 𝑁:𝑋⟶𝒫 𝒫 𝑋)
3		neiptop.1	. . . . 5 ⊢ ((((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑏 ∈ (𝑁‘𝑝))
4		neiptop.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝))
5		neiptop.3	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎)
6		neiptop.4	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑏 ∈ (𝑁‘𝑝)∀𝑞 ∈ 𝑏 𝑎 ∈ (𝑁‘𝑞))
7		neiptop.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝))
8	1, 2, 3, 4, 5, 6, 7	neiptoptop 23047	. . . 4 ⊢ (𝜑 → 𝐽 ∈ Top)
9		toptopon2 22834	. . . 4 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘∪ 𝐽))
10	8, 9	sylib 218	. . 3 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘∪ 𝐽))
11	1, 2, 3, 4, 5, 6, 7	neiptopuni 23046	. . . 4 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)
12	11	fveq2d 6832	. . 3 ⊢ (𝜑 → (TopOn‘𝑋) = (TopOn‘∪ 𝐽))
13	10, 12	eleqtrrd 2836	. 2 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
14	1, 2, 3, 4, 5, 6, 7	neiptopnei 23048	. 2 ⊢ (𝜑 → 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝐽)‘{𝑝})))
15		nfv 1915	. . . . . . . . . 10 ⊢ Ⅎ𝑝(𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋))
16		nfmpt1 5192	. . . . . . . . . . 11 ⊢ Ⅎ𝑝(𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))
17	16	nfeq2 2913	. . . . . . . . . 10 ⊢ Ⅎ𝑝 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))
18	15, 17	nfan 1900	. . . . . . . . 9 ⊢ Ⅎ𝑝((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
19		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑝 𝑏 ⊆ 𝑋
20	18, 19	nfan 1900	. . . . . . . 8 ⊢ Ⅎ𝑝(((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋)
21		simpllr 775	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) ∧ 𝑝 ∈ 𝑏) → 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
22		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) → 𝑏 ⊆ 𝑋)
23	22	sselda 3930	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) ∧ 𝑝 ∈ 𝑏) → 𝑝 ∈ 𝑋)
24		id 22	. . . . . . . . . . . 12 ⊢ (𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
25		fvexd 6843	. . . . . . . . . . . 12 ⊢ ((𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ∧ 𝑝 ∈ 𝑋) → ((nei‘𝑗)‘{𝑝}) ∈ V)
26	24, 25	fvmpt2d 6948	. . . . . . . . . . 11 ⊢ ((𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ∧ 𝑝 ∈ 𝑋) → (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝}))
27	21, 23, 26	syl2anc 584	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) ∧ 𝑝 ∈ 𝑏) → (𝑁‘𝑝) = ((nei‘𝑗)‘{𝑝}))
28	27	eqcomd 2739	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) ∧ 𝑝 ∈ 𝑏) → ((nei‘𝑗)‘{𝑝}) = (𝑁‘𝑝))
29	28	eleq2d 2819	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) ∧ 𝑝 ∈ 𝑏) → (𝑏 ∈ ((nei‘𝑗)‘{𝑝}) ↔ 𝑏 ∈ (𝑁‘𝑝)))
30	20, 29	ralbida 3244	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ⊆ 𝑋) → (∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}) ↔ ∀𝑝 ∈ 𝑏 𝑏 ∈ (𝑁‘𝑝)))
31	30	pm5.32da 579	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → ((𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})) ↔ (𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ (𝑁‘𝑝))))
32		toponss 22843	. . . . . . . . 9 ⊢ ((𝑗 ∈ (TopOn‘𝑋) ∧ 𝑏 ∈ 𝑗) → 𝑏 ⊆ 𝑋)
33	32	ad4ant24 754	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ∈ 𝑗) → 𝑏 ⊆ 𝑋)
34		topontop 22829	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (TopOn‘𝑋) → 𝑗 ∈ Top)
35	34	ad2antlr 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → 𝑗 ∈ Top)
36		opnnei 23036	. . . . . . . . . 10 ⊢ (𝑗 ∈ Top → (𝑏 ∈ 𝑗 ↔ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})))
37	35, 36	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏 ∈ 𝑗 ↔ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})))
38	37	biimpa 476	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ∈ 𝑗) → ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}))
39	33, 38	jca 511	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ 𝑏 ∈ 𝑗) → (𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})))
40	37	biimpar 477	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝})) → 𝑏 ∈ 𝑗)
41	40	adantrl 716	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) ∧ (𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}))) → 𝑏 ∈ 𝑗)
42	39, 41	impbida 800	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏 ∈ 𝑗 ↔ (𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ ((nei‘𝑗)‘{𝑝}))))
43	1	neipeltop 23045	. . . . . . 7 ⊢ (𝑏 ∈ 𝐽 ↔ (𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ (𝑁‘𝑝)))
44	43	a1i 11	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏 ∈ 𝐽 ↔ (𝑏 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑏 𝑏 ∈ (𝑁‘𝑝))))
45	31, 42, 44	3bitr4d 311	. . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → (𝑏 ∈ 𝑗 ↔ 𝑏 ∈ 𝐽))
46	45	eqrdv 2731	. . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝}))) → 𝑗 = 𝐽)
47	46	ex 412	. . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ (TopOn‘𝑋)) → (𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑗 = 𝐽))
48	47	ralrimiva 3125	. 2 ⊢ (𝜑 → ∀𝑗 ∈ (TopOn‘𝑋)(𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑗 = 𝐽))
49		simpl 482	. . . . . . 7 ⊢ ((𝑗 = 𝐽 ∧ 𝑝 ∈ 𝑋) → 𝑗 = 𝐽)
50	49	fveq2d 6832	. . . . . 6 ⊢ ((𝑗 = 𝐽 ∧ 𝑝 ∈ 𝑋) → (nei‘𝑗) = (nei‘𝐽))
51	50	fveq1d 6830	. . . . 5 ⊢ ((𝑗 = 𝐽 ∧ 𝑝 ∈ 𝑋) → ((nei‘𝑗)‘{𝑝}) = ((nei‘𝐽)‘{𝑝}))
52	51	mpteq2dva 5186	. . . 4 ⊢ (𝑗 = 𝐽 → (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) = (𝑝 ∈ 𝑋 ↦ ((nei‘𝐽)‘{𝑝})))
53	52	eqeq2d 2744	. . 3 ⊢ (𝑗 = 𝐽 → (𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) ↔ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝐽)‘{𝑝}))))
54	53	eqreu 3684	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝐽)‘{𝑝})) ∧ ∀𝑗 ∈ (TopOn‘𝑋)(𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})) → 𝑗 = 𝐽)) → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))
55	13, 14, 48, 54	syl3anc 1373	1 ⊢ (𝜑 → ∃!𝑗 ∈ (TopOn‘𝑋)𝑁 = (𝑝 ∈ 𝑋 ↦ ((nei‘𝑗)‘{𝑝})))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3048  ∃wrex 3057  ∃!wreu 3345  {crab 3396  Vcvv 3437   ⊆ wss 3898  𝒫 cpw 4549  {csn 4575  ∪ cuni 4858   ↦ cmpt 5174  ⟶wf 6482  ‘cfv 6486  ficfi 9301  Topctop 22809  TopOnctopon 22826  neicnei 23013

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-om 7803  df-1o 8391  df-2o 8392  df-en 8876  df-fin 8879  df-fi 9302  df-top 22810  df-topon 22827  df-ntr 22936  df-nei 23014

This theorem is referenced by:  ustuqtop  24162