| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trlreslem | Structured version Visualization version GIF version | ||
| Description: Lemma for trlres 29988. Formerly part of proof of eupthres 30506. (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 29986 | . . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 4 | 1, 3 | syl 18 | . . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
| 5 | trlres.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
| 6 | elfzouz2 13702 | . . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) | |
| 7 | fzoss2 13715 | . . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
| 8 | 5, 6, 7 | 3syl 19 | . . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
| 9 | f1ores 6836 | . . 3 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) | |
| 10 | 4, 8, 9 | syl2anc 595 | . 2 ⊢ (𝜑 → (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁))) |
| 11 | trlres.h | . . . 4 ⊢ 𝐻 = (𝐹 prefix 𝑁) | |
| 12 | trliswlk 29985 | . . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 13 | 2 | wlkf 29904 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 14 | 1, 12, 13 | 3syl 19 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 15 | fzossfz 13706 | . . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹)) | |
| 16 | 15, 5 | sselid 3943 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 17 | pfxres 14716 | . . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) | |
| 18 | 14, 16, 17 | syl2anc 595 | . . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁))) |
| 19 | 11, 18 | eqtrid 2816 | . . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁))) |
| 20 | 11 | fveq2i 6885 | . . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁)) |
| 21 | elfzofz 13703 | . . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹))) | |
| 22 | 5, 21 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹))) |
| 23 | pfxlen 14720 | . . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁) | |
| 24 | 14, 22, 23 | syl2anc 595 | . . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁) |
| 25 | 20, 24 | eqtrid 2816 | . . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁) |
| 26 | 25 | oveq2d 7427 | . . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁)) |
| 27 | wrdf 14554 | . . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
| 28 | fimass 6727 | . . . . . 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 6013 | . . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) | |
| 32 | 30, 31 | sylib 221 | . . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁))) |
| 33 | 19, 26, 32 | f1oeq123d 6815 | . 2 ⊢ (𝜑 → (𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) ↔ (𝐹 ↾ (0..^𝑁)):(0..^𝑁)–1-1-onto→(𝐹 “ (0..^𝑁)))) |
| 34 | 10, 33 | mpbird 260 | 1 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 class class class wbr 5113 dom cdm 5662 ↾ cres 5664 “ cima 5665 ⟶wf 6533 –1-1→wf1 6534 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7411 0cc0 11099 ℤ≥cuz 12861 ...cfz 13534 ..^cfzo 13681 ♯chash 14365 Word cword 14549 prefix cpfx 14707 Vtxcvtx 29286 iEdgciedg 29287 Walkscwlks 29886 Trailsctrls 29978 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1077 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-er 8693 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-n0 12504 df-z 12591 df-uz 12862 df-fz 13535 df-fzo 13682 df-hash 14366 df-word 14550 df-substr 14678 df-pfx 14708 df-wlks 29889 df-trls 29980 |
| This theorem is referenced by: trlres 29988 eupthres 30506 |
| Copyright terms: Public domain | W3C validator |