| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elclnbgrelnbgr | Structured version Visualization version GIF version | ||
| Description: An element of the closed neighborhood of a vertex which is not the vertex itself is an element of the open neighborhood of the vertex. (Contributed by AV, 24-Sep-2025.) |
| Ref | Expression |
|---|---|
| elclnbgrelnbgr | ⊢ ((𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) ∧ 𝑋 ≠ 𝑁) → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2730 | . . . . . . 7 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | 1 | clnbgrcl 47826 | . . . . . 6 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → 𝑁 ∈ (Vtx‘𝐺)) |
| 3 | 1 | dfclnbgr4 47829 | . . . . . 6 ⊢ (𝑁 ∈ (Vtx‘𝐺) → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ (𝐺 NeighbVtx 𝑁))) |
| 4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ (𝐺 NeighbVtx 𝑁))) |
| 5 | 4 | eleq2d 2815 | . . . 4 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) ↔ 𝑋 ∈ ({𝑁} ∪ (𝐺 NeighbVtx 𝑁)))) |
| 6 | elun 4119 | . . . . 5 ⊢ (𝑋 ∈ ({𝑁} ∪ (𝐺 NeighbVtx 𝑁)) ↔ (𝑋 ∈ {𝑁} ∨ 𝑋 ∈ (𝐺 NeighbVtx 𝑁))) | |
| 7 | elsng 4606 | . . . . . . 7 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ∈ {𝑁} ↔ 𝑋 = 𝑁)) | |
| 8 | eqneqall 2937 | . . . . . . . 8 ⊢ (𝑋 = 𝑁 → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁))) | |
| 9 | 8 | a1i 11 | . . . . . . 7 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 = 𝑁 → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)))) |
| 10 | 7, 9 | sylbid 240 | . . . . . 6 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ∈ {𝑁} → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)))) |
| 11 | ax-1 6 | . . . . . . 7 ⊢ (𝑋 ∈ (𝐺 NeighbVtx 𝑁) → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁))) | |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ∈ (𝐺 NeighbVtx 𝑁) → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)))) |
| 13 | 10, 12 | jaod 859 | . . . . 5 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → ((𝑋 ∈ {𝑁} ∨ 𝑋 ∈ (𝐺 NeighbVtx 𝑁)) → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)))) |
| 14 | 6, 13 | biimtrid 242 | . . . 4 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ∈ ({𝑁} ∪ (𝐺 NeighbVtx 𝑁)) → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)))) |
| 15 | 5, 14 | sylbid 240 | . . 3 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)))) |
| 16 | 15 | pm2.43i 52 | . 2 ⊢ (𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) → (𝑋 ≠ 𝑁 → 𝑋 ∈ (𝐺 NeighbVtx 𝑁))) |
| 17 | 16 | imp 406 | 1 ⊢ ((𝑋 ∈ (𝐺 ClNeighbVtx 𝑁) ∧ 𝑋 ≠ 𝑁) → 𝑋 ∈ (𝐺 NeighbVtx 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∪ cun 3915 {csn 4592 ‘cfv 6514 (class class class)co 7390 Vtxcvtx 28930 NeighbVtx cnbgr 29266 ClNeighbVtx cclnbgr 47823 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-nbgr 29267 df-clnbgr 47824 |
| This theorem is referenced by: isubgr3stgrlem6 47974 |
| Copyright terms: Public domain | W3C validator |