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

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

Proof of Theorem dfnbgrss
StepHypRef Expression
1 dfsclnbgr2.v . . . 4 𝑉 = (Vtx‘𝐺)
2 dfsclnbgr2.s . . . 4 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}
3 dfsclnbgr2.e . . . 4 𝐸 = (Edg‘𝐺)
41, 2, 3dfnbgr5 49152 . . 3 (𝑁 ∈ 𝑉 → (𝐺 NeighbVtx 𝑁) = (𝑆 ∖ {𝑁}))
5 difss 4075 . . 3 (𝑆 ∖ {𝑁}) ⊆ 𝑆
64, 5eqsstrdi 3957 . 2 (𝑁 ∈ 𝑉 → (𝐺 NeighbVtx 𝑁) ⊆ 𝑆)
7 ssun2 4180 . . 3 𝑆 ⊆ ({𝑁} ∪ 𝑆)
81, 2, 3dfclnbgr5 49151 . . 3 (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ 𝑆))
97, 8sseqtrrid 3956 . 2 (𝑁 ∈ 𝑉 → 𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁))
106, 9jca 521 1 (𝑁 ∈ 𝑉 → ((𝐺 NeighbVtx 𝑁) ⊆ 𝑆 ∧ 𝑆 ⊆ (𝐺 ClNeighbVtx 𝑁)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416   ⊆ wss 3900   ∖ cdif 4048   ∪ cun 4152  {csn 4588  {cpr 4590  ‘cfv 6555  (class class class)co 7440  Vtxcvtx 29601  Edgcedg 29652   NeighbVtx cnbgr 29940   ClNeighbVtx cclnbgr 49119
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6509  df-fun 6557  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-nbgr 29941  df-clnbgr 49120
This theorem is used by:  dfnbgrss2  49160
  Copyright terms: Public domain W3C validator