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

Theorem uvtxnbgrvtx 27758
Description: A universal vertex is neighbor of all other vertices. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by AV, 30-Oct-2020.)
Hypothesis
Ref Expression
uvtxel.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
uvtxnbgrvtx (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑁 ∈ (𝐺 NeighbVtx 𝑣))
Distinct variable groups:   𝑣,𝐺   𝑣,𝑁   𝑣,𝑉

Proof of Theorem uvtxnbgrvtx
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 uvtxel.v . . . 4 𝑉 = (Vtx‘𝐺)
21vtxnbuvtx 27756 . . 3 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
3 eleq1w 2823 . . . . . . 7 (𝑛 = 𝑣 → (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑣 ∈ (𝐺 NeighbVtx 𝑁)))
43rspcva 3559 . . . . . 6 ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → 𝑣 ∈ (𝐺 NeighbVtx 𝑁))
5 nbgrsym 27728 . . . . . . 7 (𝑣 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑁 ∈ (𝐺 NeighbVtx 𝑣))
65a1i 11 . . . . . 6 (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))
74, 6syl5ibcom 244 . . . . 5 ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → (𝑁 ∈ (UnivVtx‘𝐺) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))
87expcom 414 . . . 4 (∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → (𝑁 ∈ (UnivVtx‘𝐺) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣))))
98com23 86 . . 3 (∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁) → (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣))))
102, 9mpcom 38 . 2 (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))
1110ralrimiv 3109 1 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑁 ∈ (𝐺 NeighbVtx 𝑣))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1542  wcel 2110  wral 3066  cdif 3889  {csn 4567  cfv 6432  (class class class)co 7271  Vtxcvtx 27364   NeighbVtx cnbgr 27697  UnivVtxcuvtx 27750
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pr 5356  ax-un 7582
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ne 2946  df-ral 3071  df-rex 3072  df-rab 3075  df-v 3433  df-sbc 3721  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4846  df-iun 4932  df-br 5080  df-opab 5142  df-mpt 5163  df-id 5490  df-xp 5596  df-rel 5597  df-cnv 5598  df-co 5599  df-dm 5600  df-rn 5601  df-res 5602  df-ima 5603  df-iota 6390  df-fun 6434  df-fv 6440  df-ov 7274  df-oprab 7275  df-mpo 7276  df-1st 7824  df-2nd 7825  df-nbgr 27698  df-uvtx 27751
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator