trlreslem - Intuitionistic Logic Explorer

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

Theorem trlreslem 16243

Description: Lemma for trlres 16244. (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 16242	. . . 4 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼)
4	1, 3	syl 14	. . 3 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼)
5		trlres.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
6		elfzouz2 10397	. . . 4 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ_≥‘𝑁))
7		fzoss2 10409	. . . 4 ⊢ ((♯‘𝐹) ∈ (ℤ_≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
8	5, 6, 7	3syl 17	. . 3 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
9		f1ores 5598	. . 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 16240	. . . . . 6 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃)
13	2	wlkf 16184	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼)
14	1, 12, 13	3syl 17	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼)
15		fzossfz 10401	. . . . . 6 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹))
16	15, 5	sselid 3225	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹)))
17		pfxres 11263	. . . . 5 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁)))
18	14, 16, 17	syl2anc 411	. . . 4 ⊢ (𝜑 → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁)))
19	11, 18	eqtrid 2276	. . 3 ⊢ (𝜑 → 𝐻 = (𝐹 ↾ (0..^𝑁)))
20	11	fveq2i 5642	. . . . 5 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁))
21		elfzofz 10398	. . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → 𝑁 ∈ (0...(♯‘𝐹)))
22	5, 21	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹)))
23		pfxlen 11267	. . . . . 6 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁)
24	14, 22, 23	syl2anc 411	. . . . 5 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁)
25	20, 24	eqtrid 2276	. . . 4 ⊢ (𝜑 → (♯‘𝐻) = 𝑁)
26	25	oveq2d 6034	. . 3 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁))
27		wrdf 11120	. . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
28		fimass 5498	. . . . . 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 5035	. . . 4 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁)))
32	30, 31	sylib 122	. . 3 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁)))
33	19, 26, 32	f1oeq123d 5577	. 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 1397 ∈ wcel 2202 ⊆ wss 3200 class class class wbr 4088 dom cdm 4725 ↾ cres 4727 “ cima 4728 ⟶wf 5322 –1-1→wf1 5323 –1-1-onto→wf1o 5325 ‘cfv 5326 (class class class)co 6018 0cc0 8032 ℤ_≥cuz 9755 ...cfz 10243 ..^cfzo 10377 ♯chash 11038 Word cword 11114 prefix cpfx 11254 Vtxcvtx 15866 iEdgciedg 15867 Walkscwlks 16171 Trailsctrls 16234

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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148

This theorem depends on definitions: df-bi 117 df-dc 842 df-ifp 986 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-1o 6582 df-er 6702 df-map 6819 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-7 9207 df-8 9208 df-9 9209 df-n0 9403 df-z 9480 df-dec 9612 df-uz 9756 df-fz 10244 df-fzo 10378 df-ihash 11039 df-word 11115 df-substr 11228 df-pfx 11255 df-ndx 13087 df-slot 13088 df-base 13090 df-edgf 15859 df-vtx 15868 df-iedg 15869 df-wlks 16172 df-trls 16235

This theorem is referenced by: trlres 16244 eupthres 16311

W3C validator