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

Theorem nbgr0edg 26253
Description: In an empty graph (with no edges), every vertex has no neighbor. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Proof shortened by AV, 15-Nov-2020.)
Assertion
Ref Expression
nbgr0edg  |-  ( (Edg
`  G )  =  (/)  ->  ( G NeighbVtx  K )  =  (/) )

Proof of Theorem nbgr0edg
Dummy variables  e  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rzal 4073 . . . 4  |-  ( (Edg
`  G )  =  (/)  ->  A. e  e.  (Edg
`  G )  -. 
{ K ,  n }  C_  e )
2 ralnex 2992 . . . 4  |-  ( A. e  e.  (Edg `  G
)  -.  { K ,  n }  C_  e  <->  -. 
E. e  e.  (Edg
`  G ) { K ,  n }  C_  e )
31, 2sylib 208 . . 3  |-  ( (Edg
`  G )  =  (/)  ->  -.  E. e  e.  (Edg `  G ) { K ,  n }  C_  e )
43ralrimivw 2967 . 2  |-  ( (Edg
`  G )  =  (/)  ->  A. n  e.  ( (Vtx `  G )  \  { K } )  -.  E. e  e.  (Edg `  G ) { K ,  n }  C_  e )
54nbgr0vtxlem 26251 1  |-  ( (Edg
`  G )  =  (/)  ->  ( G NeighbVtx  K )  =  (/) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1483   A.wral 2912   E.wrex 2913    \ cdif 3571    C_ wss 3574   (/)c0 3915   {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  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-fal 1489  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-csb 3534  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-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-nbgr 26228
This theorem is referenced by:  uvtxa01vtx0  26297
  Copyright terms: Public domain W3C validator