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

Theorem nbgr0edg 29947
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 4449 . . . 4 ((Edg‘𝐺) = ∅ → ∀𝑒 ∈ (Edg‘𝐺) ¬ {𝐾, 𝑛} ⊆ 𝑒)
2 ralnex 3088 . . . 4 (∀𝑒 ∈ (Edg‘𝐺) ¬ {𝐾, 𝑛} ⊆ 𝑒 ↔ ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
31, 2sylib 221 . . 3 ((Edg‘𝐺) = ∅ → ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
43ralrimivw 3158 . 2 ((Edg‘𝐺) = ∅ → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
54nbgr0edglem 29946 1 ((Edg‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569  ∀wral 3076  ∃wrex 3086   ⊆ wss 3896   ∖ cdif 4044  ∅c0 4277  {csn 4584  {cpr 4586  ‘cfv 6543  (class class class)co 7424  Vtxcvtx 29583  Edgcedg 29634   NeighbVtx cnbgr 29922
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-nbgr 29923
This theorem is used by:  uvtx01vtx  29987  clnbgr0edg  49071
  Copyright terms: Public domain W3C validator