| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trlreslem | Structured version Visualization version GIF version | ||
| Description: Lemma for trlres 29721. Formerly part of proof of eupthres 30239. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 3-May-2015.) (Revised 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 𝑁) |
| Ref | Expression |
|---|---|
| trlreslem | ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | trlres.d | . . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
| 2 | trlres.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | 2 | trlf1 29719 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 4 | 1, 3 | syl 17 | . . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 5 | trlres.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 6 | elfzouz2 13588 | . . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) | |
| 7 | fzoss2 13601 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 8 | 5, 6, 7 | 3syl 18 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 9 | f1ores 6786 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) | |
| 10 | 4, 8, 9 | syl2anc 584 | . 2 ⊢ (𝜑 → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) |
| 11 | trlres.h | . . . 4 ⊢ 𝐻 = (𝐹 prefix 𝑁) | |
| 12 | trliswlk 29718 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 13 | 2 | wlkf 29637 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 14 | 1, 12, 13 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 15 | fzossfz 13592 | . . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹)) | |
| 16 | 15, 5 | sselid 3929 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 17 | pfxres 14601 | . . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) | |
| 18 | 14, 16, 17 | syl2anc 584 | . . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) |
| 19 | 11, 18 | eqtrid 2781 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁))) |
| 20 | 11 | fveq2i 6835 | . . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁)) |
| 21 | elfzofz 13589 | . . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹))) | |
| 22 | 5, 21 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 23 | pfxlen 14605 | . . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁) | |
| 24 | 14, 22, 23 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁) |
| 25 | 20, 24 | eqtrid 2781 | . . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
| 26 | 25 | oveq2d 7372 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁)) |
| 27 | wrdf 14439 | . . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 28 | fimass 6680 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) | |
| 29 | 13, 27, 28 | 3syl 18 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 30 | 1, 12, 29 | 3syl 18 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 31 | ssdmres 5970 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) | |
| 32 | 30, 31 | sylib 218 | . . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) |
| 33 | 19, 26, 32 | f1oeq123d 6766 | . 2 ⊢ (𝜑 → (𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ↔ (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁)))) |
| 34 | 10, 33 | mpbird 257 | 1 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ⊆ wss 3899 class class class wbr 5096 dom cdm 5622 ↾ cres 5624 “ cima 5625 ⟶wf 6486 –1-1→wf1 6487 –1-1-onto→wf1o 6489 ‘cfv 6490 (class class class)co 7356 0cc0 11024 ℤ≥cuz 12749 ...cfz 13421 ..^cfzo 13568 ♯chash 14251 Word cword 14434 prefix cpfx 14592 Vtxcvtx 29018 iEdgciedg 29019 Walkscwlks 29619 Trailsctrls 29711 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8763 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-fz 13422 df-fzo 13569 df-hash 14252 df-word 14435 df-substr 14563 df-pfx 14593 df-wlks 29622 df-trls 29713 |
| This theorem is referenced by: trlres 29721 eupthres 30239 |
| Copyright terms: Public domain | W3C validator |