| 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 466 | . . 3 ⊢ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ↔ (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) | |
| 2 | necom 3013 | . . 3 ⊢ (𝑁 ≠ 𝐾 ↔ 𝐾 ≠ 𝑁) | |
| 3 | prcom 4700 | . . . . 5 ⊢ {𝐾, 𝑁} = {𝑁, 𝐾} | |
| 4 | 3 | sseq1i 3966 | . . . 4 ⊢ ({𝐾, 𝑁} ⊆ 𝑒 ↔ {𝑁, 𝐾} ⊆ 𝑒) |
| 5 | 4 | rexbii 3114 | . . 3 ⊢ (∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒 ↔ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒) |
| 6 | 1, 2, 5 | 3anbi123i 1173 | . 2 ⊢ (((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁 ≠ 𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾 ≠ 𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)) |
| 7 | eqid 2765 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 8 | eqid 2765 | . . 3 ⊢ (Edg‘𝐺) = (Edg‘𝐺) | |
| 9 | 7, 8 | nbgrel 29719 | . 2 ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ ((𝑁 ∈ (Vtx‘𝐺) ∧ 𝐾 ∈ (Vtx‘𝐺)) ∧ 𝑁 ≠ 𝐾 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝐾, 𝑁} ⊆ 𝑒)) |
| 10 | 7, 8 | nbgrel 29719 | . 2 ⊢ (𝐾 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺)) ∧ 𝐾 ≠ 𝑁 ∧ ∃𝑒 ∈ (Edg‘𝐺){𝑁, 𝐾} ⊆ 𝑒)) |
| 11 | 6, 9, 10 | 3bitr4i 306 | 1 ⊢ (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝐾 ∈ (𝐺 NeighbVtx 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2146 ≠ wne 2960 ∃wrex 3091 ⊆ wss 3906 {cpr 4593 ‘cfv 6540 (class class class)co 7416 Vtxcvtx 29375 Edgcedg 29426 NeighbVtx cnbgr 29711 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7738 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-nbgr 29712 |
| This theorem is used by: nbusgredgeu0 29747 uvtxnbgrvtx 29772 cplgr3v 29814 frgrncvvdeqlem1 30679 frgrwopreglem4a 30690 numclwwlk1lem2foa 30734 |
| Copyright terms: Public domain | W3C validator |