wwlksnextsurj - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > wwlksnextsurj		Structured version Visualization version GIF version

Theorem wwlksnextsurj 27686

Description: Lemma for wwlksnextbij 27688. (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 27628	. . 3 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ₀ ∧ 𝑊 ∈ Word 𝑉))
3		simp2 1134	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ₀ ∧ 𝑊 ∈ Word 𝑉) → 𝑁 ∈ ℕ₀)
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 27684	. . 3 ⊢ (𝑁 ∈ ℕ₀ → 𝐹:𝐷⟶𝑅)
9	2, 3, 8	3syl 18	. 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷⟶𝑅)
10		preq2 4630	. . . . . 6 ⊢ (𝑛 = 𝑟 → {(lastS‘𝑊), 𝑛} = {(lastS‘𝑊), 𝑟})
11	10	eleq1d 2874	. . . . 5 ⊢ (𝑛 = 𝑟 → ({(lastS‘𝑊), 𝑛} ∈ 𝐸 ↔ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
12	11, 6	elrab2 3631	. . . 4 ⊢ (𝑟 ∈ 𝑅 ↔ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
13	1, 4	wwlksnext 27679	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
14	13	3expb 1117	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
15		s1cl 13947	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑟 ∈ 𝑉 → ⟨“𝑟”⟩ ∈ Word 𝑉)
16		pfxccat1 14055	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑊 ∈ Word 𝑉 ∧ ⟨“𝑟”⟩ ∈ Word 𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
17	15, 16	sylan2 595	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑟 ∈ 𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
18	17	ex 416	. . . . . . . . . . . . . . . 16 ⊢ (𝑊 ∈ Word 𝑉 → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
19	18	adantr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
20		oveq2 7143	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 + 1) = (♯‘𝑊) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
21	20	eqcoms 2806	. . . . . . . . . . . . . . . . 17 ⊢ ((♯‘𝑊) = (𝑁 + 1) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
22	21	eqeq1d 2800	. . . . . . . . . . . . . . . 16 ⊢ ((♯‘𝑊) = (𝑁 + 1) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
23	22	adantl 485	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
24	19, 23	sylibrd 262	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
25	24	3adant3 1129	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (𝑟 ∈ 𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
26	1, 4	wwlknp 27629	. . . . . . . . . . . . 13 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
27	25, 26	syl11 33	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ 𝑉 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
28	27	adantr 484	. . . . . . . . . . 11 ⊢ ((𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
29	28	impcom 411	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊)
30		lswccats1 13984	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑟 ∈ 𝑉) → (lastS‘(𝑊 ++ ⟨“𝑟”⟩)) = 𝑟)
31	30	eqcomd 2804	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑟 ∈ 𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
32	31	ex 416	. . . . . . . . . . . . . . . . 17 ⊢ (𝑊 ∈ Word 𝑉 → (𝑟 ∈ 𝑉 → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
33	32	3ad2ant3 1132	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ₀ ∧ 𝑊 ∈ Word 𝑉) → (𝑟 ∈ 𝑉 → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
34	2, 33	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑟 ∈ 𝑉 → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
35	34	imp 410	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
36	35	preq2d 4636	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → {(lastS‘𝑊), 𝑟} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
37	36	eleq1d 2874	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → ({(lastS‘𝑊), 𝑟} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
38	37	biimpd 232	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑉) → ({(lastS‘𝑊), 𝑟} ∈ 𝐸 → {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
39	38	impr 458	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)
40	14, 29, 39	jca32 519	. . . . . . . . 9 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)))
41	33, 2	syl11 33	. . . . . . . . . . 11 ⊢ (𝑟 ∈ 𝑉 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
42	41	adantr 484	. . . . . . . . . 10 ⊢ ((𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
43	42	impcom 411	. . . . . . . . 9 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
44		ovexd 7170	. . . . . . . . . 10 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ V)
45		eleq1 2877	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺)))
46		oveq1 7142	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)))
47	46	eqeq1d 2800	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
48		fveq2 6645	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (lastS‘𝑑) = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
49	48	preq2d 4636	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → {(lastS‘𝑊), (lastS‘𝑑)} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
50	49	eleq1d 2874	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ({(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
51	47, 50	anbi12d 633	. . . . . . . . . . . . . . 15 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸) ↔ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)))
52	45, 51	anbi12d 633	. . . . . . . . . . . . . 14 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ↔ ((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))))
53	48	eqeq2d 2809	. . . . . . . . . . . . . 14 ⊢ (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑟 = (lastS‘𝑑) ↔ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
54	52, 53	anbi12d 633	. . . . . . . . . . . . 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 485	. . . . . . . . . . 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 3542	. . . . . . . . 9 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) → ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
59	40, 43, 58	mp2and 698	. . . . . . . 8 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
60		oveq1 7142	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑑 → (𝑤 prefix (𝑁 + 1)) = (𝑑 prefix (𝑁 + 1)))
61	60	eqeq1d 2800	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑑 → ((𝑤 prefix (𝑁 + 1)) = 𝑊 ↔ (𝑑 prefix (𝑁 + 1)) = 𝑊))
62		fveq2 6645	. . . . . . . . . . . . . 14 ⊢ (𝑤 = 𝑑 → (lastS‘𝑤) = (lastS‘𝑑))
63	62	preq2d 4636	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑑 → {(lastS‘𝑊), (lastS‘𝑤)} = {(lastS‘𝑊), (lastS‘𝑑)})
64	63	eleq1d 2874	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑑 → ({(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸))
65	61, 64	anbi12d 633	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑑 → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
66	65	elrab 3628	. . . . . . . . . 10 ⊢ (𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ↔ (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
67	66	anbi1i 626	. . . . . . . . 9 ⊢ ((𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
68	67	exbii 1849	. . . . . . . 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 3112	. . . . . . 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 27683	. . . . . . . 8 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
73	72	adantr 484	. . . . . . 7 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
74	73	rexeqdv 3365	. . . . . 6 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (∃𝑑 ∈ 𝐷 𝑟 = (lastS‘𝑑) ↔ ∃𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}𝑟 = (lastS‘𝑑)))
75	71, 74	mpbird 260	. . . . 5 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑 ∈ 𝐷 𝑟 = (lastS‘𝑑))
76		fveq2 6645	. . . . . . . 8 ⊢ (𝑡 = 𝑑 → (lastS‘𝑡) = (lastS‘𝑑))
77		fvex 6658	. . . . . . . 8 ⊢ (lastS‘𝑑) ∈ V
78	76, 7, 77	fvmpt 6745	. . . . . . 7 ⊢ (𝑑 ∈ 𝐷 → (𝐹‘𝑑) = (lastS‘𝑑))
79	78	eqeq2d 2809	. . . . . 6 ⊢ (𝑑 ∈ 𝐷 → (𝑟 = (𝐹‘𝑑) ↔ 𝑟 = (lastS‘𝑑)))
80	79	rexbiia 3209	. . . . 5 ⊢ (∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑) ↔ ∃𝑑 ∈ 𝐷 𝑟 = (lastS‘𝑑))
81	75, 80	sylibr 237	. . . 4 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟 ∈ 𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑))
82	12, 81	sylan2b 596	. . 3 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟 ∈ 𝑅) → ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑))
83	82	ralrimiva 3149	. 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∀𝑟 ∈ 𝑅 ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑))
84		dffo3 6845	. 2 ⊢ (𝐹:𝐷–onto→𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑟 ∈ 𝑅 ∃𝑑 ∈ 𝐷 𝑟 = (𝐹‘𝑑)))
85	9, 83, 84	sylanbrc 586	1 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷–onto→𝑅)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ∀wral 3106 ∃wrex 3107 {crab 3110 Vcvv 3441 {cpr 4527 ↦ cmpt 5110 ⟶wf 6320 –onto→wfo 6322 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 + caddc 10529 2c2 11680 ℕ₀cn0 11885 ..^cfzo 13028 ♯chash 13686 Word cword 13857 lastSclsw 13905 ++ cconcat 13913 ⟨“cs1 13940 prefix cpfx 14023 Vtxcvtx 26789 Edgcedg 26840 WWalksN cwwlksn 27612

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-lsw 13906 df-concat 13914 df-s1 13941 df-substr 13994 df-pfx 14024 df-wwlks 27616 df-wwlksn 27617

This theorem is referenced by: wwlksnextbij0 27687

W3C validator