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

Theorem vtxnbuvtx 27167
Description: A universal vertex has all other vertices as neighbors. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by AV, 30-Oct-2020.) (Proof shortened by AV, 14-Feb-2022.)
Hypothesis
Ref Expression
uvtxel.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
vtxnbuvtx (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
Distinct variable groups:   𝑛,𝐺   𝑛,𝑁   𝑛,𝑉

Proof of Theorem vtxnbuvtx
StepHypRef Expression
1 uvtxel.v . . 3 𝑉 = (Vtx‘𝐺)
21uvtxel 27164 . 2 (𝑁 ∈ (UnivVtx‘𝐺) ↔ (𝑁𝑉 ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)))
32simprbi 499 1 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2110  wral 3138  cdif 3932  {csn 4560  cfv 6349  (class class class)co 7150  Vtxcvtx 26775   NeighbVtx cnbgr 27108  UnivVtxcuvtx 27161
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
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  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-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  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-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-iota 6308  df-fun 6351  df-fv 6357  df-ov 7153  df-uvtx 27162
This theorem is referenced by:  uvtxnbgrss  27168  uvtxnbgrvtx  27169
  Copyright terms: Public domain W3C validator