Theorem wlkres 27612

Description: The restriction ⟨𝐻, 𝑄⟩ of a walk ⟨𝐹, 𝑃⟩ to an initial segment of the walk (of length 𝑁) forms a walk on the subgraph 𝑆 consisting of the edges in the initial segment. Formerly proven directly for Eulerian paths, see eupthres 28152. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 3-May-2015.) (Revised by AV, 5-Mar-2021.) Hypothesis revised using the prefix operation. (Revised by AV, 30-Nov-2022.)

Hypotheses

Ref	Expression
wlkres.v	⊢ 𝑉 = (Vtx‘𝐺)
wlkres.i	⊢ 𝐼 = (iEdg‘𝐺)
wlkres.d	⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
wlkres.n	⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
wlkres.s	⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
wlkres.e	⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
wlkres.h	⊢ 𝐻 = (𝐹 prefix 𝑁)
wlkres.q	⊢ 𝑄 = (𝑃 ↾ (0...𝑁))

Assertion

Ref	Expression
wlkres	⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄)

Proof of Theorem wlkres

Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		wlkres.d	. . . 4 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
2		wlkres.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
3	2	wlkf 27556	. . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼)
4		pfxwrdsymb 14140	. . . 4 ⊢ (𝐹 ∈ Word dom 𝐼 → (𝐹 prefix 𝑁) ∈ Word (𝐹 “ (0..^𝑁)))
5	1, 3, 4	3syl 18	. . 3 ⊢ (𝜑 → (𝐹 prefix 𝑁) ∈ Word (𝐹 “ (0..^𝑁)))
6		wlkres.h	. . . 4 ⊢ 𝐻 = (𝐹 prefix 𝑁)
7	6	a1i 11	. . 3 ⊢ (𝜑 → 𝐻 = (𝐹 prefix 𝑁))
8		wlkres.e	. . . . . 6 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
9	8	dmeqd 5748	. . . . 5 ⊢ (𝜑 → dom (iEdg‘𝑆) = dom (𝐼 ↾ (𝐹 “ (0..^𝑁))))
10	1, 3	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼)
11		wrdf 13960	. . . . . . 7 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
12		fimass 6525	. . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼)
13	10, 11, 12	3syl 18	. . . . . 6 ⊢ (𝜑 → (𝐹 “ (0..^𝑁)) ⊆ dom 𝐼)
14		ssdmres 5848	. . . . . 6 ⊢ ((𝐹 “ (0..^𝑁)) ⊆ dom 𝐼 ↔ dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁)))
15	13, 14	sylib 221	. . . . 5 ⊢ (𝜑 → dom (𝐼 ↾ (𝐹 “ (0..^𝑁))) = (𝐹 “ (0..^𝑁)))
16	9, 15	eqtrd 2773	. . . 4 ⊢ (𝜑 → dom (iEdg‘𝑆) = (𝐹 “ (0..^𝑁)))
17		wrdeq 13977	. . . 4 ⊢ (dom (iEdg‘𝑆) = (𝐹 “ (0..^𝑁)) → Word dom (iEdg‘𝑆) = Word (𝐹 “ (0..^𝑁)))
18	16, 17	syl 17	. . 3 ⊢ (𝜑 → Word dom (iEdg‘𝑆) = Word (𝐹 “ (0..^𝑁)))
19	5, 7, 18	3eltr4d 2848	. 2 ⊢ (𝜑 → 𝐻 ∈ Word dom (iEdg‘𝑆))
20		wlkres.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
21	20	wlkp 27558	. . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶𝑉)
22	1, 21	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶𝑉)
23		wlkres.s	. . . . . . 7 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
24	23	feq3d 6491	. . . . . 6 ⊢ (𝜑 → (𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝑆) ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉))
25	22, 24	mpbird 260	. . . . 5 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝑆))
26		fzossfz 13147	. . . . . . 7 ⊢ (0..^(♯‘𝐹)) ⊆ (0...(♯‘𝐹))
27		wlkres.n	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹)))
28	26, 27	sseldi 3875	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝐹)))
29		elfzuz3 12995	. . . . . 6 ⊢ (𝑁 ∈ (0...(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁))
30		fzss2 13038	. . . . . 6 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0...𝑁) ⊆ (0...(♯‘𝐹)))
31	28, 29, 30	3syl 18	. . . . 5 ⊢ (𝜑 → (0...𝑁) ⊆ (0...(♯‘𝐹)))
32	25, 31	fssresd 6545	. . . 4 ⊢ (𝜑 → (𝑃 ↾ (0...𝑁)):(0...𝑁)⟶(Vtx‘𝑆))
33	6	fveq2i 6677	. . . . . . 7 ⊢ (♯‘𝐻) = (♯‘(𝐹 prefix 𝑁))
34		pfxlen 14134	. . . . . . . 8 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 prefix 𝑁)) = 𝑁)
35	10, 28, 34	syl2anc 587	. . . . . . 7 ⊢ (𝜑 → (♯‘(𝐹 prefix 𝑁)) = 𝑁)
36	33, 35	syl5eq 2785	. . . . . 6 ⊢ (𝜑 → (♯‘𝐻) = 𝑁)
37	36	oveq2d 7186	. . . . 5 ⊢ (𝜑 → (0...(♯‘𝐻)) = (0...𝑁))
38	37	feq2d 6490	. . . 4 ⊢ (𝜑 → ((𝑃 ↾ (0...𝑁)):(0...(♯‘𝐻))⟶(Vtx‘𝑆) ↔ (𝑃 ↾ (0...𝑁)):(0...𝑁)⟶(Vtx‘𝑆)))
39	32, 38	mpbird 260	. . 3 ⊢ (𝜑 → (𝑃 ↾ (0...𝑁)):(0...(♯‘𝐻))⟶(Vtx‘𝑆))
40		wlkres.q	. . . 4 ⊢ 𝑄 = (𝑃 ↾ (0...𝑁))
41	40	feq1i 6495	. . 3 ⊢ (𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆) ↔ (𝑃 ↾ (0...𝑁)):(0...(♯‘𝐻))⟶(Vtx‘𝑆))
42	39, 41	sylibr 237	. 2 ⊢ (𝜑 → 𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆))
43	20, 2	wlkprop 27553	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘)))))
44	1, 43	syl 17	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘)))))
45	44	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘)))))
46	36	oveq2d 7186	. . . . . . . . . . 11 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^𝑁))
47	46	eleq2d 2818	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0..^(♯‘𝐻)) ↔ 𝑥 ∈ (0..^𝑁)))
48	40	fveq1i 6675	. . . . . . . . . . . . 13 ⊢ (𝑄‘𝑥) = ((𝑃 ↾ (0...𝑁))‘𝑥)
49		fzossfz 13147	. . . . . . . . . . . . . . . 16 ⊢ (0..^𝑁) ⊆ (0...𝑁)
50	49	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (0..^𝑁) ⊆ (0...𝑁))
51	50	sselda 3877	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → 𝑥 ∈ (0...𝑁))
52	51	fvresd 6694	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → ((𝑃 ↾ (0...𝑁))‘𝑥) = (𝑃‘𝑥))
53	48, 52	eqtr2id 2786	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → (𝑃‘𝑥) = (𝑄‘𝑥))
54	40	fveq1i 6675	. . . . . . . . . . . . 13 ⊢ (𝑄‘(𝑥 + 1)) = ((𝑃 ↾ (0...𝑁))‘(𝑥 + 1))
55		fzofzp1 13225	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (0..^𝑁) → (𝑥 + 1) ∈ (0...𝑁))
56	55	adantl 485	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → (𝑥 + 1) ∈ (0...𝑁))
57	56	fvresd 6694	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → ((𝑃 ↾ (0...𝑁))‘(𝑥 + 1)) = (𝑃‘(𝑥 + 1)))
58	54, 57	eqtr2id 2786	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1)))
59	53, 58	jca 515	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → ((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))))
60	59	ex 416	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0..^𝑁) → ((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1)))))
61	47, 60	sylbid 243	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (0..^(♯‘𝐻)) → ((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1)))))
62	61	imp 410	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → ((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))))
63	10	ancli 552	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝜑 ∧ 𝐹 ∈ Word dom 𝐼))
64	11	ffund 6508	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 ∈ Word dom 𝐼 → Fun 𝐹)
65	64	adantl 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐹 ∈ Word dom 𝐼) → Fun 𝐹)
66	65	adantr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹 ∈ Word dom 𝐼) ∧ 𝑥 ∈ (0..^𝑁)) → Fun 𝐹)
67		fdm 6513	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 → dom 𝐹 = (0..^(♯‘𝐹)))
68		elfzouz2 13143	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁))
69		fzoss2 13156	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
70	27, 68, 69	3syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
71		sseq2 3903	. . . . . . . . . . . . . . . . . . 19 ⊢ (dom 𝐹 = (0..^(♯‘𝐹)) → ((0..^𝑁) ⊆ dom 𝐹 ↔ (0..^𝑁) ⊆ (0..^(♯‘𝐹))))
72	70, 71	syl5ibr 249	. . . . . . . . . . . . . . . . . 18 ⊢ (dom 𝐹 = (0..^(♯‘𝐹)) → (𝜑 → (0..^𝑁) ⊆ dom 𝐹))
73	11, 67, 72	3syl 18	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 ∈ Word dom 𝐼 → (𝜑 → (0..^𝑁) ⊆ dom 𝐹))
74	73	impcom 411	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐹 ∈ Word dom 𝐼) → (0..^𝑁) ⊆ dom 𝐹)
75	74	adantr 484	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹 ∈ Word dom 𝐼) ∧ 𝑥 ∈ (0..^𝑁)) → (0..^𝑁) ⊆ dom 𝐹)
76		simpr 488	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐹 ∈ Word dom 𝐼) ∧ 𝑥 ∈ (0..^𝑁)) → 𝑥 ∈ (0..^𝑁))
77	66, 75, 76	resfvresima 7008	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝐹 ∈ Word dom 𝐼) ∧ 𝑥 ∈ (0..^𝑁)) → ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
78	63, 77	sylan 583	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
79	78	eqcomd 2744	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^𝑁)) → (𝐼‘(𝐹‘𝑥)) = ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥)))
80	79	ex 416	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (0..^𝑁) → (𝐼‘(𝐹‘𝑥)) = ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥))))
81	47, 80	sylbid 243	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (0..^(♯‘𝐻)) → (𝐼‘(𝐹‘𝑥)) = ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥))))
82	81	imp 410	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (𝐼‘(𝐹‘𝑥)) = ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥)))
83	8	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (iEdg‘𝑆) = (𝐼 ↾ (𝐹 “ (0..^𝑁))))
84	6	fveq1i 6675	. . . . . . . . . . 11 ⊢ (𝐻‘𝑥) = ((𝐹 prefix 𝑁)‘𝑥)
85	10	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → 𝐹 ∈ Word dom 𝐼)
86	28	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → 𝑁 ∈ (0...(♯‘𝐹)))
87		pfxres 14130	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁)))
88	85, 86, 87	syl2anc 587	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (𝐹 prefix 𝑁) = (𝐹 ↾ (0..^𝑁)))
89	88	fveq1d 6676	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → ((𝐹 prefix 𝑁)‘𝑥) = ((𝐹 ↾ (0..^𝑁))‘𝑥))
90	84, 89	syl5eq 2785	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (𝐻‘𝑥) = ((𝐹 ↾ (0..^𝑁))‘𝑥))
91	83, 90	fveq12d 6681	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → ((iEdg‘𝑆)‘(𝐻‘𝑥)) = ((𝐼 ↾ (𝐹 “ (0..^𝑁)))‘((𝐹 ↾ (0..^𝑁))‘𝑥)))
92	82, 91	eqtr4d 2776	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥)))
93	62, 92	jca 515	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))))
94	27, 68	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘𝑁))
95	36	fveq2d 6678	. . . . . . . . . . 11 ⊢ (𝜑 → (ℤ≥‘(♯‘𝐻)) = (ℤ≥‘𝑁))
96	94, 95	eleqtrrd 2836	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐹) ∈ (ℤ≥‘(♯‘𝐻)))
97		fzoss2 13156	. . . . . . . . . 10 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘(♯‘𝐻)) → (0..^(♯‘𝐻)) ⊆ (0..^(♯‘𝐹)))
98	96, 97	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (0..^(♯‘𝐻)) ⊆ (0..^(♯‘𝐹)))
99	98	sselda 3877	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → 𝑥 ∈ (0..^(♯‘𝐹)))
100		wkslem1 27549	. . . . . . . . 9 ⊢ (𝑘 = 𝑥 → (if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))) ↔ if-((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)), (𝐼‘(𝐹‘𝑥)) = {(𝑃‘𝑥)}, {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} ⊆ (𝐼‘(𝐹‘𝑥)))))
101	100	rspcv 3521	. . . . . . . 8 ⊢ (𝑥 ∈ (0..^(♯‘𝐹)) → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))) → if-((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)), (𝐼‘(𝐹‘𝑥)) = {(𝑃‘𝑥)}, {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} ⊆ (𝐼‘(𝐹‘𝑥)))))
102	99, 101	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))) → if-((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)), (𝐼‘(𝐹‘𝑥)) = {(𝑃‘𝑥)}, {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} ⊆ (𝐼‘(𝐹‘𝑥)))))
103		eqeq12 2752	. . . . . . . . . 10 ⊢ (((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) → ((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)) ↔ (𝑄‘𝑥) = (𝑄‘(𝑥 + 1))))
104	103	adantr 484	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → ((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)) ↔ (𝑄‘𝑥) = (𝑄‘(𝑥 + 1))))
105		simpr 488	. . . . . . . . . 10 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥)))
106		sneq 4526	. . . . . . . . . . . 12 ⊢ ((𝑃‘𝑥) = (𝑄‘𝑥) → {(𝑃‘𝑥)} = {(𝑄‘𝑥)})
107	106	adantr 484	. . . . . . . . . . 11 ⊢ (((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) → {(𝑃‘𝑥)} = {(𝑄‘𝑥)})
108	107	adantr 484	. . . . . . . . . 10 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → {(𝑃‘𝑥)} = {(𝑄‘𝑥)})
109	105, 108	eqeq12d 2754	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → ((𝐼‘(𝐹‘𝑥)) = {(𝑃‘𝑥)} ↔ ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}))
110		preq12 4626	. . . . . . . . . . 11 ⊢ (((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) → {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} = {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))})
111	110	adantr 484	. . . . . . . . . 10 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} = {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))})
112	111, 105	sseq12d 3910	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → ({(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} ⊆ (𝐼‘(𝐹‘𝑥)) ↔ {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥))))
113	104, 109, 112	ifpbi123d 1079	. . . . . . . 8 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → (if-((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)), (𝐼‘(𝐹‘𝑥)) = {(𝑃‘𝑥)}, {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} ⊆ (𝐼‘(𝐹‘𝑥))) ↔ if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥)))))
114	113	biimpd 232	. . . . . . 7 ⊢ ((((𝑃‘𝑥) = (𝑄‘𝑥) ∧ (𝑃‘(𝑥 + 1)) = (𝑄‘(𝑥 + 1))) ∧ (𝐼‘(𝐹‘𝑥)) = ((iEdg‘𝑆)‘(𝐻‘𝑥))) → (if-((𝑃‘𝑥) = (𝑃‘(𝑥 + 1)), (𝐼‘(𝐹‘𝑥)) = {(𝑃‘𝑥)}, {(𝑃‘𝑥), (𝑃‘(𝑥 + 1))} ⊆ (𝐼‘(𝐹‘𝑥))) → if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥)))))
115	93, 102, 114	sylsyld 61	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))) → if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥)))))
116	115	com12 32	. . . . 5 ⊢ (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))) → ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥)))))
117	116	3ad2ant3 1136	. . . 4 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘)))) → ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥)))))
118	45, 117	mpcom 38	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (0..^(♯‘𝐻))) → if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥))))
119	118	ralrimiva 3096	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (0..^(♯‘𝐻))if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥))))
120	20, 2, 1, 27, 23	wlkreslem 27611	. . 3 ⊢ (𝜑 → 𝑆 ∈ V)
121		eqid 2738	. . . 4 ⊢ (Vtx‘𝑆) = (Vtx‘𝑆)
122		eqid 2738	. . . 4 ⊢ (iEdg‘𝑆) = (iEdg‘𝑆)
123	121, 122	iswlkg 27555	. . 3 ⊢ (𝑆 ∈ V → (𝐻(Walks‘𝑆)𝑄 ↔ (𝐻 ∈ Word dom (iEdg‘𝑆) ∧ 𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆) ∧ ∀𝑥 ∈ (0..^(♯‘𝐻))if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥))))))
124	120, 123	syl 17	. 2 ⊢ (𝜑 → (𝐻(Walks‘𝑆)𝑄 ↔ (𝐻 ∈ Word dom (iEdg‘𝑆) ∧ 𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆) ∧ ∀𝑥 ∈ (0..^(♯‘𝐻))if-((𝑄‘𝑥) = (𝑄‘(𝑥 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑥)) = {(𝑄‘𝑥)}, {(𝑄‘𝑥), (𝑄‘(𝑥 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑥))))))
125	19, 42, 119, 124	mpbir3and 1343	1 ⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  if-wif 1062   ∧ w3a 1088   = wceq 1542   ∈ wcel 2114  ∀wral 3053  Vcvv 3398   ⊆ wss 3843  {csn 4516  {cpr 4518   class class class wbr 5030  dom cdm 5525   ↾ cres 5527   “ cima 5528  Fun wfun 6333  ⟶wf 6335  ‘cfv 6339  (class class class)co 7170  0cc0 10615  1c1 10616   + caddc 10618  ℤ_≥cuz 12324  ...cfz 12981  ..^cfzo 13124  ♯chash 13782  Word cword 13955   prefix cpfx 14121  Vtxcvtx 26941  iEdgciedg 26942  Walkscwlks 27538

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2710  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5232  ax-pr 5296  ax-un 7479  ax-cnex 10671  ax-resscn 10672  ax-1cn 10673  ax-icn 10674  ax-addcl 10675  ax-addrcl 10676  ax-mulcl 10677  ax-mulrcl 10678  ax-mulcom 10679  ax-addass 10680  ax-mulass 10681  ax-distr 10682  ax-i2m1 10683  ax-1ne0 10684  ax-1rid 10685  ax-rnegex 10686  ax-rrecex 10687  ax-cnre 10688  ax-pre-lttri 10689  ax-pre-lttrn 10690  ax-pre-ltadd 10691  ax-pre-mulgt0 10692

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-ifp 1063  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-nel 3039  df-ral 3058  df-rex 3059  df-reu 3060  df-rab 3062  df-v 3400  df-sbc 3681  df-csb 3791  df-dif 3846  df-un 3848  df-in 3850  df-ss 3860  df-pss 3862  df-nul 4212  df-if 4415  df-pw 4490  df-sn 4517  df-pr 4519  df-tp 4521  df-op 4523  df-uni 4797  df-int 4837  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5429  df-eprel 5434  df-po 5442  df-so 5443  df-fr 5483  df-we 5485  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-res 5537  df-ima 5538  df-pred 6129  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6297  df-fun 6341  df-fn 6342  df-f 6343  df-f1 6344  df-fo 6345  df-f1o 6346  df-fv 6347  df-riota 7127  df-ov 7173  df-oprab 7174  df-mpo 7175  df-om 7600  df-1st 7714  df-2nd 7715  df-wrecs 7976  df-recs 8037  df-rdg 8075  df-1o 8131  df-er 8320  df-map 8439  df-pm 8440  df-en 8556  df-dom 8557  df-sdom 8558  df-fin 8559  df-card 9441  df-pnf 10755  df-mnf 10756  df-xr 10757  df-ltxr 10758  df-le 10759  df-sub 10950  df-neg 10951  df-nn 11717  df-n0 11977  df-z 12063  df-uz 12325  df-fz 12982  df-fzo 13125  df-hash 13783  df-word 13956  df-substr 14092  df-pfx 14122  df-wlks 27541

This theorem is referenced by:  trlres  27642  eupthres  28152