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 27140 | . 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 27348 | . . . 4 ⊢ ((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) |
6 | 5 | simpri 489 | . . 3 ⊢ (iEdg‘𝐺) = 𝐸 |
7 | 6 | rneqi 5806 | . 2 ⊢ ran (iEdg‘𝐺) = ran 𝐸 |
8 | prex 5325 | . . . . . . 7 ⊢ {0, 1} ∈ V | |
9 | prex 5325 | . . . . . . 7 ⊢ {1, 2} ∈ V | |
10 | 8, 9 | pm3.2i 474 | . . . . . 6 ⊢ ({0, 1} ∈ V ∧ {1, 2} ∈ V) |
11 | prex 5325 | . . . . . . 7 ⊢ {2, 0} ∈ V | |
12 | prex 5325 | . . . . . . 7 ⊢ {0, 3} ∈ V | |
13 | 11, 12 | pm3.2i 474 | . . . . . 6 ⊢ ({2, 0} ∈ V ∧ {0, 3} ∈ V) |
14 | 10, 13 | pm3.2i 474 | . . . . 5 ⊢ (({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) |
15 | usgrexmpldifpr 27346 | . . . . 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 474 | . . . 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 474 | . . 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 14483 | . . . 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 421 | . . 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 6670 | . . . 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 500 | . . 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 2769 | 1 ⊢ (Edg‘𝐺) = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ≠ wne 2940 Vcvv 3408 ∪ cun 3864 {cpr 4543 〈cop 4547 dom cdm 5551 ran crn 5552 –1-1→wf1 6377 –1-1-onto→wf1o 6379 ‘cfv 6380 (class class class)co 7213 0cc0 10729 1c1 10730 2c2 11885 3c3 11886 4c4 11887 ...cfz 13095 〈“cs4 14408 Vtxcvtx 27087 iEdgciedg 27088 Edgcedg 27138 |
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 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5179 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-pss 3885 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-tp 4546 df-op 4548 df-uni 4820 df-int 4860 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-tr 5162 df-id 5455 df-eprel 5460 df-po 5468 df-so 5469 df-fr 5509 df-we 5511 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-pred 6160 df-ord 6216 df-on 6217 df-lim 6218 df-suc 6219 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-om 7645 df-1st 7761 df-2nd 7762 df-wrecs 8047 df-recs 8108 df-rdg 8146 df-1o 8202 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-fin 8630 df-card 9555 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-nn 11831 df-2 11893 df-3 11894 df-n0 12091 df-z 12177 df-uz 12439 df-fz 13096 df-fzo 13239 df-hash 13897 df-word 14070 df-concat 14126 df-s1 14153 df-s2 14413 df-s3 14414 df-s4 14415 df-vtx 27089 df-iedg 27090 df-edg 27139 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |