| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfclnbgr2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the closed neighborhood of a vertex breaking up the subset relationship of an unordered pair. (Contributed by AV, 7-May-2025.) |
| Ref | Expression |
|---|---|
| clnbgrval.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| clnbgrval.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| dfclnbgr2 | ⊢ (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clnbgrval.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | clnbgrval.e | . . 3 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | clnbgrval 49056 | . 2 ⊢ (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒})) |
| 4 | prssg 4774 | . . . . . . 7 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ V) → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒)) | |
| 5 | 4 | elvd 3456 | . . . . . 6 ⊢ (𝑁 ∈ 𝑉 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒)) |
| 6 | 5 | bicomd 226 | . . . . 5 ⊢ (𝑁 ∈ 𝑉 → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))) |
| 7 | 6 | rexbidv 3186 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))) |
| 8 | 7 | rabbidv 3419 | . . 3 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}) |
| 9 | 8 | uneq2d 4166 | . 2 ⊢ (𝑁 ∈ 𝑉 → ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})) |
| 10 | 3, 9 | eqtrd 2795 | 1 ⊢ (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 {crab 3412 Vcvv 3450 ⊆ wss 3896 ∪ cun 4148 {csn 4584 {cpr 4586 ‘cfv 6543 (class class class)co 7424 Vtxcvtx 29583 Edgcedg 29634 ClNeighbVtx cclnbgr 49052 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6497 df-fun 6545 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-clnbgr 49053 |
| This theorem is used by: dfclnbgr4 49058 dfclnbgr5 49084 dfclnbgr6 49090 |
| Copyright terms: Public domain | W3C validator |