|   | 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 2736 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | nbusgreledg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | nbusgr 29367 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 NeighbVtx 𝐾) = {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸}) | 
| 4 | 3 | eleq2d 2826 | . 2 ⊢ (𝐺 ∈ USGraph → (𝑁 ∈ (𝐺 NeighbVtx 𝐾) ↔ 𝑁 ∈ {𝑛 ∈ (Vtx‘𝐺) ∣ {𝐾, 𝑛} ∈ 𝐸})) | 
| 5 | 2, 1 | usgrpredgv 29215 | . . . . . 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 4731 | . . . . 5 ⊢ {𝑁, 𝐾} = {𝐾, 𝑁} | |
| 10 | 9 | eleq1i 2831 | . . . 4 ⊢ ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸) | 
| 11 | 10 | a1i 11 | . . 3 ⊢ (𝐺 ∈ USGraph → ({𝑁, 𝐾} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) | 
| 12 | preq2 4733 | . . . . . 6 ⊢ (𝑛 = 𝑁 → {𝐾, 𝑛} = {𝐾, 𝑁}) | |
| 13 | 12 | eleq1d 2825 | . . . . 5 ⊢ (𝑛 = 𝑁 → ({𝐾, 𝑛} ∈ 𝐸 ↔ {𝐾, 𝑁} ∈ 𝐸)) | 
| 14 | 13 | elrab 3691 | . . . 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 1539 ∈ wcel 2107 {crab 3435 {cpr 4627 ‘cfv 6560 (class class class)co 7432 Vtxcvtx 29014 Edgcedg 29065 USGraphcusgr 29167 NeighbVtx cnbgr 29350 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-int 4946 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-1st 8015 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-1o 8507 df-2o 8508 df-oadd 8511 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-fin 8990 df-dju 9942 df-card 9980 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-nn 12268 df-2 12330 df-n0 12529 df-xnn0 12602 df-z 12616 df-uz 12880 df-fz 13549 df-hash 14371 df-edg 29066 df-upgr 29100 df-umgr 29101 df-usgr 29169 df-nbgr 29351 | 
| This theorem is referenced by: usgrnbcnvfv 29383 nbusgredgeu 29384 edgnbusgreu 29385 nbusgrf1o0 29387 nb3grprlem1 29398 uvtxusgr 29420 iscusgredg 29441 clwwlknlbonbgr1 30059 frgrnbnb 30313 frgrncvvdeqlem2 30320 frgrncvvdeqlem3 30321 frgrncvvdeqlem6 30324 frgrncvvdeqlem9 30327 frgrwopreglem4a 30330 fusgr2wsp2nb 30354 numclwwlk1lem2foa 30374 usgrgrtrirex 47922 | 
| Copyright terms: Public domain | W3C validator |