| 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 29840 | . . . 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 29813 | . 2 ⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄) |
| 12 | 1, 2, 3, 6, 9 | trlreslem 29842 | . . 3 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| 13 | f1of1 6799 | . . 3 ⊢ (𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) → 𝐻:(0..^(♯‘𝐻))–1-1→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
| 14 | df-f1 6520 | . . . 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 29839 | . 2 ⊢ (𝐻(Trails‘𝑆)𝑄 ↔ (𝐻(Walks‘𝑆)𝑄 ∧ Fun ◡𝐻)) | |
| 18 | 11, 16, 17 | sylanbrc 592 | 1 ⊢ (𝜑 → 𝐻(Trails‘𝑆)𝑄) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 class class class wbr 5099 ◡ccnv 5644 dom cdm 5645 ↾ cres 5647 “ cima 5648 Fun wfun 6509 ⟶wf 6511 –1-1→wf1 6512 –1-1-onto→wf1o 6514 ‘cfv 6515 (class class class)co 7390 0cc0 11068 ...cfz 13507 ..^cfzo 13654 ♯chash 14338 prefix cpfx 14679 Vtxcvtx 29141 iEdgciedg 29142 Walkscwlks 29741 Trailsctrls 29833 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ifp 1074 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 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 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-er 8671 df-map 8803 df-pm 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9892 df-pnf 11213 df-mnf 11214 df-xr 11215 df-ltxr 11216 df-le 11217 df-sub 11411 df-neg 11412 df-nn 12206 df-n0 12477 df-z 12564 df-uz 12835 df-fz 13508 df-fzo 13655 df-hash 14339 df-word 14522 df-substr 14650 df-pfx 14680 df-wlks 29744 df-trls 29835 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |