Theorem uvtxnbgrss 29157

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.)

Hypothesis

Ref	Expression
uvtxel.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
uvtxnbgrss	⊢ (𝑁 ∈ (UnivVtx‘𝐺) → (𝑉 ∖ {𝑁}) ⊆ (𝐺 NeighbVtx 𝑁))

Proof of Theorem uvtxnbgrss

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		uvtxel.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	vtxnbuvtx 29156	. 2 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
3		dfss3 3965	. 2 ⊢ ((𝑉 ∖ {𝑁}) ⊆ (𝐺 NeighbVtx 𝑁) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑁})𝑛 ∈ (𝐺 NeighbVtx 𝑁))
4	2, 3	sylibr 233	1 ⊢ (𝑁 ∈ (UnivVtx‘𝐺) → (𝑉 ∖ {𝑁}) ⊆ (𝐺 NeighbVtx 𝑁))

Syntax hints:   → wi 4   = wceq 1533   ∈ wcel 2098  ∀wral 3055   ∖ cdif 3940   ⊆ wss 3943  {csn 4623  ‘cfv 6537  (class class class)co 7405  Vtxcvtx 28764   NeighbVtx cnbgr 29097  UnivVtxcuvtx 29150

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-iota 6489  df-fun 6539  df-fv 6545  df-ov 7408  df-uvtx 29151

This theorem is referenced by:  uvtxnbgr  29165