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

Theorem dfnbgrss2 48350
Description: Subset chain for different kinds of neighborhoods of a vertex. (Contributed by AV, 16-May-2025.)
Hypotheses
Ref Expression
dfvopnbgr2.v 𝑉 = (Vtx‘𝐺)
dfvopnbgr2.e 𝐸 = (Edg‘𝐺)
dfvopnbgr2.u 𝑈 = {𝑛𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒𝐸 (𝑁 = 𝑛𝑒 = {𝑁}))}
dfsclnbgr6.s 𝑆 = {𝑛𝑉 ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒}
Assertion
Ref Expression
dfnbgrss2 (𝑁𝑉 → ((𝐺 NeighbVtx 𝑁) ⊆ 𝑈𝑈𝑆𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁)))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛   𝑛,𝐸   𝑛,𝐺
Allowed substitution hints:   𝑆(𝑒,𝑛)   𝑈(𝑒,𝑛)

Proof of Theorem dfnbgrss2
StepHypRef Expression
1 dfvopnbgr2.v . . . 4 𝑉 = (Vtx‘𝐺)
2 dfvopnbgr2.e . . . 4 𝐸 = (Edg‘𝐺)
3 dfvopnbgr2.u . . . 4 𝑈 = {𝑛𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒𝐸 (𝑁 = 𝑛𝑒 = {𝑁}))}
41, 2, 3dfnbgr6 48348 . . 3 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = (𝑈 ∖ {𝑁}))
5 difss 4077 . . 3 (𝑈 ∖ {𝑁}) ⊆ 𝑈
64, 5eqsstrdi 3967 . 2 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) ⊆ 𝑈)
7 ssun1 4119 . . 3 𝑈 ⊆ (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒𝐸 𝑛𝑒})
8 dfsclnbgr6.s . . . 4 𝑆 = {𝑛𝑉 ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒}
91, 2, 3, 8dfsclnbgr6 48349 . . 3 (𝑁𝑉𝑆 = (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒𝐸 𝑛𝑒}))
107, 9sseqtrrid 3966 . 2 (𝑁𝑉𝑈𝑆)
111, 8, 2dfnbgrss 48343 . . 3 (𝑁𝑉 → ((𝐺 NeighbVtx 𝑁) ⊆ 𝑆𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁)))
1211simprd 495 . 2 (𝑁𝑉𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁))
136, 10, 123jca 1129 1 (𝑁𝑉 → ((𝐺 NeighbVtx 𝑁) ⊆ 𝑈𝑈𝑆𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wrex 3062  {crab 3390  cdif 3887  cun 3888  wss 3890  {csn 4568  {cpr 4570  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-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