| 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 465 | . . 3 ⊢ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ↔ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) | |
| 2 | necom 3017 | . . 3 ⊢ (𝑁 ≠ 𝐾 ↔ 𝐾 ≠ 𝑁) | |
| 3 | prcom 4703 | . . . . 5 ⊢ {𝐾, 𝑁} = {𝑁, 𝐾} | |
| 4 | 3 | sseq1i 3973 | . . . 4 ⊢ ({𝐾, 𝑁} ⊆ 𝑒 ↔ {𝑁, 𝐾} ⊆ 𝑒) |
| 5 | 4 | rexbii 3118 | . . 3 ⊢ (∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒 ↔ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒) |
| 6 | 1, 2, 5 | 3anbi123i 1171 | . 2 ⊢ (((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁 ≠ 𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾 ≠ 𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)) |
| 7 | eqid 2769 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 8 | eqid 2769 | . . 3 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 9 | 7, 8 | nbgrel 29631 | . 2 ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁 ≠ 𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒)) |
| 10 | 7, 8 | nbgrel 29631 | . 2 ⊢ (𝐾 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾 ≠ 𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)) |
| 11 | 6, 9, 10 | 3bitr4i 306 | 1 ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∧ w3a 1101 ∈ wcel 2149 ≠ wne 2964 ∃wrex 3095 ⊆ wss 3913 {cpr 4596 ‘cfv 6537 (class class class)co 7411 Vtxcvtx 29287 Edgcedg 29338 NeighbVtx cnbgr 29623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-nbgr 29624 |
| This theorem is referenced by: nbusgredgeu0 29659 uvtxnbgrvtx 29684 cplgr3v 29726 frgrncvvdeqlem1 30591 frgrwopreglem4a 30602 numclwwlk1lem2foa 30646 |
| Copyright terms: Public domain | W3C validator |