| 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 2760 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | nbusgreledg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | nbusgr 29809 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸}) |
| 4 | 3 | eleq2d 2846 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸})) |
| 5 | 2, 1 | usgrpredgv 29657 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ {𝐾, 𝑁} ∈ 𝐸) → (𝐾 ∈ (Vtx‘𝐺) ∧ 𝑁 ∈ (Vtx‘𝐺))) |
| 6 | 5 | simprd 501 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ {𝐾, 𝑁} ∈ 𝐸) → 𝑁 ∈ (Vtx‘𝐺)) |
| 7 | 6 | ex 418 | . . . 4 ⊢ (𝐺 ∈ USGraph → ({𝐾, 𝑁} ∈ 𝐸 → 𝑁 ∈ (Vtx‘𝐺))) |
| 8 | 7 | pm4.71rd 572 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝐾, 𝑁} ∈ 𝐸 ↔ (𝑁 ∈ (Vtx‘𝐺) ∧ {𝐾, 𝑁} ∈ 𝐸))) |
| 9 | prcom 4693 | . . . . 5 ⊢ {𝑁, 𝐾} = {𝐾, 𝑁} | |
| 10 | 9 | eleq1i 2851 | . . . 4 ⊢ ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸) |
| 11 | 10 | a1i 11 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) |
| 12 | preq2 4695 | . . . . . 6 ⊢ (𝑛 = 𝑁 → {𝐾, 𝑛} = {𝐾, 𝑁}) | |
| 13 | 12 | eleq1d 2845 | . . . . 5 ⊢ (𝑛 = 𝑁 → ({𝐾, 𝑛} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) |
| 14 | 13 | elrab 3645 | . . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3412 {cpr 4586 ‘cfv 6533 (class class class)co 7413 Vtxcvtx 29453 Edgcedg 29504 USGraphcusgr 29609 NeighbVtx cnbgr 29792 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-oadd 8459 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-dju 9906 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-n0 12529 df-xnn0 12602 df-z 12616 df-uz 12888 df-fz 13562 df-hash 14395 df-edg 29505 df-upgr 29539 df-umgr 29540 df-usgr 29611 df-nbgr 29793 |
| This theorem is used by: usgrnbcnvfv 29825 nbusgredgeu 29826 edgnbusgreu 29827 nbusgrf1o0 29829 nb3grprlem1 29840 uvtxusgr 29862 iscusgredg 29883 clwwlknlbonbgr1 30509 frgrnbnb 30773 frgrncvvdeqlem2 30780 frgrncvvdeqlem3 30781 frgrncvvdeqlem6 30784 frgrncvvdeqlem9 30787 frgrwopreglem4a 30790 fusgr2wsp2nb 30814 numclwwlk1lem2foa 30834 usgrgrtrirex 48866 pgnbgreunbgr 49041 pgn4cyclex 49042 |
| Copyright terms: Public domain | W3C validator |