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

Theorem uvtxnbgrvtx 29974
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 29972 . . 3 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
3 eleq1w 2844 . . . . . . 7 (𝑛 = 𝑣 → (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑣 ∈ (𝐺 NeighbVtx 𝑁)))
43rspcva 3575 . . . . . 6 ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → 𝑣 ∈ (𝐺 NeighbVtx 𝑁))
5 nbgrsym 29944 . . . . . . 7 (𝑣 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑁 ∈ (𝐺 NeighbVtx 𝑣))
65a1i 11 . . . . . 6 (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))
74, 6syl5ibcom 248 . . . . 5 ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → (𝑁 ∈ (UnivVtx‘𝐺) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))
87expcom 419 . . . 4 (∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → (𝑁 ∈ (UnivVtx‘𝐺) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣))))
98com23 87 . . 3 (∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁) → (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣))))
102, 9mpcom 39 . 2 (𝑁 ∈ (UnivVtx‘𝐺) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑁 ∈ (𝐺 NeighbVtx 𝑣)))
1110ralrimiv 3154 1 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑁 ∈ (𝐺 NeighbVtx 𝑣))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∖ cdif 3896  {csn 4584  ‘cfv 6538  (class class class)co 7420  Vtxcvtx 29574   NeighbVtx cnbgr 29913  UnivVtxcuvtx 29966
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-nbgr 29914  df-uvtx 29967
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator