Theorem neips 23142

Description: A neighborhood of a set is a neighborhood of every point in the set. Proposition 1 of [BourbakiTop1] p. I.2. (Contributed by FL, 16-Nov-2006.)

Hypothesis

Ref	Expression
neips.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
neips	⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ ∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝})))

Distinct variable groups:   𝐽,𝑝   𝑁,𝑝   𝑆,𝑝   𝑋,𝑝

Proof of Theorem neips

Dummy variables 𝑔 ℎ 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		snssi 4833	. . . . . 6 ⊢ (𝑝 ∈ 𝑆 → {𝑝} ⊆ 𝑆)
2		neiss 23138	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ {𝑝} ⊆ 𝑆) → 𝑁 ∈ ((nei‘𝐽)‘{𝑝}))
3	1, 2	syl3an3 1165	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑝 ∈ 𝑆) → 𝑁 ∈ ((nei‘𝐽)‘{𝑝}))
4	3	3exp 1119	. . . 4 ⊢ (𝐽 ∈ Top → (𝑁 ∈ ((nei‘𝐽)‘𝑆) → (𝑝 ∈ 𝑆 → 𝑁 ∈ ((nei‘𝐽)‘{𝑝}))))
5	4	ralrimdv 3158	. . 3 ⊢ (𝐽 ∈ Top → (𝑁 ∈ ((nei‘𝐽)‘𝑆) → ∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝})))
6	5	3ad2ant1 1133	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) → ∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝})))
7		r19.28zv 4524	. . . . 5 ⊢ (𝑆 ≠ ∅ → (∀𝑝 ∈ 𝑆 (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) ↔ (𝑁 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
8	7	3ad2ant3 1135	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (∀𝑝 ∈ 𝑆 (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) ↔ (𝑁 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
9		ssrab2 4103	. . . . . . . . . 10 ⊢ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝐽
10		uniopn 22924	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝐽) → ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∈ 𝐽)
11	9, 10	mpan2 690	. . . . . . . . 9 ⊢ (𝐽 ∈ Top → ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∈ 𝐽)
12	11	ad2antrr 725	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∈ 𝐽)
13		sseq1 4034	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑔 → (𝑣 ⊆ 𝑁 ↔ 𝑔 ⊆ 𝑁))
14	13	elrab 3708	. . . . . . . . . . . . . . 15 ⊢ (𝑔 ∈ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ↔ (𝑔 ∈ 𝐽 ∧ 𝑔 ⊆ 𝑁))
15		elunii 4936	. . . . . . . . . . . . . . 15 ⊢ ((𝑝 ∈ 𝑔 ∧ 𝑔 ∈ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁}) → 𝑝 ∈ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
16	14, 15	sylan2br 594	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ 𝑔 ∧ (𝑔 ∈ 𝐽 ∧ 𝑔 ⊆ 𝑁)) → 𝑝 ∈ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
17	16	an12s 648	. . . . . . . . . . . . 13 ⊢ ((𝑔 ∈ 𝐽 ∧ (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → 𝑝 ∈ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
18	17	rexlimiva 3153	. . . . . . . . . . . 12 ⊢ (∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁) → 𝑝 ∈ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
19	18	ralimi 3089	. . . . . . . . . . 11 ⊢ (∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁) → ∀𝑝 ∈ 𝑆 𝑝 ∈ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
20		dfss3 3997	. . . . . . . . . . 11 ⊢ (𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ↔ ∀𝑝 ∈ 𝑆 𝑝 ∈ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
21	19, 20	sylibr 234	. . . . . . . . . 10 ⊢ (∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁) → 𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
22	21	adantl 481	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → 𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁})
23		unissb 4963	. . . . . . . . . 10 ⊢ (∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝑁 ↔ ∀ℎ ∈ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁}ℎ ⊆ 𝑁)
24		sseq1 4034	. . . . . . . . . . . 12 ⊢ (𝑣 = ℎ → (𝑣 ⊆ 𝑁 ↔ ℎ ⊆ 𝑁))
25	24	elrab 3708	. . . . . . . . . . 11 ⊢ (ℎ ∈ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ↔ (ℎ ∈ 𝐽 ∧ ℎ ⊆ 𝑁))
26	25	simprbi 496	. . . . . . . . . 10 ⊢ (ℎ ∈ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} → ℎ ⊆ 𝑁)
27	23, 26	mprgbir 3074	. . . . . . . . 9 ⊢ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝑁
28	22, 27	jctir 520	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → (𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∧ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝑁))
29		sseq2 4035	. . . . . . . . . 10 ⊢ (ℎ = ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} → (𝑆 ⊆ ℎ ↔ 𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁}))
30		sseq1 4034	. . . . . . . . . 10 ⊢ (ℎ = ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} → (ℎ ⊆ 𝑁 ↔ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝑁))
31	29, 30	anbi12d 631	. . . . . . . . 9 ⊢ (ℎ = ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} → ((𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁) ↔ (𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∧ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝑁)))
32	31	rspcev 3635	. . . . . . . 8 ⊢ ((∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∈ 𝐽 ∧ (𝑆 ⊆ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ∧ ∪ {𝑣 ∈ 𝐽 ∣ 𝑣 ⊆ 𝑁} ⊆ 𝑁)) → ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))
33	12, 28, 32	syl2anc 583	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))
34	33	ex 412	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁) → ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁)))
35	34	anim2d 611	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((𝑁 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → (𝑁 ⊆ 𝑋 ∧ ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))))
36	35	3adant3 1132	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → ((𝑁 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑆 ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → (𝑁 ⊆ 𝑋 ∧ ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))))
37	8, 36	sylbid 240	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (∀𝑝 ∈ 𝑆 (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁)) → (𝑁 ⊆ 𝑋 ∧ ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))))
38		ssel2 4003	. . . . . . 7 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑝 ∈ 𝑆) → 𝑝 ∈ 𝑋)
39		neips.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
40	39	isneip 23134	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑝 ∈ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘{𝑝}) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
41	38, 40	sylan2 592	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (𝑆 ⊆ 𝑋 ∧ 𝑝 ∈ 𝑆)) → (𝑁 ∈ ((nei‘𝐽)‘{𝑝}) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
42	41	anassrs 467	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) ∧ 𝑝 ∈ 𝑆) → (𝑁 ∈ ((nei‘𝐽)‘{𝑝}) ↔ (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
43	42	ralbidva 3182	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝}) ↔ ∀𝑝 ∈ 𝑆 (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
44	43	3adant3 1132	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝}) ↔ ∀𝑝 ∈ 𝑆 (𝑁 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑝 ∈ 𝑔 ∧ 𝑔 ⊆ 𝑁))))
45	39	isnei 23132	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁 ⊆ 𝑋 ∧ ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))))
46	45	3adant3 1132	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑁 ⊆ 𝑋 ∧ ∃ℎ ∈ 𝐽 (𝑆 ⊆ ℎ ∧ ℎ ⊆ 𝑁))))
47	37, 44, 46	3imtr4d 294	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝}) → 𝑁 ∈ ((nei‘𝐽)‘𝑆)))
48	6, 47	impbid 212	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑆 ≠ ∅) → (𝑁 ∈ ((nei‘𝐽)‘𝑆) ↔ ∀𝑝 ∈ 𝑆 𝑁 ∈ ((nei‘𝐽)‘{𝑝})))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  ∃wrex 3076  {crab 3443   ⊆ wss 3976  ∅c0 4352  {csn 4648  ∪ cuni 4931  ‘cfv 6573  Topctop 22920  neicnei 23126

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-top 22921  df-nei 23127

This theorem is referenced by:  utop2nei  24280