Theorem nbgrval 28860

Description: The set of neighbors of a vertex 𝑉 in a graph 𝐺. (Contributed by Alexander van der Vekens, 7-Oct-2017.) (Revised by AV, 24-Oct-2020.) (Revised by AV, 21-Mar-2021.)

Hypotheses

Ref	Expression
nbgrval.v	⊢ 𝑉 = (Vtx‘𝐺)
nbgrval.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
nbgrval	⊢ (𝑁 ∈ 𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒})

Distinct variable groups:   𝑒,𝐸   𝑒,𝐺,𝑛   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛

Allowed substitution hint:   𝐸(𝑛)

Proof of Theorem nbgrval

Dummy variables 𝑔 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nbgr 28857	. 2 ⊢ NeighbVtx = (𝑔 ∈ V, 𝑘 ∈ (Vtx‘𝑔) ↦ {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒})
2		nbgrval.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
3	2	1vgrex 28529	. . 3 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V)
4		fveq2 6890	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
5	2, 4	eqtr4id 2789	. . . . 5 ⊢ (𝑔 = 𝐺 → 𝑉 = (Vtx‘𝑔))
6	5	eleq2d 2817	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑁 ∈ 𝑉 ↔ 𝑁 ∈ (Vtx‘𝑔)))
7	6	biimpac 477	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑔 = 𝐺) → 𝑁 ∈ (Vtx‘𝑔))
8		fvex 6903	. . . . 5 ⊢ (Vtx‘𝑔) ∈ V
9	8	difexi 5327	. . . 4 ⊢ ((Vtx‘𝑔) ∖ {𝑘}) ∈ V
10		rabexg 5330	. . . 4 ⊢ (((Vtx‘𝑔) ∖ {𝑘}) ∈ V → {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒} ∈ V)
11	9, 10	mp1i 13	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒} ∈ V)
12	4, 2	eqtr4di 2788	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉)
13	12	adantr 479	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → (Vtx‘𝑔) = 𝑉)
14		sneq 4637	. . . . . . 7 ⊢ (𝑘 = 𝑁 → {𝑘} = {𝑁})
15	14	adantl 480	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → {𝑘} = {𝑁})
16	13, 15	difeq12d 4122	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → ((Vtx‘𝑔) ∖ {𝑘}) = (𝑉 ∖ {𝑁}))
17	16	adantl 480	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → ((Vtx‘𝑔) ∖ {𝑘}) = (𝑉 ∖ {𝑁}))
18		fveq2 6890	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (Edg‘𝑔) = (Edg‘𝐺))
19		nbgrval.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
20	18, 19	eqtr4di 2788	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Edg‘𝑔) = 𝐸)
21	20	adantr 479	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → (Edg‘𝑔) = 𝐸)
22	21	adantl 480	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → (Edg‘𝑔) = 𝐸)
23		preq1 4736	. . . . . . . 8 ⊢ (𝑘 = 𝑁 → {𝑘, 𝑛} = {𝑁, 𝑛})
24	23	sseq1d 4012	. . . . . . 7 ⊢ (𝑘 = 𝑁 → ({𝑘, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ 𝑒))
25	24	adantl 480	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → ({𝑘, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ 𝑒))
26	25	adantl 480	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → ({𝑘, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ 𝑒))
27	22, 26	rexeqbidv 3341	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → (∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒))
28	17, 27	rabeqbidv 3447	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒} = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒})
29	3, 7, 11, 28	ovmpodv2 7568	. 2 ⊢ (𝑁 ∈ 𝑉 → ( NeighbVtx = (𝑔 ∈ V, 𝑘 ∈ (Vtx‘𝑔) ↦ {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒}) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}))
30	1, 29	mpi 20	1 ⊢ (𝑁 ∈ 𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1539   ∈ wcel 2104  ∃wrex 3068  {crab 3430  Vcvv 3472   ∖ cdif 3944   ⊆ wss 3947  {csn 4627  {cpr 4629  ‘cfv 6542  (class class class)co 7411   ∈ cmpo 7413  Vtxcvtx 28523  Edgcedg 28574   NeighbVtx cnbgr 28856

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-iota 6494  df-fun 6544  df-fv 6550  df-ov 7414  df-oprab 7415  df-mpo 7416  df-nbgr 28857

This theorem is referenced by:  dfnbgr2  28861  dfnbgr3  28862  nbgrel  28864  nbuhgr  28867  nbupgr  28868  nbumgrvtx  28870  nbgr0vtxlem  28879  nbgrnself  28883