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

Theorem nbgrssvwo2 29397
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 29396 . . 3 (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋})
3 df-nel 3053 . . . . 5 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋))
4 disjsn 4736 . . . . 5 (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋))
53, 4sylbb2 238 . . . 4 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → ((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅)
6 reldisj 4476 . . . 4 ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})))
75, 6imbitrid 244 . . 3 ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})))
82, 7ax-mp 5 . 2 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀}))
9 prcom 4757 . . . 4 {𝑀, 𝑋} = {𝑋, 𝑀}
109difeq2i 4146 . . 3 (𝑉 ∖ {𝑀, 𝑋}) = (𝑉 ∖ {𝑋, 𝑀})
11 difpr 4828 . . 3 (𝑉 ∖ {𝑋, 𝑀}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀})
1210, 11eqtri 2768 . 2 (𝑉 ∖ {𝑀, 𝑋}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀})
138, 12sseqtrrdi 4060 1 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑀, 𝑋}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1537  wcel 2108  wnel 3052  cdif 3973  cin 3975  wss 3976  c0 4352  {csn 4648  {cpr 4650  cfv 6573  (class class class)co 7448  Vtxcvtx 29031   NeighbVtx cnbgr 29367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-nbgr 29368
This theorem is referenced by:  nbfusgrlevtxm2  29413
  Copyright terms: Public domain W3C validator