Theorem wwlksnextwrd 29930

Description: Lemma for wwlksnextbij 29935. (Contributed by Alexander van der Vekens, 5-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‘𝑤)} ∈ 𝐸)}

Assertion

Ref	Expression
wwlksnextwrd	⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})

Distinct variable groups:   𝑤,𝐺   𝑤,𝑁   𝑤,𝑊

Allowed substitution hints:   𝐷(𝑤)   𝐸(𝑤)   𝑉(𝑤)

Proof of Theorem wwlksnextwrd

Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		wwlksnextbij0.d	. 2 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
2		3anass 1095	. . . . 5 ⊢ (((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((♯‘𝑤) = (𝑁 + 2) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)))
3	2	bianass 641	. . . 4 ⊢ ((𝑤 ∈ Word 𝑉 ∧ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) ↔ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)))
4		wwlksnextbij0.v	. . . . . . . . . . 11 ⊢ 𝑉 = (Vtx‘𝐺)
5	4	wwlknbp 29875	. . . . . . . . . 10 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉))
6		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → 𝑁 ∈ ℕ0)
7		simpl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → 𝑤 ∈ Word 𝑉)
8		nn0re 12562	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ)
9		2re 12367	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 2 ∈ ℝ
10	9	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ)
11		nn0ge0 12578	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁)
12		2pos 12396	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 < 2
13	12	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 0 < 2)
14	8, 10, 11, 13	addgegt0d 11863	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ0 → 0 < (𝑁 + 2))
15	14	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → 0 < (𝑁 + 2))
16		breq2 5170	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘𝑤) = (𝑁 + 2) → (0 < (♯‘𝑤) ↔ 0 < (𝑁 + 2)))
17	16	ad2antll 728	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → (0 < (♯‘𝑤) ↔ 0 < (𝑁 + 2)))
18	15, 17	mpbird 257	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → 0 < (♯‘𝑤))
19		hashgt0n0 14414	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ Word 𝑉 ∧ 0 < (♯‘𝑤)) → 𝑤 ≠ ∅)
20	7, 18, 19	syl2an2 685	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → 𝑤 ≠ ∅)
21		lswcl 14616	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ Word 𝑉 ∧ 𝑤 ≠ ∅) → (lastS‘𝑤) ∈ 𝑉)
22	7, 20, 21	syl2an2 685	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → (lastS‘𝑤) ∈ 𝑉)
23	22	adantrr 716	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → (lastS‘𝑤) ∈ 𝑉)
24		pfxcl 14725	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑤 ∈ Word 𝑉 → (𝑤 prefix (𝑁 + 1)) ∈ Word 𝑉)
25		eleq1 2832	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑊 = (𝑤 prefix (𝑁 + 1)) → (𝑊 ∈ Word 𝑉 ↔ (𝑤 prefix (𝑁 + 1)) ∈ Word 𝑉))
26	24, 25	imbitrrid 246	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑊 = (𝑤 prefix (𝑁 + 1)) → (𝑤 ∈ Word 𝑉 → 𝑊 ∈ Word 𝑉))
27	26	eqcoms 2748	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑤 prefix (𝑁 + 1)) = 𝑊 → (𝑤 ∈ Word 𝑉 → 𝑊 ∈ Word 𝑉))
28	27	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → (𝑤 ∈ Word 𝑉 → 𝑊 ∈ Word 𝑉))
29	28	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 ∈ Word 𝑉 → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → 𝑊 ∈ Word 𝑉))
30	29	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → 𝑊 ∈ Word 𝑉))
31	30	imp 406	. . . . . . . . . . . . . . 15 ⊢ (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑊 ∈ Word 𝑉)
32	31	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → 𝑊 ∈ Word 𝑉)
33		oveq1 7455	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑊 = (𝑤 prefix (𝑁 + 1)) → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
34	33	eqcoms 2748	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 prefix (𝑁 + 1)) = 𝑊 → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
35	34	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
36	35	ad2antll 728	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
37		oveq1 7455	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((♯‘𝑤) = (𝑁 + 2) → ((♯‘𝑤) − 1) = ((𝑁 + 2) − 1))
38	37	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → ((♯‘𝑤) − 1) = ((𝑁 + 2) − 1))
39		nn0cn 12563	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ)
40		2cnd 12371	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℂ)
41		1cnd 11285	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℂ)
42	39, 40, 41	addsubassd 11667	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 2) − 1) = (𝑁 + (2 − 1)))
43		2m1e1 12419	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (2 − 1) = 1
44	43	a1i 11	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → (2 − 1) = 1)
45	44	oveq2d 7464	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (2 − 1)) = (𝑁 + 1))
46	42, 45	eqtrd 2780	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 2) − 1) = (𝑁 + 1))
47	38, 46	sylan9eqr 2802	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((♯‘𝑤) − 1) = (𝑁 + 1))
48	47	oveq2d 7464	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → (𝑤 prefix ((♯‘𝑤) − 1)) = (𝑤 prefix (𝑁 + 1)))
49	48	oveq1d 7463	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((𝑤 prefix ((♯‘𝑤) − 1)) ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
50		pfxlswccat 14761	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ Word 𝑉 ∧ 𝑤 ≠ ∅) → ((𝑤 prefix ((♯‘𝑤) − 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
51	7, 20, 50	syl2an2 685	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((𝑤 prefix ((♯‘𝑤) − 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
52	49, 51	eqtr3d 2782	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
53	52	adantrr 716	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
54	36, 53	eqtr2d 2781	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → 𝑤 = (𝑊 ++ ⟨“(lastS‘𝑤)”⟩))
55		simprrr 781	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)
56		wwlksnextbij0.e	. . . . . . . . . . . . . . 15 ⊢ 𝐸 = (Edg‘𝐺)
57	4, 56	wwlksnextbi 29927	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ0 ∧ (lastS‘𝑤) ∈ 𝑉) ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑤 = (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ 𝑊 ∈ (𝑁 WWalksN 𝐺)))
58	6, 23, 32, 54, 55, 57	syl23anc 1377	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ 𝑊 ∈ (𝑁 WWalksN 𝐺)))
59	58	exbiri 810	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
60	59	com23 86	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
61	60	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
62	5, 61	mpcom 38	. . . . . . . . 9 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺)))
63	62	expcomd 416	. . . . . . . 8 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
64	63	imp 406	. . . . . . 7 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺)))
65	4, 56	wwlknp 29876	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑤‘𝑖), (𝑤‘(𝑖 + 1))} ∈ 𝐸))
66	39, 41, 41	addassd 11312	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1)))
67		1p1e2 12418	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (1 + 1) = 2
68	67	a1i 11	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → (1 + 1) = 2)
69	68	oveq2d 7464	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (1 + 1)) = (𝑁 + 2))
70	66, 69	eqtrd 2780	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 1) = (𝑁 + 2))
71	70	eqeq2d 2751	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ ℕ0 → ((♯‘𝑤) = ((𝑁 + 1) + 1) ↔ (♯‘𝑤) = (𝑁 + 2)))
72	71	biimpd 229	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℕ0 → ((♯‘𝑤) = ((𝑁 + 1) + 1) → (♯‘𝑤) = (𝑁 + 2)))
73	72	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → ((♯‘𝑤) = ((𝑁 + 1) + 1) → (♯‘𝑤) = (𝑁 + 2)))
74	73	com12 32	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑤) = ((𝑁 + 1) + 1) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (♯‘𝑤) = (𝑁 + 2)))
75	74	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1)) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (♯‘𝑤) = (𝑁 + 2)))
76		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1)) → 𝑤 ∈ Word 𝑉)
77	75, 76	jctild 525	. . . . . . . . . . . . 13 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1)) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
78	77	3adant3 1132	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑤‘𝑖), (𝑤‘(𝑖 + 1))} ∈ 𝐸) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
79	65, 78	syl 17	. . . . . . . . . . 11 ⊢ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
80	79	com12 32	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
81	80	3adant1 1130	. . . . . . . . 9 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
82	5, 81	syl 17	. . . . . . . 8 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
83	82	adantr 480	. . . . . . 7 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
84	64, 83	impbid 212	. . . . . 6 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ↔ 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺)))
85	84	ex 412	. . . . 5 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ↔ 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
86	85	pm5.32rd 577	. . . 4 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) ↔ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))))
87	3, 86	bitrid 283	. . 3 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑤 ∈ Word 𝑉 ∧ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) ↔ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))))
88	87	rabbidva2 3445	. 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
89	1, 88	eqtrid 2792	1 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  {crab 3443  Vcvv 3488  ∅c0 4352  {cpr 4650   class class class wbr 5166  ‘cfv 6573  (class class class)co 7448  ℝcr 11183  0cc0 11184  1c1 11185   + caddc 11187   < clt 11324   − cmin 11520  2c2 12348  ℕ₀cn0 12553  ..^cfzo 13711  ♯chash 14379  Word cword 14562  lastSclsw 14610   ++ cconcat 14618  ⟨“cs1 14643   prefix cpfx 14718  Vtxcvtx 29031  Edgcedg 29082   WWalksN cwwlksn 29859

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-er 8763  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007  df-card 10008  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-2 12356  df-n0 12554  df-xnn0 12626  df-z 12640  df-uz 12904  df-fz 13568  df-fzo 13712  df-hash 14380  df-word 14563  df-lsw 14611  df-concat 14619  df-s1 14644  df-substr 14689  df-pfx 14719  df-wwlks 29863  df-wwlksn 29864

This theorem is referenced by:  wwlksnextsurj  29933  wwlksnextbij  29935