| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trlreslem | Structured version Visualization version GIF version | ||
| Description: Lemma for trlres 29785. Formerly part of proof of eupthres 30303. (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 29783 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 4 | 1, 3 | syl 17 | . . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 5 | trlres.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 6 | elfzouz2 13623 | . . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) | |
| 7 | fzoss2 13636 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 8 | 5, 6, 7 | 3syl 18 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 9 | f1ores 6789 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) | |
| 10 | 4, 8, 9 | syl2anc 585 | . 2 ⊢ (𝜑 → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) |
| 11 | trlres.h | . . . 4 ⊢ 𝐻 = (𝐹 prefix 𝑁) | |
| 12 | trliswlk 29782 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 13 | 2 | wlkf 29701 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 14 | 1, 12, 13 | 3syl 18 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 15 | fzossfz 13627 | . . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹)) | |
| 16 | 15, 5 | sselid 3920 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 17 | pfxres 14636 | . . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) | |
| 18 | 14, 16, 17 | syl2anc 585 | . . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) |
| 19 | 11, 18 | eqtrid 2784 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁))) |
| 20 | 11 | fveq2i 6838 | . . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁)) |
| 21 | elfzofz 13624 | . . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹))) | |
| 22 | 5, 21 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 23 | pfxlen 14640 | . . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁) | |
| 24 | 14, 22, 23 | syl2anc 585 | . . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁) |
| 25 | 20, 24 | eqtrid 2784 | . . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
| 26 | 25 | oveq2d 7377 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁)) |
| 27 | wrdf 14474 | . . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 28 | fimass 6683 | . . . . . 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 5973 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) | |
| 32 | 30, 31 | sylib 218 | . . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) |
| 33 | 19, 26, 32 | f1oeq123d 6769 | . 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 1542 ∈ wcel 2114 ⊆ wss 3890 class class class wbr 5086 dom cdm 5625 ↾ cres 5627 “ cima 5628 ⟶wf 6489 –1-1→wf1 6490 –1-1-onto→wf1o 6492 ‘cfv 6493 (class class class)co 7361 0cc0 11032 ℤ≥cuz 12782 ...cfz 13455 ..^cfzo 13602 ♯chash 14286 Word cword 14469 prefix cpfx 14627 Vtxcvtx 29082 iEdgciedg 29083 Walkscwlks 29683 Trailsctrls 29775 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-n0 12432 df-z 12519 df-uz 12783 df-fz 13456 df-fzo 13603 df-hash 14287 df-word 14470 df-substr 14598 df-pfx 14628 df-wlks 29686 df-trls 29777 |
| This theorem is referenced by: trlres 29785 eupthres 30303 |
| Copyright terms: Public domain | W3C validator |