| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nbgrsym | Structured version Visualization version GIF version | ||
| Description: In a graph, the neighborhood relation is symmetric: a vertex 𝑁 in a graph 𝐺 is a neighbor of a second vertex 𝐾 iff the second vertex 𝐾 is a neighbor of the first vertex 𝑁. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 27-Oct-2020.) (Revised by AV, 12-Feb-2022.) |
| Ref | Expression |
|---|---|
| nbgrsym | ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 460 | . . 3 ⊢ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ↔ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) | |
| 2 | necom 2978 | . . 3 ⊢ (𝑁 ≠ 𝐾 ↔ 𝐾 ≠ 𝑁) | |
| 3 | prcom 4686 | . . . . 5 ⊢ {𝐾, 𝑁} = {𝑁, 𝐾} | |
| 4 | 3 | sseq1i 3966 | . . . 4 ⊢ ({𝐾, 𝑁} ⊆ 𝑒 ↔ {𝑁, 𝐾} ⊆ 𝑒) |
| 5 | 4 | rexbii 3076 | . . 3 ⊢ (∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒 ↔ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒) |
| 6 | 1, 2, 5 | 3anbi123i 1155 | . 2 ⊢ (((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁 ≠ 𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾 ≠ 𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)) |
| 7 | eqid 2729 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 8 | eqid 2729 | . . 3 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 9 | 7, 8 | nbgrel 29303 | . 2 ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁 ≠ 𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒)) |
| 10 | 7, 8 | nbgrel 29303 | . 2 ⊢ (𝐾 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾 ≠ 𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)) |
| 11 | 6, 9, 10 | 3bitr4i 303 | 1 ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2109 ≠ wne 2925 ∃wrex 3053 ⊆ wss 3905 {cpr 4581 ‘cfv 6486 (class class class)co 7353 Vtxcvtx 28959 Edgcedg 29010 NeighbVtx cnbgr 29295 |
| 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 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 ax-un 7675 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fv 6494 df-ov 7356 df-oprab 7357 df-mpo 7358 df-1st 7931 df-2nd 7932 df-nbgr 29296 |
| This theorem is referenced by: nbusgredgeu0 29331 uvtxnbgrvtx 29356 cplgr3v 29398 frgrncvvdeqlem1 30261 frgrwopreglem4a 30272 numclwwlk1lem2foa 30316 |
| Copyright terms: Public domain | W3C validator |