![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wlkf | Structured version Visualization version GIF version |
Description: The mapping enumerating the (indices of the) edges of a walk is a word over the indices of the edges of the graph. (Contributed by AV, 5-Apr-2021.) |
Ref | Expression |
---|---|
wlkf.i | ⊢ 𝐼 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
wlkf | ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2778 | . . 3 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | wlkf.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
3 | 1, 2 | wlkprop 27096 | . 2 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))))) |
4 | 3 | simp1d 1122 | 1 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 if-wif 1043 = wceq 1507 ∈ wcel 2050 ∀wral 3088 ⊆ wss 3829 {csn 4441 {cpr 4443 class class class wbr 4929 dom cdm 5407 ⟶wf 6184 ‘cfv 6188 (class class class)co 6976 0cc0 10335 1c1 10336 + caddc 10338 ...cfz 12708 ..^cfzo 12849 ♯chash 13505 Word cword 13672 Vtxcvtx 26484 iEdgciedg 26485 Walkscwlks 27081 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2750 ax-rep 5049 ax-sep 5060 ax-nul 5067 ax-pow 5119 ax-pr 5186 ax-un 7279 ax-cnex 10391 ax-resscn 10392 ax-1cn 10393 ax-icn 10394 ax-addcl 10395 ax-addrcl 10396 ax-mulcl 10397 ax-mulrcl 10398 ax-mulcom 10399 ax-addass 10400 ax-mulass 10401 ax-distr 10402 ax-i2m1 10403 ax-1ne0 10404 ax-1rid 10405 ax-rnegex 10406 ax-rrecex 10407 ax-cnre 10408 ax-pre-lttri 10409 ax-pre-lttrn 10410 ax-pre-ltadd 10411 ax-pre-mulgt0 10412 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-ifp 1044 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2759 df-cleq 2771 df-clel 2846 df-nfc 2918 df-ne 2968 df-nel 3074 df-ral 3093 df-rex 3094 df-reu 3095 df-rab 3097 df-v 3417 df-sbc 3682 df-csb 3787 df-dif 3832 df-un 3834 df-in 3836 df-ss 3843 df-pss 3845 df-nul 4179 df-if 4351 df-pw 4424 df-sn 4442 df-pr 4444 df-tp 4446 df-op 4448 df-uni 4713 df-int 4750 df-iun 4794 df-br 4930 df-opab 4992 df-mpt 5009 df-tr 5031 df-id 5312 df-eprel 5317 df-po 5326 df-so 5327 df-fr 5366 df-we 5368 df-xp 5413 df-rel 5414 df-cnv 5415 df-co 5416 df-dm 5417 df-rn 5418 df-res 5419 df-ima 5420 df-pred 5986 df-ord 6032 df-on 6033 df-lim 6034 df-suc 6035 df-iota 6152 df-fun 6190 df-fn 6191 df-f 6192 df-f1 6193 df-fo 6194 df-f1o 6195 df-fv 6196 df-riota 6937 df-ov 6979 df-oprab 6980 df-mpo 6981 df-om 7397 df-1st 7501 df-2nd 7502 df-wrecs 7750 df-recs 7812 df-rdg 7850 df-1o 7905 df-er 8089 df-map 8208 df-en 8307 df-dom 8308 df-sdom 8309 df-fin 8310 df-card 9162 df-pnf 10476 df-mnf 10477 df-xr 10478 df-ltxr 10479 df-le 10480 df-sub 10672 df-neg 10673 df-nn 11440 df-n0 11708 df-z 11794 df-uz 12059 df-fz 12709 df-fzo 12850 df-hash 13506 df-word 13673 df-wlks 27084 |
This theorem is referenced by: wlkcl 27100 wksv 27104 iedginwlk 27121 wlk1ewlk 27124 wlkv0 27135 wlkonwlk1l 27147 wlkres 27156 wlkreslemOLD 27157 wlkresOLD 27158 redwlk 27160 wlkp1lem2 27162 wlkp1lem3 27163 wlkp1lem4 27164 wlkp1lem6 27166 wlkp1lem8 27168 wlkp1 27169 lfgriswlk 27176 trlf1 27186 trlreslem 27187 trlreslemOLD 27189 upgr2pthnlp 27221 uhgrwkspthlem1 27242 usgr2wlkspthlem1 27246 crctcshlem2 27304 crctcshlem4 27306 crctcshwlkn0 27307 eupth2eucrct 27747 eucrctshift 27773 eucrct2eupthOLD 27776 eucrct2eupth 27777 |
Copyright terms: Public domain | W3C validator |