| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > vopnbgrelself | Structured version Visualization version GIF version | ||
| Description: A vertex 𝑁 is a member of its semiopen neighborhood iff there is a loop joining the vertex with itself. (Contributed by AV, 16-May-2025.) |
| Ref | Expression |
|---|---|
| dfvopnbgr2.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| dfvopnbgr2.e | ⊢ 𝐸 = (Edg‘𝐺) |
| dfvopnbgr2.u | ⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))} |
| Ref | Expression |
|---|---|
| vopnbgrelself | ⊢ (𝑁 ∈ 𝑉 → (𝑁 ∈ 𝑈 ↔ ∃𝑒 ∈ 𝐸 𝑒 = {𝑁})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ibar 538 | . 2 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁})) ↔ (𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁}))))) | |
| 2 | eqid 2762 | . . . . . . 7 ⊢ 𝑁 = 𝑁 | |
| 3 | 2 | jctl 533 | . . . . . 6 ⊢ (𝑒 = {𝑁} → (𝑁 = 𝑁 ∧ 𝑒 = {𝑁})) |
| 4 | 3 | olcd 888 | . . . . 5 ⊢ (𝑒 = {𝑁} → ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁}))) |
| 5 | eqneqall 2968 | . . . . . . . 8 ⊢ (𝑁 = 𝑁 → (𝑁 ≠ 𝑁 → ((𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) → 𝑒 = {𝑁}))) | |
| 6 | 2, 5 | ax-mp 5 | . . . . . . 7 ⊢ (𝑁 ≠ 𝑁 → ((𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) → 𝑒 = {𝑁})) |
| 7 | 6 | 3impib 1134 | . . . . . 6 ⊢ ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) → 𝑒 = {𝑁}) |
| 8 | simpr 490 | . . . . . 6 ⊢ ((𝑁 = 𝑁 ∧ 𝑒 = {𝑁}) → 𝑒 = {𝑁}) | |
| 9 | 7, 8 | jaoi 871 | . . . . 5 ⊢ (((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁})) → 𝑒 = {𝑁}) |
| 10 | 4, 9 | impbii 212 | . . . 4 ⊢ (𝑒 = {𝑁} ↔ ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁}))) |
| 11 | 10 | a1i 11 | . . 3 ⊢ (𝑁 ∈ 𝑉 → (𝑒 = {𝑁} ↔ ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁})))) |
| 12 | 11 | rexbidv 3188 | . 2 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 𝑒 = {𝑁} ↔ ∃𝑒 ∈ 𝐸 ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁})))) |
| 13 | dfvopnbgr2.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 14 | dfvopnbgr2.e | . . 3 ⊢ 𝐸 = (Edg‘𝐺) | |
| 15 | dfvopnbgr2.u | . . 3 ⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))} | |
| 16 | 13, 14, 15 | vopnbgrel 48772 | . 2 ⊢ (𝑁 ∈ 𝑉 → (𝑁 ∈ 𝑈 ↔ (𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑁 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑁 ∈ 𝑒) ∨ (𝑁 = 𝑁 ∧ 𝑒 = {𝑁}))))) |
| 17 | 1, 12, 16 | 3bitr4rd 315 | 1 ⊢ (𝑁 ∈ 𝑉 → (𝑁 ∈ 𝑈 ↔ ∃𝑒 ∈ 𝐸 𝑒 = {𝑁})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∃wrex 3088 {crab 3414 {csn 4587 ‘cfv 6537 (class class class)co 7416 Vtxcvtx 29454 Edgcedg 29505 NeighbVtx cnbgr 29793 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7739 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-nbgr 29794 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |