| 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 2729 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | nbusgreledg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | nbusgr 29252 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸}) |
| 4 | 3 | eleq2d 2814 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸})) |
| 5 | 2, 1 | usgrpredgv 29100 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ {𝐾, 𝑁} ∈ 𝐸) → (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) |
| 6 | 5 | simprd 495 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ {𝐾, 𝑁} ∈ 𝐸) → 𝑁 ∈ (Vtx‘𝐺)) |
| 7 | 6 | ex 412 | . . . 4 ⊢ (𝐺 ∈ USGraph → ({𝐾, 𝑁} ∈ 𝐸 → 𝑁 ∈ (Vtx‘𝐺))) |
| 8 | 7 | pm4.71rd 562 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝐾, 𝑁} ∈ 𝐸 ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸))) |
| 9 | prcom 4692 | . . . . 5 ⊢ {𝑁, 𝐾} = {𝐾, 𝑁} | |
| 10 | 9 | eleq1i 2819 | . . . 4 ⊢ ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸) |
| 11 | 10 | a1i 11 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) |
| 12 | preq2 4694 | . . . . . 6 ⊢ (𝑛 = 𝑁 → {𝐾, 𝑛} = {𝐾, 𝑁}) | |
| 13 | 12 | eleq1d 2813 | . . . . 5 ⊢ (𝑛 = 𝑁 → ({𝐾, 𝑛} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) |
| 14 | 13 | elrab 3656 | . . . 4 ⊢ (𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸)) |
| 15 | 14 | a1i 11 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸))) |
| 16 | 8, 11, 15 | 3bitr4rd 312 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸} ↔ {𝑁, 𝐾} ∈ 𝐸)) |
| 17 | 4, 16 | bitrd 279 | 1 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑁, 𝐾} ∈ 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {crab 3402 {cpr 4587 ‘cfv 6499 (class class class)co 7369 Vtxcvtx 28899 Edgcedg 28950 USGraphcusgr 29052 NeighbVtx cnbgr 29235 |
| 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 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 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-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-oadd 8415 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-dju 9830 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-n0 12419 df-xnn0 12492 df-z 12506 df-uz 12770 df-fz 13445 df-hash 14272 df-edg 28951 df-upgr 28985 df-umgr 28986 df-usgr 29054 df-nbgr 29236 |
| This theorem is referenced by: usgrnbcnvfv 29268 nbusgredgeu 29269 edgnbusgreu 29270 nbusgrf1o0 29272 nb3grprlem1 29283 uvtxusgr 29305 iscusgredg 29326 clwwlknlbonbgr1 29941 frgrnbnb 30195 frgrncvvdeqlem2 30202 frgrncvvdeqlem3 30203 frgrncvvdeqlem6 30206 frgrncvvdeqlem9 30209 frgrwopreglem4a 30212 fusgr2wsp2nb 30236 numclwwlk1lem2foa 30256 usgrgrtrirex 47922 pgnbgreunbgr 48088 pgn4cyclex 48089 |
| Copyright terms: Public domain | W3C validator |