| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrexmpllem | Structured version Visualization version GIF version | ||
| Description: Lemma for usgrexmpl 29724. (Contributed 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 |
|---|---|
| usgrexmpllem | ⊢ ((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgrexmpl.v | . . . 4 ⊢ 𝑉 = (0...4) | |
| 2 | 1 | ovexi 7448 | . . 3 ⊢ 𝑉 ∈ V |
| 3 | usgrexmpl.e | . . . 4 ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 | |
| 4 | s4cli 14954 | . . . . 5 ⊢ 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 ∈ Word V | |
| 5 | 4 | elexi 3472 | . . . 4 ⊢ 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 ∈ V |
| 6 | 3, 5 | eqeltri 2856 | . . 3 ⊢ 𝐸 ∈ V |
| 7 | opvtxfv 29462 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 8 | opiedgfv 29465 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
| 9 | 7, 8 | jca 521 | . . 3 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → ((Vtx‘〈𝑉, 𝐸〉) = 𝑉 ∧ (iEdg‘〈𝑉, 𝐸〉) = 𝐸)) |
| 10 | 2, 6, 9 | mp2an 705 | . 2 ⊢ ((Vtx‘〈𝑉, 𝐸〉) = 𝑉 ∧ (iEdg‘〈𝑉, 𝐸〉) = 𝐸) |
| 11 | usgrexmpl.g | . . . . 5 ⊢ 𝐺 = 〈𝑉, 𝐸〉 | |
| 12 | 11 | fveq2i 6882 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘〈𝑉, 𝐸〉) |
| 13 | 12 | eqeq1i 2765 | . . 3 ⊢ ((Vtx‘𝐺) = 𝑉 ↔ (Vtx‘〈𝑉, 𝐸〉) = 𝑉) |
| 14 | 11 | fveq2i 6882 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘〈𝑉, 𝐸〉) |
| 15 | 14 | eqeq1i 2765 | . . 3 ⊢ ((iEdg‘𝐺) = 𝐸 ↔ (iEdg‘〈𝑉, 𝐸〉) = 𝐸) |
| 16 | 13, 15 | anbi12i 640 | . 2 ⊢ (((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) ↔ ((Vtx‘〈𝑉, 𝐸〉) = 𝑉 ∧ (iEdg‘〈𝑉, 𝐸〉) = 𝐸)) |
| 17 | 10, 16 | mpbir 234 | 1 ⊢ ((Vtx‘𝐺) = 𝑉 ∧ (iEdg‘𝐺) = 𝐸) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2145 Vcvv 3450 {cpr 4586 〈cop 4590 ‘cfv 6533 (class class class)co 7414 0cc0 11125 1c1 11126 2c2 12320 3c3 12321 4c4 12322 ...cfz 13562 Word cword 14579 〈“cs4 14915 Vtxcvtx 29454 iEdgciedg 29455 |
| 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 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-card 9945 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-n0 12530 df-z 12617 df-uz 12889 df-fz 13563 df-fzo 13711 df-hash 14396 df-word 14580 df-concat 14637 df-s1 14664 df-s2 14920 df-s3 14921 df-s4 14922 df-vtx 29456 df-iedg 29457 |
| This theorem is used by: usgrexmplvtx 29722 usgrexmpledg 29723 |
| Copyright terms: Public domain | W3C validator |