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 49194
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 49193 . 2 (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}))
4 prssg 4780 . . . . . . 7 ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ V) → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
54elvd 3460 . . . . . 6 (𝑁 ∈ 𝑉 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
65bicomd 226 . . . . 5 (𝑁 ∈ 𝑉 → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
76rexbidv 3190 . . . 4 (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
87rabbidv 3423 . . 3 (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})
98uneq2d 4170 . 2 (𝑁 ∈ 𝑉 → ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
103, 9eqtrd 2798 1 (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  {csn 4588  {cpr 4590  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631  Edgcedg 29682   ClNeighbVtx cclnbgr 49189
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 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-clnbgr 49190
This theorem is used by:  dfclnbgr4  49195  dfclnbgr5  49221  dfclnbgr6  49227
  Copyright terms: Public domain W3C validator