| 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 29408 | . 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 29619 | . . . 4 ⊢ ((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) |
| 6 | 5 | simpri 490 | . . 3 ⊢ (iEdg‘𝐺) = 𝐸 |
| 7 | 6 | rneqi 5927 | . 2 ⊢ ran (iEdg‘𝐺) = ran 𝐸 |
| 8 | prex 5409 | . . . . . . 7 ⊢ {0, 1} ∈ V | |
| 9 | prex 5409 | . . . . . . 7 ⊢ {1, 2} ∈ V | |
| 10 | 8, 9 | pm3.2i 475 | . . . . . 6 ⊢ ({0, 1} ∈ V ∧ {1, 2} ∈ V) |
| 11 | prex 5409 | . . . . . . 7 ⊢ {2, 0} ∈ V | |
| 12 | prex 5409 | . . . . . . 7 ⊢ {0, 3} ∈ V | |
| 13 | 11, 12 | pm3.2i 475 | . . . . . 6 ⊢ ({2, 0} ∈ V ∧ {0, 3} ∈ V) |
| 14 | 10, 13 | pm3.2i 475 | . . . . 5 ⊢ (({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) |
| 15 | usgrexmpldifpr 29617 | . . . . 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 475 | . . . 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 475 | . . 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 14960 | . . . 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 422 | . . 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 6830 | . . . 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 502 | . . 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 2790 | 1 ⊢ (Edg‘𝐺) = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 Vcvv 3455 ∪ cun 3903 {cpr 4591 〈cop 4595 dom cdm 5661 ran crn 5662 –1-1→wf1 6533 –1-1-onto→wf1o 6535 ‘cfv 6536 (class class class)co 7410 0cc0 11104 1c1 11105 2c2 12299 3c3 12300 4c4 12301 ...cfz 13539 〈“cs4 14885 Vtxcvtx 29355 iEdgciedg 29356 Edgcedg 29406 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11160 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-pre-mulgt0 11181 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9930 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11447 df-neg 11448 df-nn 12238 df-2 12307 df-3 12308 df-n0 12509 df-z 12596 df-uz 12867 df-fz 13540 df-fzo 13688 df-hash 14372 df-word 14556 df-concat 14613 df-s1 14639 df-s2 14890 df-s3 14891 df-s4 14892 df-vtx 29357 df-iedg 29358 df-edg 29407 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |