Theorem clnbgrnvtx0 47808

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 6931	. . . . . 6 ⊢ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔) = (Vtx‘𝐺)
3	1, 2	eqtr4i 2762	. . . . 5 ⊢ 𝑉 = ⦋𝐺 / 𝑔⦌(Vtx‘𝑔)
4		neleq2 3044	. . . . 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 47800	. . 3 ⊢ ClNeighbVtx = (𝑔 ∈ V, 𝑣 ∈ (Vtx‘𝑔) ↦ ({𝑣} ∪ {𝑛 ∈ (Vtx‘𝑔) ∣ ∃𝑒 ∈ (Edg‘𝑔){𝑣, 𝑛} ⊆ 𝑒}))
9	8	mpoxneldm 8216	. 2 ⊢ ((𝐺 ∉ V ∨ 𝑋 ∉ ⦋𝐺 / 𝑔⦌(Vtx‘𝑔)) → (𝐺 ClNeighbVtx 𝑋) = ∅)
10	7, 9	syl 17	1 ⊢ (𝑋 ∉ 𝑉 → (𝐺 ClNeighbVtx 𝑋) = ∅)

Syntax hints:   → wi 4   ↔ wb 206   ∨ wo 847   = wceq 1540   ∉ wnel 3037  ∃wrex 3061  {crab 3420  Vcvv 3464  ⦋csb 3879   ∪ cun 3929   ⊆ wss 3931  ∅c0 4313  {csn 4606  {cpr 4608  ‘cfv 6536  (class class class)co 7410  Vtxcvtx 28980  Edgcedg 29031   ClNeighbVtx cclnbgr 47799

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-nel 3038  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7993  df-2nd 7994  df-clnbgr 47800

This theorem is referenced by:  clnbgr0vtx  47816