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

Theorem nbgr0edg 29767
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 4457 . . . 4 ((Edg‘𝐺) = ∅ → ∀𝑒 ∈ (Edg‘𝐺) ¬ {𝐾, 𝑛} ⊆ 𝑒)
2 ralnex 3093 . . . 4 (∀𝑒 ∈ (Edg‘𝐺) ¬ {𝐾, 𝑛} ⊆ 𝑒 ↔ ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
31, 2sylib 221 . . 3 ((Edg‘𝐺) = ∅ → ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
43ralrimivw 3163 . 2 ((Edg‘𝐺) = ∅ → ∀𝑛 ∈ ((Vtx‘𝐺) ∖ {𝐾}) ¬ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑛} ⊆ 𝑒)
54nbgr0edglem 29766 1 ((Edg‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4   = wceq 1570  wral 3081  wrex 3091  cdif 3903  wss 3906  c0 4286  {csn 4591  {cpr 4593  cfv 6540  (class class class)co 7419  Vtxcvtx 29403  Edgcedg 29454   NeighbVtx cnbgr 29742
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-nbgr 29743
This theorem is used by:  uvtx01vtx  29807  clnbgr0edg  48662
  Copyright terms: Public domain W3C validator