| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrexmpllem | Structured version Visualization version GIF version | ||
| Description: Lemma for usgrexmpl 29853. (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 7458 | . . 3 ⊢ 𝑉 ∈ V |
| 3 | usgrexmpl.e | . . . 4 ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 0} {0, 3}”〉 | |
| 4 | s4cli 15041 | . . . . 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 29591 | . . . 4 ⊢ ((𝑉 ∈ V ∧ 𝐸 ∈ V) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 8 | opiedgfv 29594 | . . . 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 6893 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘〈𝑉, 𝐸〉) |
| 13 | 12 | eqeq1i 2765 | . . 3 ⊢ ((Vtx‘𝐺) = 𝑉 ↔ (Vtx‘〈𝑉, 𝐸〉) = 𝑉) |
| 14 | 11 | fveq2i 6893 | . . . 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 1569 ∈ wcel 2144 Vcvv 3450 {cpr 4586 〈cop 4834 ‘cfv 6543 (class class class)co 7424 0cc0 11207 1c1 11208 2c2 12404 3c3 12405 4c4 12406 ...cfz 13646 Word cword 14665 〈“cs4 15002 Vtxcvtx 29583 iEdgciedg 29584 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-n0 12614 df-z 12701 df-uz 12973 df-fz 13647 df-fzo 13796 df-hash 14482 df-word 14666 df-concat 14723 df-s1 14750 df-s2 15007 df-s3 15008 df-s4 15009 df-vtx 29585 df-iedg 29586 |
| This theorem is used by: usgrexmplvtx 29851 usgrexmpledg 29852 |
| Copyright terms: Public domain | W3C validator |