| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrexmpl | Structured version Visualization version GIF version | ||
| Description: 𝐺 is a simple graph of five vertices 0, 1, 2, 3, 4, with edges {0, 1}, {1, 2}, {2, 0}, {0, 3}. (Contributed by Alexander van der Vekens, 15-Aug-2017.) (Revised by AV, 21-Oct-2020.) (Proof shortened by AV, 7-Aug-2025.) |
| Ref | Expression |
|---|---|
| usgrexmpl.v | ⊢ 𝑉 = (0...4) |
| usgrexmpl.e | ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 |
| usgrexmpl.g | ⊢ 𝐺 = 〈𝑉, 𝐸〉 |
| Ref | Expression |
|---|---|
| usgrexmpl | ⊢ 𝐺 ∈ USGraph |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgrexmpl.v | . . 3 ⊢ 𝑉 = (0...4) | |
| 2 | usgrexmpl.e | . . 3 ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 | |
| 3 | 1, 2 | usgrexmplef 29897 | . 2 ⊢ 𝐸:dom 𝐸⟶1-1{𝑒 ∈ 𝒫 𝑉 ∣ (♯‘𝑒) = 2} |
| 4 | usgrexmpl.g | . . . 4 ⊢ 𝐺 = 〈𝑉, 𝐸〉 | |
| 5 | 4 | eleq1i 2855 | . . 3 ⊢ (𝐺 ∈ USGraph ↔ 〈𝑉, 𝐸〉 ∈ USGraph) |
| 6 | 1 | ovexi 7485 | . . . 4 ⊢ 𝑉 ∈ V |
| 7 | s4cli 15075 | . . . . 5 ⊢ 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 ∈ Word V | |
| 8 | 2, 7 | eqeltri 2860 | . . . 4 ⊢ 𝐸 ∈ Word V |
| 9 | isusgrop 29800 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ Word V) → (〈𝑉, 𝐸〉 ∈ USGraph ↔ 𝐸:dom 𝐸⟶1-1{𝑒 ∈ 𝒫 𝑉 ∣ (♯‘𝑒) = 2})) | |
| 10 | 6, 8, 9 | mp2an 705 | . . 3 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph ↔ 𝐸:dom 𝐸⟶1-1{𝑒 ∈ 𝒫 𝑉 ∣ (♯‘𝑒) = 2}) |
| 11 | 5, 10 | bitri 278 | . 2 ⊢ (𝐺 ∈ USGraph ↔ 𝐸:dom 𝐸⟶1-1{𝑒 ∈ 𝒫 𝑉 ∣ (♯‘𝑒) = 2}) |
| 12 | 3, 11 | mpbir 234 | 1 ⊢ 𝐺 ∈ USGraph |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2147 {crab 3416 Vcvv 3454 𝒫 cpw 4560 {cpr 4590 〈cop 4840 dom cdm 5658 ⟶1-1wf1 6563 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 2c2 12437 3c3 12438 4c4 12439 ...cfz 13679 ♯chash 14515 Word cword 14699 〈“cs4 15036 USGraphcusgr 29787 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 df-s3 15042 df-s4 15043 df-vtx 29633 df-iedg 29634 df-usgr 29789 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |