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 48783
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 48781 . . 3 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = (𝑈 ∖ {𝑁}))
5 difss 4086 . . 3 (𝑈 ∖ {𝑁}) ⊆ 𝑈
64, 5eqsstrdi 3978 . 2 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) ⊆ 𝑈)
7 ssun1 4127 . . 3 𝑈 ⊆ (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒𝐸 𝑛𝑒})
8 dfsclnbgr6.s . . . 4 𝑆 = {𝑛𝑉 ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒}
91, 2, 3, 8dfsclnbgr6 48782 . . 3 (𝑁𝑉𝑆 = (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒𝐸 𝑛𝑒}))
107, 9sseqtrrid 3977 . 2 (𝑁𝑉𝑈𝑆)
111, 8, 2dfnbgrss 48776 . . 3 (𝑁𝑉 → ((𝐺 NeighbVtx 𝑁) ⊆ 𝑆𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁)))
1211simprd 501 . 2 (𝑁𝑉𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁))
136, 10, 123jca 1146 1 (𝑁𝑉 → ((𝐺 NeighbVtx 𝑁) ⊆ 𝑈𝑈𝑆𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wo 861  w3a 1103   = wceq 1570  wcel 2145  wrex 3088  {crab 3414  cdif 3899  cun 3900  wss 3902  {csn 4587  {cpr 4589  cfv 6537  (class class class)co 7417  Vtxcvtx 29461  Edgcedg 29512   NeighbVtx cnbgr 29800   ClNeighbVtx cclnbgr 48742
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  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 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-nbgr 29801  df-clnbgr 48743
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator