| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nbusgreledg | Structured version Visualization version GIF version | ||
| Description: A class/vertex is a neighbor of another class/vertex in a simple graph iff the vertices are endpoints of an edge. (Contributed by Alexander van der Vekens, 11-Oct-2017.) (Revised by AV, 26-Oct-2020.) |
| Ref | Expression |
|---|---|
| nbusgreledg.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| nbusgreledg | ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | nbusgreledg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | nbusgr 29680 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸}) |
| 4 | 3 | eleq2d 2849 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸})) |
| 5 | 2, 1 | usgrpredgv 29528 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ {𝐾, 𝑁} ∈ 𝐸) → (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) |
| 6 | 5 | simprd 500 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ {𝐾, 𝑁} ∈ 𝐸) → 𝑁 ∈ (Vtx‘𝐺)) |
| 7 | 6 | ex 417 | . . . 4 ⊢ (𝐺 ∈ USGraph → ({𝐾, 𝑁} ∈ 𝐸 → 𝑁 ∈ (Vtx‘𝐺))) |
| 8 | 7 | pm4.71rd 571 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝐾, 𝑁} ∈ 𝐸 ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸))) |
| 9 | prcom 4699 | . . . . 5 ⊢ {𝑁, 𝐾} = {𝐾, 𝑁} | |
| 10 | 9 | eleq1i 2854 | . . . 4 ⊢ ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸) |
| 11 | 10 | a1i 11 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) |
| 12 | preq2 4701 | . . . . . 6 ⊢ (𝑛 = 𝑁 → {𝐾, 𝑛} = {𝐾, 𝑁}) | |
| 13 | 12 | eleq1d 2848 | . . . . 5 ⊢ (𝑛 = 𝑁 → ({𝐾, 𝑛} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) |
| 14 | 13 | elrab 3651 | . . . 4 ⊢ (𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸)) |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸))) |
| 16 | 8, 11, 15 | 3bitr4rd 315 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ {𝑁, 𝐾} ∈ 𝐸)) |
| 17 | 4, 16 | bitrd 282 | 1 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 {crab 3416 {cpr 4592 ‘cfv 6538 (class class class)co 7412 Vtxcvtx 29327 Edgcedg 29378 USGraphcusgr 29480 NeighbVtx cnbgr 29663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 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-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-2o 8455 df-oadd 8458 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-dju 9888 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-n0 12506 df-xnn0 12579 df-z 12593 df-uz 12864 df-fz 13537 df-hash 14369 df-edg 29379 df-upgr 29413 df-umgr 29414 df-usgr 29482 df-nbgr 29664 |
| This theorem is referenced by: usgrnbcnvfv 29696 nbusgredgeu 29697 edgnbusgreu 29698 nbusgrf1o0 29700 nb3grprlem1 29711 uvtxusgr 29733 iscusgredg 29754 clwwlknlbonbgr1 30371 frgrnbnb 30625 frgrncvvdeqlem2 30632 frgrncvvdeqlem3 30633 frgrncvvdeqlem6 30636 frgrncvvdeqlem9 30639 frgrwopreglem4a 30642 fusgr2wsp2nb 30666 numclwwlk1lem2foa 30686 usgrgrtrirex 48698 pgnbgreunbgr 48873 pgn4cyclex 48874 |
| Copyright terms: Public domain | W3C validator |