| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > predgclnbgrel | Structured version Visualization version GIF version | ||
| Description: If a (not necessarily proper) unordered pair containing a vertex is an edge, the other vertex is in the closed neighborhood of the first vertex. (Contributed by AV, 23-Aug-2025.) |
| Ref | Expression |
|---|---|
| predgclnbgrel.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| predgclnbgrel.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| predgclnbgrel | ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → 𝑁 ∈ (𝐺 ClNeighbVtx 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3simpa 1166 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → (𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉)) | |
| 2 | simp3 1156 | . . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → {𝑋, 𝑁} ∈ 𝐸) | |
| 3 | sseq2 3957 | . . . . 5 ⊢ (𝑒 = {𝑋, 𝑁} → ({𝑋, 𝑁} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ {𝑋, 𝑁})) | |
| 4 | 3 | adantl 487 | . . . 4 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) ∧ 𝑒 = {𝑋, 𝑁}) → ({𝑋, 𝑁} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ {𝑋, 𝑁})) |
| 5 | ssidd 3954 | . . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → {𝑋, 𝑁} ⊆ {𝑋, 𝑁}) | |
| 6 | 2, 4, 5 | rspcedvd 3578 | . . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒) |
| 7 | 6 | olcd 888 | . 2 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → (𝑁 = 𝑋 ∨ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)) |
| 8 | predgclnbgrel.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 9 | predgclnbgrel.e | . . 3 ⊢ 𝐸 = (Edg‘𝐺) | |
| 10 | 8, 9 | clnbgrel 48744 | . 2 ⊢ (𝑁 ∈ (𝐺 ClNeighbVtx 𝑋) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ (𝑁 = 𝑋 ∨ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))) |
| 11 | 1, 7, 10 | sylanbrc 595 | 1 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → 𝑁 ∈ (𝐺 ClNeighbVtx 𝑋)) |
| 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 ∃wrex 3086 ⊆ wss 3899 {cpr 4586 ‘cfv 6533 (class class class)co 7413 Vtxcvtx 29453 Edgcedg 29504 ClNeighbVtx cclnbgr 48734 |
| 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 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| 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-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-clnbgr 48735 |
| This theorem is used by: grlimgredgex 48916 grlimgrtri 48919 |
| Copyright terms: Public domain | W3C validator |