Theorem nbgrval 27703

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 27700	. 2 ⊢ NeighbVtx = (𝑔 ∈ V, 𝑘 ∈ (Vtx‘𝑔) ↦ {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒})
2		nbgrval.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
3	2	1vgrex 27372	. . 3 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V)
4		fveq2 6774	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
5	2, 4	eqtr4id 2797	. . . . 5 ⊢ (𝑔 = 𝐺 → 𝑉 = (Vtx‘𝑔))
6	5	eleq2d 2824	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑁 ∈ 𝑉 ↔ 𝑁 ∈ (Vtx‘𝑔)))
7	6	biimpac 479	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑔 = 𝐺) → 𝑁 ∈ (Vtx‘𝑔))
8		fvex 6787	. . . . 5 ⊢ (Vtx‘𝑔) ∈ V
9	8	difexi 5252	. . . 4 ⊢ ((Vtx‘𝑔) ∖ {𝑘}) ∈ V
10		rabexg 5255	. . . 4 ⊢ (((Vtx‘𝑔) ∖ {𝑘}) ∈ V → {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒} ∈ V)
11	9, 10	mp1i 13	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒} ∈ V)
12	4, 2	eqtr4di 2796	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = 𝑉)
13	12	adantr 481	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → (Vtx‘𝑔) = 𝑉)
14		sneq 4571	. . . . . . 7 ⊢ (𝑘 = 𝑁 → {𝑘} = {𝑁})
15	14	adantl 482	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → {𝑘} = {𝑁})
16	13, 15	difeq12d 4058	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → ((Vtx‘𝑔) ∖ {𝑘}) = (𝑉 ∖ {𝑁}))
17	16	adantl 482	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → ((Vtx‘𝑔) ∖ {𝑘}) = (𝑉 ∖ {𝑁}))
18		fveq2 6774	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (Edg‘𝑔) = (Edg‘𝐺))
19		nbgrval.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
20	18, 19	eqtr4di 2796	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Edg‘𝑔) = 𝐸)
21	20	adantr 481	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → (Edg‘𝑔) = 𝐸)
22	21	adantl 482	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → (Edg‘𝑔) = 𝐸)
23		preq1 4669	. . . . . . . 8 ⊢ (𝑘 = 𝑁 → {𝑘, 𝑛} = {𝑁, 𝑛})
24	23	sseq1d 3952	. . . . . . 7 ⊢ (𝑘 = 𝑁 → ({𝑘, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ 𝑒))
25	24	adantl 482	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑘 = 𝑁) → ({𝑘, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ 𝑒))
26	25	adantl 482	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → ({𝑘, 𝑛} ⊆ 𝑒 ↔ {𝑁, 𝑛} ⊆ 𝑒))
27	22, 26	rexeqbidv 3337	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → (∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒))
28	17, 27	rabeqbidv 3420	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑔 = 𝐺 ∧ 𝑘 = 𝑁)) → {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒} = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒})
29	3, 7, 11, 28	ovmpodv2 7431	. 2 ⊢ (𝑁 ∈ 𝑉 → ( NeighbVtx = (𝑔 ∈ V, 𝑘 ∈ (Vtx‘𝑔) ↦ {𝑛 ∈ ((Vtx‘𝑔) ∖ {𝑘}) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑘, 𝑛} ⊆ 𝑒}) → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}))
30	1, 29	mpi 20	1 ⊢ (𝑁 ∈ 𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∃wrex 3065  {crab 3068  Vcvv 3432   ∖ cdif 3884   ⊆ wss 3887  {csn 4561  {cpr 4563  ‘cfv 6433  (class class class)co 7275   ∈ cmpo 7277  Vtxcvtx 27366  Edgcedg 27417   NeighbVtx cnbgr 27699

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-nbgr 27700

This theorem is referenced by:  dfnbgr2  27704  dfnbgr3  27705  nbgrel  27707  nbuhgr  27710  nbupgr  27711  nbumgrvtx  27713  nbgr0vtxlem  27722  nbgrnself  27726