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

Theorem nbgr0edg 27133
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‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)

Proof of Theorem nbgr0edg
Dummy variables 𝑒 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rzal 4452 . . . 4 ((Edg‘𝐺) = ∅ → ∀𝑒 ∈ (Edg‘𝐺) ¬ {𝐾, 𝑛} ⊆ 𝑒)
2 ralnex 3236 . . . 4 (∀𝑒 ∈ (Edg‘𝐺) ¬ {𝐾, 𝑛} ⊆ 𝑒 ↔ ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
31, 2sylib 220 . . 3 ((Edg‘𝐺) = ∅ → ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
43ralrimivw 3183 . 2 ((Edg‘𝐺) = ∅ → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
54nbgr0vtxlem 27131 1 ((Edg‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1533  wral 3138  wrex 3139  cdif 3932  wss 3935  c0 4290  {csn 4560  {cpr 4562  cfv 6349  (class class class)co 7150  Vtxcvtx 26775  Edgcedg 26826   NeighbVtx cnbgr 27108
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-fal 1546  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-nbgr 27109
This theorem is referenced by:  uvtx01vtx  27173
  Copyright terms: Public domain W3C validator