Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  clnbgr0edg Structured version   Visualization version   GIF version

Theorem clnbgr0edg 48328
Description: In an empty graph (with no edges), all closed neighborhoods consists of a single vertex. (Contributed by AV, 10-May-2025.)
Assertion
Ref Expression
clnbgr0edg (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝐾) = {𝐾})

Proof of Theorem clnbgr0edg
StepHypRef Expression
1 eqid 2737 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
21dfclnbgr4 48315 . . 3 (𝐾 ∈ (Vtx‘𝐺) → (𝐺 ClNeighbVtx 𝐾) = ({𝐾} ∪ (𝐺 NeighbVtx 𝐾)))
32adantl 481 . 2 (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝐾) = ({𝐾} ∪ (𝐺 NeighbVtx 𝐾)))
4 nbgr0edg 29443 . . . 4 ((Edg‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)
54adantr 480 . . 3 (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 NeighbVtx 𝐾) = ∅)
65uneq2d 4109 . 2 (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → ({𝐾} ∪ (𝐺 NeighbVtx 𝐾)) = ({𝐾} ∪ ∅))
7 un0 4335 . . 3 ({𝐾} ∪ ∅) = {𝐾}
87a1i 11 . 2 (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → ({𝐾} ∪ ∅) = {𝐾})
93, 6, 83eqtrd 2776 1 (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝐾) = {𝐾})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  cun 3888  c0 4274  {csn 4568  cfv 6493  (class class class)co 7361  Vtxcvtx 29082  Edgcedg 29133   NeighbVtx cnbgr 29418   ClNeighbVtx cclnbgr 48309
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5371  ax-un 7683
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-nbgr 29419  df-clnbgr 48310
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator