| 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 30045 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 5 | 3, 4 | syl 18 | . . 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 30018 | . 2 ⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄) |
| 12 | 1, 2, 3, 6, 9 | trlreslem 30047 | . . 3 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| 13 | f1of1 6819 | . . 3 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) → 𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
| 14 | df-f1 6541 | . . . 4 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ↔ (𝐻:(0..^(♯‘𝐻))⟶dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ∧ Fun ◡𝐻)) | |
| 15 | 14 | simprbi 502 | . . 3 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) → Fun ◡𝐻) |
| 16 | 12, 13, 15 | 3syl 19 | . 2 ⊢ (𝜑 → Fun ◡𝐻) |
| 17 | istrl 30044 | . 2 ⊢ (𝐻(Trails‘𝑆)𝑄 ↔ (𝐻(Walks‘𝑆)𝑄 ∧ Fun ◡𝐻)) | |
| 18 | 11, 16, 17 | sylanbrc 594 | 1 ⊢ (𝜑 → 𝐻(Trails‘𝑆)𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 class class class wbr 5109 ◡ccnv 5660 dom cdm 5661 ↾ cres 5663 “ cima 5664 Fun wfun 6530 ⟶wf 6532 –1-1→wf1 6533 –1-1-onto→wf1o 6535 ‘cfv 6536 (class class class)co 7410 0cc0 11095 ...cfz 13530 ..^cfzo 13678 ♯chash 14362 prefix cpfx 14704 Vtxcvtx 29346 iEdgciedg 29347 Walkscwlks 29946 Trailsctrls 30038 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-fz 13531 df-fzo 13679 df-hash 14363 df-word 14547 df-substr 14675 df-pfx 14705 df-wlks 29949 df-trls 30040 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |