| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrexmpledg | Structured version Visualization version GIF version | ||
| Description: The edges {0, 1}, {1, 2}, {2, 0}, {0, 3} of the graph 𝐺 = 〈𝑉, 𝐸〉. (Contributed by AV, 12-Jan-2020.) (Revised by AV, 21-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgrexmpl.v | ⊢ 𝑉 = (0...4) |
| usgrexmpl.e | ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 |
| usgrexmpl.g | ⊢ 𝐺 = 〈𝑉, 𝐸〉 |
| Ref | Expression |
|---|---|
| usgrexmpledg | ⊢ (Edg‘𝐺) = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | edgval 29140 | . 2 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 2 | usgrexmpl.v | . . . . 5 ⊢ 𝑉 = (0...4) | |
| 3 | usgrexmpl.e | . . . . 5 ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 | |
| 4 | usgrexmpl.g | . . . . 5 ⊢ 𝐺 = 〈𝑉, 𝐸〉 | |
| 5 | 2, 3, 4 | usgrexmpllem 29351 | . . . 4 ⊢ ((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) |
| 6 | 5 | simpri 487 | . . 3 ⊢ (iEdg‘𝐺) = 𝐸 |
| 7 | 6 | rneqi 5886 | . 2 ⊢ ran (iEdg‘𝐺) = ran 𝐸 |
| 8 | prex 5370 | . . . . . . 7 ⊢ {0, 1} ∈ V | |
| 9 | prex 5370 | . . . . . . 7 ⊢ {1, 2} ∈ V | |
| 10 | 8, 9 | pm3.2i 472 | . . . . . 6 ⊢ ({0, 1} ∈ V ∧ {1, 2} ∈ V) |
| 11 | prex 5370 | . . . . . . 7 ⊢ {2, 0} ∈ V | |
| 12 | prex 5370 | . . . . . . 7 ⊢ {0, 3} ∈ V | |
| 13 | 11, 12 | pm3.2i 472 | . . . . . 6 ⊢ ({2, 0} ∈ V ∧ {0, 3} ∈ V) |
| 14 | 10, 13 | pm3.2i 472 | . . . . 5 ⊢ (({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) |
| 15 | usgrexmpldifpr 29349 | . . . . 5 ⊢ (({0, 1} ≠ {1, 2} ∧ {0, 1} ≠ {2, 0} ∧ {0, 1} ≠ {0, 3}) ∧ ({1, 2} ≠ {2, 0} ∧ {1, 2} ≠ {0, 3} ∧ {2, 0} ≠ {0, 3})) | |
| 16 | 14, 15 | pm3.2i 472 | . . . 4 ⊢ ((({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) ∧ (({0, 1} ≠ {1, 2} ∧ {0, 1} ≠ {2, 0} ∧ {0, 1} ≠ {0, 3}) ∧ ({1, 2} ≠ {2, 0} ∧ {1, 2} ≠ {0, 3} ∧ {2, 0} ≠ {0, 3}))) |
| 17 | 16, 3 | pm3.2i 472 | . . 3 ⊢ (((({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) ∧ (({0, 1} ≠ {1, 2} ∧ {0, 1} ≠ {2, 0} ∧ {0, 1} ≠ {0, 3}) ∧ ({1, 2} ≠ {2, 0} ∧ {1, 2} ≠ {0, 3} ∧ {2, 0} ≠ {0, 3}))) ∧ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉) |
| 18 | s4f1o 14875 | . . . 4 ⊢ ((({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) → ((({0, 1} ≠ {1, 2} ∧ {0, 1} ≠ {2, 0} ∧ {0, 1} ≠ {0, 3}) ∧ ({1, 2} ≠ {2, 0} ∧ {1, 2} ≠ {0, 3} ∧ {2, 0} ≠ {0, 3})) → (𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 → 𝐸:dom 𝐸–1-1-onto→({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}})))) | |
| 19 | 18 | imp31 419 | . . 3 ⊢ ((((({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) ∧ (({0, 1} ≠ {1, 2} ∧ {0, 1} ≠ {2, 0} ∧ {0, 1} ≠ {0, 3}) ∧ ({1, 2} ≠ {2, 0} ∧ {1, 2} ≠ {0, 3} ∧ {2, 0} ≠ {0, 3}))) ∧ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉) → 𝐸:dom 𝐸–1-1-onto→({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}})) |
| 20 | dff1o5 6780 | . . . 4 ⊢ (𝐸:dom 𝐸–1-1-onto→({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) ↔ (𝐸:dom 𝐸–1-1→({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) ∧ ran 𝐸 = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}))) | |
| 21 | 20 | simprbi 499 | . . 3 ⊢ (𝐸:dom 𝐸–1-1-onto→({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) → ran 𝐸 = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}})) |
| 22 | 17, 19, 21 | mp2b 10 | . 2 ⊢ ran 𝐸 = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) |
| 23 | 1, 7, 22 | 3eqtri 2768 | 1 ⊢ (Edg‘𝐺) = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 Vcvv 3433 ∪ cun 3883 {cpr 4560 〈cop 4564 dom cdm 5621 ran crn 5622 –1-1→wf1 6486 –1-1-onto→wf1o 6488 ‘cfv 6489 (class class class)co 7360 0cc0 11033 1c1 11034 2c2 12231 3c3 12232 4c4 12233 ...cfz 13456 〈“cs4 14800 Vtxcvtx 29087 iEdgciedg 29088 Edgcedg 29138 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-z 12520 df-uz 12784 df-fz 13457 df-fzo 13604 df-hash 14288 df-word 14471 df-concat 14528 df-s1 14554 df-s2 14805 df-s3 14806 df-s4 14807 df-vtx 29089 df-iedg 29090 df-edg 29139 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |