| 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 29546 | . 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 29760 | . . . 4 ⊢ ((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) |
| 6 | 5 | simpri 491 | . . 3 ⊢ (iEdg‘𝐺) = 𝐸 |
| 7 | 6 | rneqi 5916 | . 2 ⊢ ran (iEdg‘𝐺) = ran 𝐸 |
| 8 | prex 5396 | . . . . . . 7 ⊢ {0, 1} ∈ V | |
| 9 | prex 5396 | . . . . . . 7 ⊢ {1, 2} ∈ V | |
| 10 | 8, 9 | pm3.2i 476 | . . . . . 6 ⊢ ({0, 1} ∈ V ∧ {1, 2} ∈ V) |
| 11 | prex 5396 | . . . . . . 7 ⊢ {2, 0} ∈ V | |
| 12 | prex 5396 | . . . . . . 7 ⊢ {0, 3} ∈ V | |
| 13 | 11, 12 | pm3.2i 476 | . . . . . 6 ⊢ ({2, 0} ∈ V ∧ {0, 3} ∈ V) |
| 14 | 10, 13 | pm3.2i 476 | . . . . 5 ⊢ (({0, 1} ∈ V ∧ {1, 2} ∈ V) ∧ ({2, 0} ∈ V ∧ {0, 3} ∈ V)) |
| 15 | usgrexmpldifpr 29758 | . . . . 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 476 | . . . 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 476 | . . 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 15022 | . . . 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 423 | . . 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 6823 | . . . 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 503 | . . 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 2787 | 1 ⊢ (Edg‘𝐺) = ({{0, 1}, {1, 2}} ∪ {{2, 0}, {0, 3}}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 Vcvv 3450 ∪ cun 3897 {cpr 4586 〈cop 4590 dom cdm 5648 ran crn 5649 –1-1→wf1 6525 –1-1-onto→wf1o 6527 ‘cfv 6528 (class class class)co 7409 0cc0 11157 1c1 11158 2c2 12352 3c3 12353 4c4 12354 ...cfz 13594 〈“cs4 14947 Vtxcvtx 29493 iEdgciedg 29494 Edgcedg 29544 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-card 9977 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-2 12360 df-3 12361 df-n0 12562 df-z 12649 df-uz 12921 df-fz 13595 df-fzo 13743 df-hash 14428 df-word 14612 df-concat 14669 df-s1 14696 df-s2 14952 df-s3 14953 df-s4 14954 df-vtx 29495 df-iedg 29496 df-edg 29545 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |