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

Theorem nbgrssvwo2 29970
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 29969 . . 3 (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋})
3 df-nel 3066 . . . . 5 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋))
4 disjsn 4672 . . . . 5 (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋))
53, 4sylbb2 241 . . . 4 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → ((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅)
6 reldisj 4409 . . . 4 ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})))
75, 6imbitrid 247 . . 3 ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})))
82, 7ax-mp 5 . 2 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀}))
9 prcom 4693 . . . 4 {𝑀, 𝑋} = {𝑋, 𝑀}
109difeq2i 4063 . . 3 (𝑉 ∖ {𝑀, 𝑋}) = (𝑉 ∖ {𝑋, 𝑀})
11 difpr 4766 . . 3 (𝑉 ∖ {𝑋, 𝑀}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀})
1210, 11eqtri 2786 . 2 (𝑉 ∖ {𝑀, 𝑋}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀})
138, 12sseqtrrdi 3954 1 (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑀, 𝑋}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2147   ∉ wnel 3065   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  {csn 4588  {cpr 4590  ‘cfv 6555  (class class class)co 7440  Vtxcvtx 29601   NeighbVtx cnbgr 29940
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-nbgr 29941
This theorem is used by:  nbfusgrlevtxm2  29986
  Copyright terms: Public domain W3C validator