| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trlres | Structured version Visualization version GIF version | ||
| Description: The restriction 〈𝐻, 𝑄〉 of a trail 〈𝐹, 𝑃〉 to an initial segment of the trail (of length 𝑁) forms a trail on the subgraph 𝑆 consisting of the edges in the initial segment. (Contributed by AV, 6-Mar-2021.) Hypothesis revised using the prefix operation. (Revised by AV, 30-Nov-2022.) |
| Ref | Expression |
|---|---|
| trlres.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| trlres.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| trlres.d | ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| trlres.n | ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) |
| trlres.h | ⊢ 𝐻 = (𝐹 prefix 𝑁) |
| trlres.s | ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) |
| trlres.e | ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| trlres.q | ⊢ 𝑄 = (𝑃 ↾ (0...𝑁)) |
| Ref | Expression |
|---|---|
| trlres | ⊢ (𝜑 → 𝐻(Trails‘𝑆)𝑄) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | trlres.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | trlres.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | trlres.d | . . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
| 4 | trliswlk 29893 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃) |
| 6 | trlres.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 7 | trlres.s | . . 3 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) | |
| 8 | trlres.e | . . 3 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
| 9 | trlres.h | . . 3 ⊢ 𝐻 = (𝐹 prefix 𝑁) | |
| 10 | trlres.q | . . 3 ⊢ 𝑄 = (𝑃 ↾ (0...𝑁)) | |
| 11 | 1, 2, 5, 6, 7, 8, 9, 10 | wlkres 29866 | . 2 ⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄) |
| 12 | 1, 2, 3, 6, 9 | trlreslem 29895 | . . 3 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| 13 | f1of1 6805 | . . 3 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) → 𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
| 14 | df-f1 6526 | . . . 4 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ↔ (𝐻:(0..^(♯‘𝐻))⟶dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ∧ Fun ◡𝐻)) | |
| 15 | 14 | simprbi 501 | . . 3 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) → Fun ◡𝐻) |
| 16 | 12, 13, 15 | 3syl 18 | . 2 ⊢ (𝜑 → Fun ◡𝐻) |
| 17 | istrl 29892 | . 2 ⊢ (𝐻(Trails‘𝑆)𝑄 ↔ (𝐻(Walks‘𝑆)𝑄 ∧ Fun ◡𝐻)) | |
| 18 | 11, 16, 17 | sylanbrc 592 | 1 ⊢ (𝜑 → 𝐻(Trails‘𝑆)𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1560 ∈ wcel 2142 class class class wbr 5100 ◡ccnv 5646 dom cdm 5647 ↾ cres 5649 “ cima 5650 Fun wfun 6515 ⟶wf 6517 –1-1→wf1 6518 –1-1-onto→wf1o 6520 ‘cfv 6521 (class class class)co 7396 0cc0 11073 ...cfz 13512 ..^cfzo 13659 ♯chash 14343 prefix cpfx 14684 Vtxcvtx 29194 iEdgciedg 29195 Walkscwlks 29794 Trailsctrls 29886 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ifp 1075 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-map 8810 df-pm 8811 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-n0 12482 df-z 12569 df-uz 12840 df-fz 13513 df-fzo 13660 df-hash 14344 df-word 14527 df-substr 14655 df-pfx 14685 df-wlks 29797 df-trls 29888 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |