Theorem wwlksnextsurj 30249

Description: Lemma for wwlksnextbij 30251. (Contributed by Alexander van der Vekens, 7-Aug-2018.) (Revised by AV, 18-Apr-2021.) (Revised by AV, 27-Oct-2022.)

Hypotheses

Ref	Expression
wwlksnextbij0.v	⊢ 𝑉 = (Vtx‘𝐺)
wwlksnextbij0.e	⊢ 𝐸 = (Edg‘𝐺)
wwlksnextbij0.d	⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
wwlksnextbij0.r	⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}
wwlksnextbij0.f	⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (lastS‘𝑡))

Assertion

Ref	Expression
wwlksnextsurj	⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷–onto→𝑅)

Distinct variable groups:   𝑤,𝐺   𝑤,𝑁   𝑤,𝑊   𝑡,𝐷   𝑛,𝐸,𝑤   𝑡,𝑁,𝑤   𝑡,𝑅   𝑛,𝑉,𝑤   𝑛,𝑊   𝑡,𝑛,𝑁,𝑤

Allowed substitution hints:   𝐷(𝑤,𝑛)   𝑅(𝑤,𝑛)   𝐸(𝑡)   𝐹(𝑤,𝑡,𝑛)   𝐺(𝑡,𝑛)   𝑉(𝑡)   𝑊(𝑡)

Proof of Theorem wwlksnextsurj

Dummy variables 𝑖 𝑑 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		wwlksnextbij0.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	wwlknbp 30191	. . 3 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉))
3		simp2 1155	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → 𝑁 ∈ ℕ0)
4		wwlksnextbij0.e	. . . 4 ⊢ 𝐸 = (Edg‘𝐺)
5		wwlksnextbij0.d	. . . 4 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
6		wwlksnextbij0.r	. . . 4 ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}
7		wwlksnextbij0.f	. . . 4 ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (lastS‘𝑡))
8	1, 4, 5, 6, 7	wwlksnextfun 30247	. . 3 ⊢ (𝑁 ∈ ℕ0 → 𝐹:𝐷⟶𝑅)
9	2, 3, 8	3syl 19	. 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷⟶𝑅)
10		preq2 4700	. . . . . 6 ⊢ (𝑛 = 𝑟 → {(lastS‘𝑊), 𝑛} = {(lastS‘𝑊), 𝑟})
11	10	eleq1d 2848	. . . . 5 ⊢ (𝑛 = 𝑟 → ({(lastS‘𝑊), 𝑛} ∈ 𝐸 ↔ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
12	11, 6	elrab2 3654	. . . 4 ⊢ (𝑟 ∈ 𝑅 ↔ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
13	1, 4	wwlksnext 30242	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
14	13	3expb 1138	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
15		s1cl 14636	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑟 ∈ 𝑉 → ⟨“𝑟”⟩ ∈ Word 𝑉)
16		pfxccat1 14735	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ⟨“𝑟”⟩ ∈ Word 𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
17	15, 16	sylan2 604	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑟 ∈ 𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
18	17	ex 417	. . . . . . . . . . . . . . . 16 ⊢ (𝑊 ∈ Word 𝑉 → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
19	18	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
20		oveq2 7418	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 + 1) = (♯‘𝑊) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
21	20	eqcoms 2771	. . . . . . . . . . . . . . . . 17 ⊢ ((♯‘𝑊) = (𝑁 + 1) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
22	21	eqeq1d 2765	. . . . . . . . . . . . . . . 16 ⊢ ((♯‘𝑊) = (𝑁 + 1) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
23	22	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
24	19, 23	sylibrd 262	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
25	24	3adant3 1150	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
26	1, 4	wwlknp 30192	. . . . . . . . . . . . 13 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
27	25, 26	syl11 34	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ 𝑉 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
28	27	adantr 485	. . . . . . . . . . 11 ⊢ ((𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
29	28	impcom 412	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊)
30		lswccats1 14668	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑟 ∈ 𝑉) → (lastS‘(𝑊 ++ ⟨“𝑟”⟩)) = 𝑟)
31	30	eqcomd 2769	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑟 ∈ 𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
32	31	ex 417	. . . . . . . . . . . . . . . . 17 ⊢ (𝑊 ∈ Word 𝑉 → (𝑟 ∈ 𝑉 → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
33	32	3ad2ant3 1153	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑟 ∈ 𝑉 → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
34	2, 33	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑟 ∈ 𝑉 → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
35	34	imp 411	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
36	35	preq2d 4706	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → {(lastS‘𝑊), 𝑟} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
37	36	eleq1d 2848	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → ({(lastS‘𝑊), 𝑟} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
38	37	biimpd 232	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → ({(lastS‘𝑊), 𝑟} ∈ 𝐸 → {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
39	38	impr 459	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)
40	14, 29, 39	jca32 524	. . . . . . . . 9 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)))
41	33, 2	syl11 34	. . . . . . . . . . 11 ⊢ (𝑟 ∈ 𝑉 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
42	41	adantr 485	. . . . . . . . . 10 ⊢ ((𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
43	42	impcom 412	. . . . . . . . 9 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
44		ovexd 7445	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ V)
45		eleq1 2851	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺)))
46		oveq1 7417	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)))
47	46	eqeq1d 2765	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
48		fveq2 6881	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (lastS‘𝑑) = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
49	48	preq2d 4706	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → {(lastS‘𝑊), (lastS‘𝑑)} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
50	49	eleq1d 2848	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ({(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
51	47, 50	anbi12d 643	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸) ↔ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)))
52	45, 51	anbi12d 643	. . . . . . . . . . . . . 14 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ↔ ((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))))
53	48	eqeq2d 2774	. . . . . . . . . . . . . 14 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑟 = (lastS‘𝑑) ↔ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
54	52, 53	anbi12d 643	. . . . . . . . . . . . 13 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)) ↔ (((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))))
55	54	bicomd 226	. . . . . . . . . . . 12 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
56	55	adantl 486	. . . . . . . . . . 11 ⊢ (((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) ∧ 𝑑 = (𝑊 ++ ⟨“𝑟”⟩)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
57	56	biimpd 232	. . . . . . . . . 10 ⊢ (((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) ∧ 𝑑 = (𝑊 ++ ⟨“𝑟”⟩)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) → ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
58	44, 57	spcimedv 3554	. . . . . . . . 9 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) → ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
59	40, 43, 58	mp2and 711	. . . . . . . 8 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
60		oveq1 7417	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑑 → (𝑤 prefix (𝑁 + 1)) = (𝑑 prefix (𝑁 + 1)))
61	60	eqeq1d 2765	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑑 → ((𝑤 prefix (𝑁 + 1)) = 𝑊 ↔ (𝑑 prefix (𝑁 + 1)) = 𝑊))
62		fveq2 6881	. . . . . . . . . . . . . 14 ⊢ (𝑤 = 𝑑 → (lastS‘𝑤) = (lastS‘𝑑))
63	62	preq2d 4706	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑑 → {(lastS‘𝑊), (lastS‘𝑤)} = {(lastS‘𝑊), (lastS‘𝑑)})
64	63	eleq1d 2848	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑑 → ({(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸))
65	61, 64	anbi12d 643	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑑 → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
66	65	elrab 3650	. . . . . . . . . 10 ⊢ (𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ↔ (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
67	66	anbi1i 635	. . . . . . . . 9 ⊢ ((𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
68	67	exbii 1878	. . . . . . . 8 ⊢ (∃𝑑(𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)) ↔ ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
69	59, 68	sylibr 237	. . . . . . 7 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑(𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)))
70		df-rex 3090	. . . . . . 7 ⊢ (∃𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}𝑟 = (lastS‘𝑑) ↔ ∃𝑑(𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)))
71	69, 70	sylibr 237	. . . . . 6 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}𝑟 = (lastS‘𝑑))
72	1, 4, 5	wwlksnextwrd 30246	. . . . . . 7 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
73	72	adantr 485	. . . . . 6 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
74	71, 73	rexeqtrrdv 3328	. . . . 5 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑 ∈ 𝐷 𝑟 = (lastS‘𝑑))
75		fveq2 6881	. . . . . . . 8 ⊢ (𝑡 = 𝑑 → (lastS‘𝑡) = (lastS‘𝑑))
76		fvex 6894	. . . . . . . 8 ⊢ (lastS‘𝑑) ∈ V
77	75, 7, 76	fvmpt 6989	. . . . . . 7 ⊢ (𝑑 ∈ 𝐷 → (𝐹‘𝑑) = (lastS‘𝑑))
78	77	eqeq2d 2774	. . . . . 6 ⊢ (𝑑 ∈ 𝐷 → (𝑟 = (𝐹‘𝑑) ↔ 𝑟 = (lastS‘𝑑)))
79	78	rexbiia 3110	. . . . 5 ⊢ (∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑) ↔ ∃𝑑 ∈ 𝐷 𝑟 = (lastS‘𝑑))
80	74, 79	sylibr 237	. . . 4 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑))
81	12, 80	sylan2b 605	. . 3 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑅) → ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑))
82	81	ralrimiva 3157	. 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∀𝑟 ∈ 𝑅 ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑))
83		dffo3 7097	. 2 ⊢ (𝐹:𝐷–onto→𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑟 ∈ 𝑅 ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑)))
84	9, 82, 83	sylanbrc 594	1 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷–onto→𝑅)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570  ∃wex 1809   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089  {crab 3416  Vcvv 3455  {cpr 4591   ↦ cmpt 5192  ⟶wf 6532  –onto→wfo 6534  ‘cfv 6536  (class class class)co 7410  0cc0 11095  1c1 11096   + caddc 11098  2c2 12290  ℕ₀cn0 12499  ..^cfzo 13678  ♯chash 14362  Word cword 14546  lastSclsw 14595   ++ cconcat 14603  ⟨“cs1 14629   prefix cpfx 14704  Vtxcvtx 29346  Edgcedg 29397   WWalksN cwwlksn 30175

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-card 9921  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-nn 12229  df-2 12298  df-n0 12500  df-xnn0 12573  df-z 12587  df-uz 12858  df-rp 13012  df-fz 13531  df-fzo 13679  df-hash 14363  df-word 14547  df-lsw 14596  df-concat 14604  df-s1 14630  df-substr 14675  df-pfx 14705  df-wwlks 30179  df-wwlksn 30180

This theorem is referenced by:  wwlksnextbij0  30250