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

Theorem vtxnbuvtx 26339
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 26335 . 2 (𝑁 ∈ (UnivVtx‘𝐺) ↔ (𝑁𝑉 ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)))
32simprbi 479 1 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1523  wcel 2030  wral 2941  cdif 3604  {csn 4210  cfv 5926  (class class class)co 6690  Vtxcvtx 25919   NeighbVtx cnbgr 26269  UnivVtxcuvtx 26331
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-mpt 4763  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-iota 5889  df-fun 5928  df-fv 5934  df-ov 6693  df-uvtx 26332
This theorem is referenced by:  uvtxnbgrss  26340  uvtxnbgrvtx  26341
  Copyright terms: Public domain W3C validator