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

Theorem dfnbgr2 26235
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 26234 . 2 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒})
4 vex 3203 . . . . . 6 𝑛 ∈ V
5 prssg 4350 . . . . . 6 ((𝑁𝑉𝑛 ∈ V) → ((𝑁𝑒𝑛𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
64, 5mpan2 707 . . . . 5 (𝑁𝑉 → ((𝑁𝑒𝑛𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
76bicomd 213 . . . 4 (𝑁𝑉 → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁𝑒𝑛𝑒)))
87rexbidv 3052 . . 3 (𝑁𝑉 → (∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)))
98rabbidv 3189 . 2 (𝑁𝑉 → {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)})
103, 9eqtrd 2656 1 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑛 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 (𝑁𝑒𝑛𝑒)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wrex 2913  {crab 2916  Vcvv 3200  cdif 3571  wss 3574  {csn 4177  {cpr 4179  cfv 5888  (class class class)co 6650  Vtxcvtx 25874  Edgcedg 25939   NeighbVtx cnbgr 26224
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-nbgr 26228
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator