trlreslem - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > trlreslem		GIF version

Theorem trlreslem 16513

Description: Lemma for trlres 16514. (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.)

**Hypotheses**
Ref	Expression
trlres.v	⊢ 𝑉 = (Vtx‘𝐺)
trlres.i	⊢ 𝐼 = (iEdg‘𝐺)
trlres.d	⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃)
trlres.n	⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
trlres.h	⊢ 𝐻 = (𝐹 prefix 𝑁)

**Assertion**
Ref	Expression
trlreslem	⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))–1-1-onto→dom (𝐼 ↾ (𝐹 “ (0..^𝑁))))

**Proof of Theorem trlreslem**
Step	Hyp	Ref	Expression
1		trlres.d	. . . 4 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃)
2		trlres.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
3	2	trlf1 16512	. . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼)
4	1, 3	syl 14	. . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼)
5		trlres.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
6		elfzouz2 10521	. . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ_≥‘𝑁))
7		fzoss2 10533	. . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ_≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
8	5, 6, 7	3syl 17	. . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
9		f1ores 5634	. . 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 16510	. . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃)
13	2	wlkf 16454	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼)
14	1, 12, 13	3syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼)
15		fzossfz 10525	. . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹))
16	15, 5	sselid 3240	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹)))
17		pfxres 11401	. . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁)))
18	14, 16, 17	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁)))
19	11, 18	eqtrid 2279	. . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁)))
20	11	fveq2i 5678	. . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁))
21		elfzofz 10522	. . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹)))
22	5, 21	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹)))
23		pfxlen 11405	. . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁)
24	14, 22, 23	syl2anc 411	. . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁)
25	20, 24	eqtrid 2279	. . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁)
26	25	oveq2d 6074	. . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁))
27		wrdf 11258	. . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
28		fimass 5530	. . . . . 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 5065	. . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁)))
32	30, 31	sylib 122	. . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁)))
33	19, 26, 32	f1oeq123d 5613	. 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 2205 ⊆ wss 3214 class class class wbr 4114 dom cdm 4754 ↾ cres 4756 “ cima 4757 ⟶wf 5353 –1-1→wf1 5354 –1-1-onto→wf1o 5356 ‘cfv 5357 (class class class)co 6058 0cc0 8143 ℤ_≥cuz 9874 ...cfz 10364 ..^cfzo 10501 ♯chash 11166 Word cword 11252 prefix cpfx 11392 Vtxcvtx 16136 iEdgciedg 16137 Walkscwlks 16441 Trailsctrls 16504

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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259

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 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3625 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-1o 6660 df-er 6780 df-map 6897 df-en 6989 df-dom 6990 df-fin 6991 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-inn 9258 df-2 9316 df-3 9317 df-4 9318 df-5 9319 df-6 9320 df-7 9321 df-8 9322 df-9 9323 df-n0 9517 df-z 9598 df-dec 9731 df-uz 9875 df-fz 10365 df-fzo 10502 df-ihash 11167 df-word 11253 df-substr 11366 df-pfx 11393 df-ndx 13302 df-slot 13303 df-base 13305 df-edgf 16129 df-vtx 16138 df-iedg 16139 df-wlks 16442 df-trls 16505

This theorem is referenced by: trlres 16514 eupthres 16581

W3C validator