| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nbgrssvwo2 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| nbgrssovtx.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| nbgrssvwo2 | ⊢ (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑀, 𝑋})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nbgrssovtx.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | nbgrssovtx 29875 | . . 3 ⊢ (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) |
| 3 | df-nel 3062 | . . . . 5 ⊢ (𝑀 ∉ (𝐺 NeighbVtx 𝑋) ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋)) | |
| 4 | disjsn 4671 | . . . . 5 ⊢ (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ ¬ 𝑀 ∈ (𝐺 NeighbVtx 𝑋)) | |
| 5 | 3, 4 | sylbb2 241 | . . . 4 ⊢ (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → ((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅) |
| 6 | reldisj 4405 | . . . 4 ⊢ ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (((𝐺 NeighbVtx 𝑋) ∩ {𝑀}) = ∅ ↔ (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀}))) | |
| 7 | 5, 6 | imbitrid 247 | . . 3 ⊢ ((𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑋}) → (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀}))) |
| 8 | 2, 7 | ax-mp 5 | . 2 ⊢ (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ ((𝑉 ∖ {𝑋}) ∖ {𝑀})) |
| 9 | prcom 4692 | . . . 4 ⊢ {𝑀, 𝑋} = {𝑋, 𝑀} | |
| 10 | 9 | difeq2i 4070 | . . 3 ⊢ (𝑉 ∖ {𝑀, 𝑋}) = (𝑉 ∖ {𝑋, 𝑀}) |
| 11 | difpr 4765 | . . 3 ⊢ (𝑉 ∖ {𝑋, 𝑀}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀}) | |
| 12 | 10, 11 | eqtri 2783 | . 2 ⊢ (𝑉 ∖ {𝑀, 𝑋}) = ((𝑉 ∖ {𝑋}) ∖ {𝑀}) |
| 13 | 8, 12 | sseqtrrdi 3971 | 1 ⊢ (𝑀 ∉ (𝐺 NeighbVtx 𝑋) → (𝐺 NeighbVtx 𝑋) ⊆ (𝑉 ∖ {𝑀, 𝑋})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2145 ∉ wnel 3061 ∖ cdif 3895 ∩ cin 3897 ⊆ wss 3898 ∅c0 4278 {csn 4583 {cpr 4585 ‘cfv 6527 (class class class)co 7408 Vtxcvtx 29507 NeighbVtx cnbgr 29846 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-un 7734 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-nbgr 29847 |
| This theorem is used by: nbfusgrlevtxm2 29892 |
| Copyright terms: Public domain | W3C validator |