| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trlreslem | Structured version Visualization version GIF version | ||
| Description: Lemma for trlres 30340. Formerly part of proof of eupthres 30873. (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-1ontodom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | trlres.d | . . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
| 2 | trlres.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | 2 | trlf1 30338 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼) |
| 4 | 1, 3 | syl 18 | . . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼) |
| 5 | trlres.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 6 | elfzouz2 13849 | . . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) | |
| 7 | fzoss2 13862 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 8 | 5, 6, 7 | 3syl 19 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 9 | f1ores 6869 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))⟶1-1dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)⟶1-1onto(𝐹 “ (0..^𝑁))) | |
| 10 | 4, 8, 9 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)⟶1-1onto(𝐹 “ (0..^𝑁))) |
| 11 | trlres.h | . . . 4 ⊢ 𝐻 = (𝐹 prefix 𝑁) | |
| 12 | trliswlk 30337 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 13 | 2 | wlkf 30252 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 14 | 1, 12, 13 | 3syl 19 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 15 | fzossfz 13853 | . . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹)) | |
| 16 | 15, 5 | sselid 3911 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 17 | pfxres 14871 | . . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) | |
| 18 | 14, 16, 17 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) |
| 19 | 11, 18 | eqtrid 2810 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁))) |
| 20 | 11 | fveq2i 6919 | . . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁)) |
| 21 | elfzofz 13850 | . . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹))) | |
| 22 | 5, 21 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 23 | pfxlen 14875 | . . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁) | |
| 24 | 14, 22, 23 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁) |
| 25 | 20, 24 | eqtrid 2810 | . . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
| 26 | 25 | oveq2d 7467 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁)) |
| 27 | wrdf 14704 | . . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 28 | fimass 6760 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) | |
| 29 | 13, 27, 28 | 3syl 19 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 30 | 1, 12, 29 | 3syl 19 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 31 | ssdmres 6021 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) | |
| 32 | 30, 31 | sylib 221 | . . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) |
| 33 | 19, 26, 32 | f1oeq123d 6848 | . 2 ⊢ (𝜑 → (𝐻:(0..^(♯‘𝐻))⟶1-1ontodom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ↔ (𝐹 ↾ (0..^𝑁)):(0..^𝑁)⟶1-1onto(𝐹 “ (0..^𝑁)))) |
| 34 | 10, 33 | mpbird 260 | 1 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))⟶1-1ontodom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 class class class wbr 5108 dom cdm 5658 ↾ cres 5660 “ cima 5661 ⟶wf 6562 ⟶1-1wf1 6563 ⟶1-1ontowf1o 6565 ‘cfv 6566 (class class class)co 7451 0cc0 11239 ℤ≥cuz 13005 ...cfz 13679 ..^cfzo 13828 ♯chash 14515 Word cword 14699 prefix cpfx 14862 Vtxcvtx 29631 iEdgciedg 29632 Walkscwlks 30234 Trailsctrls 30330 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-substr 14831 df-pfx 14863 df-wlks 30237 df-trls 30332 |
| This theorem is used by: trlres 30340 eupthres 30873 |
| Copyright terms: Public domain | W3C validator |