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

Theorem nbgrnself 26257
Description: A vertex in a graph is not a neighbor of itself. (Contributed by by AV, 3-Nov-2020.) (Revised by AV, 21-Mar-2021.)
Hypothesis
Ref Expression
nbgrisvtx.v  |-  V  =  (Vtx `  G )
Assertion
Ref Expression
nbgrnself  |-  A. v  e.  V  v  e/  ( G NeighbVtx  v )
Distinct variable group:    v, G
Allowed substitution hint:    V( v)

Proof of Theorem nbgrnself
Dummy variables  e  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 neldifsnd 4322 . . . . 5  |-  ( v  e.  V  ->  -.  v  e.  ( V  \  { v } ) )
21intnanrd 963 . . . 4  |-  ( v  e.  V  ->  -.  ( v  e.  ( V  \  { v } )  /\  E. e  e.  (Edg `  G
) { v ,  v }  C_  e
) )
3 df-nel 2898 . . . . 5  |-  ( v  e/  { n  e.  ( V  \  {
v } )  |  E. e  e.  (Edg
`  G ) { v ,  n }  C_  e }  <->  -.  v  e.  { n  e.  ( V  \  { v } )  |  E. e  e.  (Edg `  G
) { v ,  n }  C_  e } )
4 preq2 4269 . . . . . . . 8  |-  ( n  =  v  ->  { v ,  n }  =  { v ,  v } )
54sseq1d 3632 . . . . . . 7  |-  ( n  =  v  ->  ( { v ,  n }  C_  e  <->  { v ,  v }  C_  e ) )
65rexbidv 3052 . . . . . 6  |-  ( n  =  v  ->  ( E. e  e.  (Edg `  G ) { v ,  n }  C_  e 
<->  E. e  e.  (Edg
`  G ) { v ,  v } 
C_  e ) )
76elrab 3363 . . . . 5  |-  ( v  e.  { n  e.  ( V  \  {
v } )  |  E. e  e.  (Edg
`  G ) { v ,  n }  C_  e }  <->  ( v  e.  ( V  \  {
v } )  /\  E. e  e.  (Edg `  G ) { v ,  v }  C_  e ) )
83, 7xchbinx 324 . . . 4  |-  ( v  e/  { n  e.  ( V  \  {
v } )  |  E. e  e.  (Edg
`  G ) { v ,  n }  C_  e }  <->  -.  (
v  e.  ( V 
\  { v } )  /\  E. e  e.  (Edg `  G ) { v ,  v }  C_  e )
)
92, 8sylibr 224 . . 3  |-  ( v  e.  V  ->  v  e/  { n  e.  ( V  \  { v } )  |  E. e  e.  (Edg `  G
) { v ,  n }  C_  e } )
10 eqidd 2623 . . . 4  |-  ( v  e.  V  ->  v  =  v )
11 nbgrisvtx.v . . . . 5  |-  V  =  (Vtx `  G )
12 eqid 2622 . . . . 5  |-  (Edg `  G )  =  (Edg
`  G )
1311, 12nbgrval 26234 . . . 4  |-  ( v  e.  V  ->  ( G NeighbVtx  v )  =  {
n  e.  ( V 
\  { v } )  |  E. e  e.  (Edg `  G ) { v ,  n }  C_  e } )
1410, 13neleq12d 2901 . . 3  |-  ( v  e.  V  ->  (
v  e/  ( G NeighbVtx  v )  <->  v  e/  {
n  e.  ( V 
\  { v } )  |  E. e  e.  (Edg `  G ) { v ,  n }  C_  e } ) )
159, 14mpbird 247 . 2  |-  ( v  e.  V  ->  v  e/  ( G NeighbVtx  v )
)
1615rgen 2922 1  |-  A. v  e.  V  v  e/  ( G NeighbVtx  v )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    /\ wa 384    = wceq 1483    e. wcel 1990    e/ wnel 2897   A.wral 2912   E.wrex 2913   {crab 2916    \ cdif 3571    C_ 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-nel 2898  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:  usgrnbnself  26258  nbgrnself2  26259
  Copyright terms: Public domain W3C validator