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

Theorem uvtxnbgrvtx 27760
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 27758 . . 3 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
3 eleq1w 2821 . . . . . . 7 (𝑛 = 𝑣 → (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ↔ 𝑣 ∈ (𝐺 NeighbVtx 𝑁)))
43rspcva 3559 . . . . . 6 ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁)) → 𝑣 ∈ (𝐺 NeighbVtx 𝑁))
5 nbgrsym 27730 . . . . . . 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 3102 1 (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})𝑁 ∈ (𝐺 NeighbVtx 𝑣))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  cdif 3884  {csn 4561  cfv 6433  (class class class)co 7275  Vtxcvtx 27366   NeighbVtx cnbgr 27699  UnivVtxcuvtx 27752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-nbgr 27700  df-uvtx 27753
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator