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

Theorem nbgrssvwo2 27632
Description: The neighbors of a vertex 𝑋 form a subset of all vertices except the vertex 𝑋 itself and a class 𝑀 which is not a neighbor of 𝑋. (Contributed by Alexander van der Vekens, 13-Jul-2018.) (Revised by AV, 3-Nov-2020.) (Revised by AV, 12-Feb-2022.)
Hypothesis
Ref Expression
nbgrssovtx.v 𝑉 = (Vtx‘𝐺)
Assertion
Ref Expression
nbgrssvwo2 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑀, 𝑋}))

Proof of Theorem nbgrssvwo2
StepHypRef Expression
1 nbgrssovtx.v . . . 4 𝑉 = (Vtx‘𝐺)
21nbgrssovtx 27631 . . 3 (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋})
3 df-nel 3049 . . . . 5 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋))
4 disjsn 4644 . . . . 5 (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋))
53, 4sylbb2 237 . . . 4 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → ((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅)
6 reldisj 4382 . . . 4 ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})))
75, 6syl5ib 243 . . 3 ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})))
82, 7ax-mp 5 . 2 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀}))
9 prcom 4665 . . . 4 {𝑀, 𝑋} = {𝑋, 𝑀}
109difeq2i 4050 . . 3 (𝑉 ∖ {𝑀, 𝑋}) = (𝑉 ∖ {𝑋, 𝑀})
11 difpr 4733 . . 3 (𝑉 ∖ {𝑋, 𝑀}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀})
1210, 11eqtri 2766 . 2 (𝑉 ∖ {𝑀, 𝑋}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀})
138, 12sseqtrrdi 3968 1 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑀, 𝑋}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1539  wcel 2108  wnel 3048  cdif 3880  cin 3882  wss 3883  c0 4253  {csn 4558  {cpr 4560  cfv 6418  (class class class)co 7255  Vtxcvtx 27269   NeighbVtx cnbgr 27602
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-nbgr 27603
This theorem is referenced by:  nbfusgrlevtxm2  27648
  Copyright terms: Public domain W3C validator