Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nbusgrf1o1 | Structured version Visualization version GIF version |
Description: The set of neighbors of a vertex is isomorphic to the set of edges containing the vertex in a simple graph. (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 28-Oct-2020.) |
Ref | Expression |
---|---|
nbusgrf1o1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
nbusgrf1o1.e | ⊢ 𝐸 = (Edg‘𝐺) |
nbusgrf1o1.n | ⊢ 𝑁 = (𝐺 NeighbVtx 𝑈) |
nbusgrf1o1.i | ⊢ 𝐼 = {𝑒 ∈ 𝐸 ∣ 𝑈 ∈ 𝑒} |
Ref | Expression |
---|---|
nbusgrf1o1 | ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ∃𝑓 𝑓:𝑁–1-1-onto→𝐼) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nbusgrf1o1.n | . . . 4 ⊢ 𝑁 = (𝐺 NeighbVtx 𝑈) | |
2 | 1 | ovexi 7171 | . . 3 ⊢ 𝑁 ∈ V |
3 | mptexg 6965 | . . 3 ⊢ (𝑁 ∈ V → (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}) ∈ V) | |
4 | 2, 3 | mp1i 13 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}) ∈ V) |
5 | nbusgrf1o1.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
6 | nbusgrf1o1.e | . . 3 ⊢ 𝐸 = (Edg‘𝐺) | |
7 | nbusgrf1o1.i | . . 3 ⊢ 𝐼 = {𝑒 ∈ 𝐸 ∣ 𝑈 ∈ 𝑒} | |
8 | eqid 2820 | . . 3 ⊢ (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}) = (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}) | |
9 | 5, 6, 1, 7, 8 | nbusgrf1o0 27132 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}):𝑁–1-1-onto→𝐼) |
10 | f1oeq1 6585 | . 2 ⊢ (𝑓 = (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}) → (𝑓:𝑁–1-1-onto→𝐼 ↔ (𝑛 ∈ 𝑁 ↦ {𝑈, 𝑛}):𝑁–1-1-onto→𝐼)) | |
11 | 4, 9, 10 | spcedv 3586 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ∃𝑓 𝑓:𝑁–1-1-onto→𝐼) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∃wex 1780 ∈ wcel 2114 {crab 3137 Vcvv 3481 {cpr 4550 ↦ cmpt 5127 –1-1-onto→wf1o 6335 ‘cfv 6336 (class class class)co 7137 Vtxcvtx 26762 Edgcedg 26813 USGraphcusgr 26915 NeighbVtx cnbgr 27095 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2792 ax-rep 5171 ax-sep 5184 ax-nul 5191 ax-pow 5247 ax-pr 5311 ax-un 7442 ax-cnex 10574 ax-resscn 10575 ax-1cn 10576 ax-icn 10577 ax-addcl 10578 ax-addrcl 10579 ax-mulcl 10580 ax-mulrcl 10581 ax-mulcom 10582 ax-addass 10583 ax-mulass 10584 ax-distr 10585 ax-i2m1 10586 ax-1ne0 10587 ax-1rid 10588 ax-rnegex 10589 ax-rrecex 10590 ax-cnre 10591 ax-pre-lttri 10592 ax-pre-lttrn 10593 ax-pre-ltadd 10594 ax-pre-mulgt0 10595 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2891 df-nfc 2959 df-ne 3012 df-nel 3119 df-ral 3138 df-rex 3139 df-reu 3140 df-rmo 3141 df-rab 3142 df-v 3483 df-sbc 3759 df-csb 3867 df-dif 3922 df-un 3924 df-in 3926 df-ss 3935 df-pss 3937 df-nul 4275 df-if 4449 df-pw 4522 df-sn 4549 df-pr 4551 df-tp 4553 df-op 4555 df-uni 4820 df-int 4858 df-iun 4902 df-br 5048 df-opab 5110 df-mpt 5128 df-tr 5154 df-id 5441 df-eprel 5446 df-po 5455 df-so 5456 df-fr 5495 df-we 5497 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-riota 7095 df-ov 7140 df-oprab 7141 df-mpo 7142 df-om 7562 df-1st 7670 df-2nd 7671 df-wrecs 7928 df-recs 7989 df-rdg 8027 df-1o 8083 df-2o 8084 df-oadd 8087 df-er 8270 df-en 8491 df-dom 8492 df-sdom 8493 df-fin 8494 df-dju 9311 df-card 9349 df-pnf 10658 df-mnf 10659 df-xr 10660 df-ltxr 10661 df-le 10662 df-sub 10853 df-neg 10854 df-nn 11620 df-2 11682 df-n0 11880 df-xnn0 11950 df-z 11964 df-uz 12226 df-fz 12878 df-hash 13676 df-edg 26814 df-upgr 26848 df-umgr 26849 df-uspgr 26916 df-usgr 26917 df-nbgr 27096 |
This theorem is referenced by: nbusgrf1o 27134 |
Copyright terms: Public domain | W3C validator |