| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > clnbgr0edg | Structured version Visualization version GIF version | ||
| Description: In an empty graph (with no edges), all closed neighborhoods consists of a single vertex. (Contributed by AV, 10-May-2025.) |
| Ref | Expression |
|---|---|
| clnbgr0edg | ⊢ (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝐾) = {𝐾}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | 1 | dfclnbgr4 49195 | . . 3 ⊢ (𝐾 ∈ (Vtx‘𝐺) → (𝐺 ClNeighbVtx 𝐾) = ({𝐾} ∪ (𝐺 NeighbVtx 𝐾))) |
| 3 | 2 | adantl 487 | . 2 ⊢ (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝐾) = ({𝐾} ∪ (𝐺 NeighbVtx 𝐾))) |
| 4 | nbgr0edg 29995 | . . . 4 ⊢ ((Edg‘𝐺) = ∅ → (𝐺 NeighbVtx 𝐾) = ∅) | |
| 5 | 4 | adantr 486 | . . 3 ⊢ (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 NeighbVtx 𝐾) = ∅) |
| 6 | 5 | uneq2d 4170 | . 2 ⊢ (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → ({𝐾} ∪ (𝐺 NeighbVtx 𝐾)) = ({𝐾} ∪ ∅)) |
| 7 | un0 4347 | . . 3 ⊢ ({𝐾} ∪ ∅) = {𝐾} | |
| 8 | 7 | a1i 11 | . 2 ⊢ (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → ({𝐾} ∪ ∅) = {𝐾}) |
| 9 | 3, 6, 8 | 3eqtrd 2802 | 1 ⊢ (((Edg‘𝐺) = ∅ ∧ 𝐾 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝐾) = {𝐾}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∪ cun 4152 ∅c0 4281 {csn 4588 ‘cfv 6566 (class class class)co 7451 Vtxcvtx 29631 Edgcedg 29682 NeighbVtx cnbgr 29970 ClNeighbVtx cclnbgr 49189 |
| 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 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-nbgr 29971 df-clnbgr 49190 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |