Theorem clnbgrnvtx0 48015

Description: If a class 𝑋 is not a vertex of a graph 𝐺, then it has an empty closed neighborhood in 𝐺. (Contributed by AV, 8-May-2025.)

Hypothesis

Ref	Expression
clnbgrel.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
clnbgrnvtx0	⊢ (𝑋 ∉ 𝑉 → (𝐺 ClNeighbVtx 𝑋) = ∅)

Proof of Theorem clnbgrnvtx0

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

Step	Hyp	Ref	Expression
1		clnbgrel.v	. . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺)
2		csbfv 6879	. . . . . 6 ⊢ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔) = (Vtx‘𝐺)
3	1, 2	eqtr4i 2760	. . . . 5 ⊢ 𝑉 = ⦋𝐺 / 𝑔⦌(Vtx‘𝑔)
4		neleq2 3041	. . . . 5 ⊢ (𝑉 = ⦋𝐺 / 𝑔⦌(Vtx‘𝑔) → (𝑋 ∉ 𝑉 ↔ 𝑋 ∉ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔)))
5	3, 4	ax-mp 5	. . . 4 ⊢ (𝑋 ∉ 𝑉 ↔ 𝑋 ∉ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔))
6	5	biimpi 216	. . 3 ⊢ (𝑋 ∉ 𝑉 → 𝑋 ∉ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔))
7	6	olcd 874	. 2 ⊢ (𝑋 ∉ 𝑉 → (𝐺 ∉ V ∨ 𝑋 ∉ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔)))
8		df-clnbgr 48007	. . 3 ⊢ ClNeighbVtx = (𝑔 ∈ V, 𝑣 ∈ (Vtx‘𝑔) ↦ ({𝑣} ∪ {𝑛 ∈ (Vtx‘𝑔) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑣, 𝑛} ⊆ 𝑒}))
9	8	mpoxneldm 8152	. 2 ⊢ ((𝐺 ∉ V ∨ 𝑋 ∉ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔)) → (𝐺 ClNeighbVtx 𝑋) = ∅)
10	7, 9	syl 17	1 ⊢ (𝑋 ∉ 𝑉 → (𝐺 ClNeighbVtx 𝑋) = ∅)

Syntax hints:   → wi 4   ↔ wb 206   ∨ wo 847   = wceq 1541   ∉ wnel 3034  ∃wrex 3058  {crab 3397  Vcvv 3438  ⦋csb 3847   ∪ cun 3897   ⊆ wss 3899  ∅c0 4283  {csn 4578  {cpr 4580  ‘cfv 6490  (class class class)co 7356  Vtxcvtx 29018  Edgcedg 29069   ClNeighbVtx cclnbgr 48006

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 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-clnbgr 48007

This theorem is referenced by:  clnbgr0vtx  48024