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

Theorem dfclnbgr2 48920
Description: Alternate definition of the closed neighborhood of a vertex breaking up the subset relationship of an unordered pair. (Contributed by AV, 7-May-2025.)
Hypotheses
Ref Expression
clnbgrval.v 𝑉 = (Vtx‘𝐺)
clnbgrval.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
dfclnbgr2 (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺,𝑛   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛
Allowed substitution hint:   𝐸(𝑛)

Proof of Theorem dfclnbgr2
StepHypRef Expression
1 clnbgrval.v . . 3 𝑉 = (Vtx‘𝐺)
2 clnbgrval.e . . 3 𝐸 = (Edg‘𝐺)
31, 2clnbgrval 48919 . 2 (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}))
4 prssg 4780 . . . . . . 7 ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ V) → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
54elvd 3457 . . . . . 6 (𝑁 ∈ 𝑉 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
65bicomd 226 . . . . 5 (𝑁 ∈ 𝑉 → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
76rexbidv 3187 . . . 4 (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
87rabbidv 3420 . . 3 (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})
98uneq2d 4115 . 2 (𝑁 ∈ 𝑉 → ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
103, 9eqtrd 2796 1 (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  {crab 3413  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  {csn 4584  {cpr 4586  ‘cfv 6538  (class class class)co 7420  Vtxcvtx 29574  Edgcedg 29625   ClNeighbVtx cclnbgr 48915
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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-clnbgr 48916
This theorem is used by:  dfclnbgr4  48921  dfclnbgr5  48947  dfclnbgr6  48953
  Copyright terms: Public domain W3C validator