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

Theorem nbgrsym 28887
Description: In a graph, the neighborhood relation is symmetric: a vertex 𝑁 in a graph 𝐺 is a neighbor of a second vertex 𝐾 iff the second vertex 𝐾 is a neighbor of the first vertex 𝑁. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 27-Oct-2020.) (Revised by AV, 12-Feb-2022.)
Assertion
Ref Expression
nbgrsym (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁))

Proof of Theorem nbgrsym
Dummy variable 𝑒 is distinct from all other variables.
StepHypRef Expression
1 ancom 459 . . 3 ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ↔ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)))
2 necom 2992 . . 3 (𝑁𝐾𝐾𝑁)
3 prcom 4735 . . . . 5 {𝐾, 𝑁} = {𝑁, 𝐾}
43sseq1i 4009 . . . 4 ({𝐾, 𝑁} ⊆ 𝑒 ↔ {𝑁, 𝐾} ⊆ 𝑒)
54rexbii 3092 . . 3 (∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒 ↔ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)
61, 2, 53anbi123i 1153 . 2 (((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒))
7 eqid 2730 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
8 eqid 2730 . . 3 (Edg‘𝐺) = (Edg‘𝐺)
97, 8nbgrel 28864 . 2 (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒))
107, 8nbgrel 28864 . 2 (𝐾 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒))
116, 9, 103bitr4i 302 1 (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 394  w3a 1085  wcel 2104  wne 2938  wrex 3068  wss 3947  {cpr 4629  cfv 6542  (class class class)co 7411  Vtxcvtx 28523  Edgcedg 28574   NeighbVtx cnbgr 28856
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6494  df-fun 6544  df-fv 6550  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7977  df-2nd 7978  df-nbgr 28857
This theorem is referenced by:  nbusgredgeu0  28892  uvtxnbgrvtx  28917  cplgr3v  28959  frgrncvvdeqlem1  29819  frgrwopreglem4a  29830  numclwwlk1lem2foa  29874
  Copyright terms: Public domain W3C validator