| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > trlreslem | GIF version | ||
| Description: Lemma for trlres 16372. (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 16370 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 4 | 1, 3 | syl 14 | . . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 5 | trlres.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 6 | elfzouz2 10492 | . . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) | |
| 7 | fzoss2 10504 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 8 | 5, 6, 7 | 3syl 17 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 9 | f1ores 5628 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) | |
| 10 | 4, 8, 9 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) |
| 11 | trlres.h | . . . 4 ⊢ 𝐻 = (𝐹 prefix 𝑁) | |
| 12 | trliswlk 16368 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 13 | 2 | wlkf 16312 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 14 | 1, 12, 13 | 3syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 15 | fzossfz 10496 | . . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹)) | |
| 16 | 15, 5 | sselid 3235 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 17 | pfxres 11366 | . . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) | |
| 18 | 14, 16, 17 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) |
| 19 | 11, 18 | eqtrid 2277 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁))) |
| 20 | 11 | fveq2i 5672 | . . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁)) |
| 21 | elfzofz 10493 | . . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹))) | |
| 22 | 5, 21 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 23 | pfxlen 11370 | . . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁) | |
| 24 | 14, 22, 23 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁) |
| 25 | 20, 24 | eqtrid 2277 | . . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
| 26 | 25 | oveq2d 6065 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁)) |
| 27 | wrdf 11223 | . . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 28 | fimass 5524 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) | |
| 29 | 13, 27, 28 | 3syl 17 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 30 | 1, 12, 29 | 3syl 17 | . . . 4 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼) |
| 31 | ssdmres 5059 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) | |
| 32 | 30, 31 | sylib 122 | . . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) |
| 33 | 19, 26, 32 | f1oeq123d 5607 | . 2 ⊢ (𝜑 → (𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ↔ (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁)))) |
| 34 | 10, 33 | mpbird 167 | 1 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 ⊆ wss 3210 class class class wbr 4108 dom cdm 4748 ↾ cres 4750 “ cima 4751 ⟶wf 5347 –1-1→wf1 5348 –1-1-onto→wf1o 5350 ‘cfv 5351 (class class class)co 6049 0cc0 8123 ℤ≥cuz 9849 ...cfz 10338 ..^cfzo 10472 ♯chash 11133 Word cword 11217 prefix cpfx 11357 Vtxcvtx 15994 iEdgciedg 15995 Walkscwlks 16299 Trailsctrls 16362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8214 ax-resscn 8215 ax-1cn 8216 ax-1re 8217 ax-icn 8218 ax-addcl 8219 ax-addrcl 8220 ax-mulcl 8221 ax-addcom 8223 ax-mulcom 8224 ax-addass 8225 ax-mulass 8226 ax-distr 8227 ax-i2m1 8228 ax-0lt1 8229 ax-1rid 8230 ax-0id 8231 ax-rnegex 8232 ax-cnre 8234 ax-pre-ltirr 8235 ax-pre-ltwlin 8236 ax-pre-lttrn 8237 ax-pre-apti 8238 ax-pre-ltadd 8239 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-ifp 987 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-1o 6646 df-er 6766 df-map 6883 df-en 6975 df-dom 6976 df-fin 6977 df-pnf 8306 df-mnf 8307 df-xr 8308 df-ltxr 8309 df-le 8310 df-sub 8442 df-neg 8443 df-inn 9234 df-2 9292 df-3 9293 df-4 9294 df-5 9295 df-6 9296 df-7 9297 df-8 9298 df-9 9299 df-n0 9493 df-z 9574 df-dec 9706 df-uz 9850 df-fz 10339 df-fzo 10473 df-ihash 11134 df-word 11218 df-substr 11331 df-pfx 11358 df-ndx 13204 df-slot 13205 df-base 13207 df-edgf 15987 df-vtx 15996 df-iedg 15997 df-wlks 16300 df-trls 16363 |
| This theorem is referenced by: trlres 16372 eupthres 16439 |
| Copyright terms: Public domain | W3C validator |