MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfnbgr2 Structured version   Visualization version   GIF version

Theorem dfnbgr2 27607
Description: Alternate definition of the neighbors of a vertex breaking up the subset relationship of an unordered pair. (Contributed by AV, 15-Nov-2020.) (Revised by AV, 21-Mar-2021.)
Hypotheses
Ref Expression
nbgrval.v 𝑉 = (Vtx‘𝐺)
nbgrval.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
dfnbgr2 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)})
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺,𝑛   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛
Allowed substitution hint:   𝐸(𝑛)

Proof of Theorem dfnbgr2
StepHypRef Expression
1 nbgrval.v . . 3 𝑉 = (Vtx‘𝐺)
2 nbgrval.e . . 3 𝐸 = (Edg‘𝐺)
31, 2nbgrval 27606 . 2 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒})
4 prssg 4749 . . . . . 6 ((𝑁𝑉𝑛 ∈ V) → ((𝑁𝑒𝑛𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
54elvd 3429 . . . . 5 (𝑁𝑉 → ((𝑁𝑒𝑛𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
65bicomd 222 . . . 4 (𝑁𝑉 → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁𝑒𝑛𝑒)))
76rexbidv 3225 . . 3 (𝑁𝑉 → (∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)))
87rabbidv 3404 . 2 (𝑁𝑉 → {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)})
93, 8eqtrd 2778 1 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wrex 3064  {crab 3067  Vcvv 3422  cdif 3880  wss 3883  {csn 4558  {cpr 4560  cfv 6418  (class class class)co 7255  Vtxcvtx 27269  Edgcedg 27320   NeighbVtx cnbgr 27602
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-nbgr 27603
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator