Theorem wwlksnextwrd 30368

Description: Lemma for wwlksnextbij 30373. (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 1111	. . . . 5 ⊢ (((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((♯‘𝑤) = (𝑁 + 2) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)))
3	2	bianass 655	. . . 4 ⊢ ((𝑤 ∈ Word 𝑉 ∧ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) ↔ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)))
4		wwlksnextbij0.v	. . . . . . . . . . 11 ⊢ 𝑉 = (Vtx‘𝐺)
5	4	wwlknbp 30313	. . . . . . . . . 10 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉))
6		simpl 488	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → 𝑁 ∈ ℕ0)
7		simpl 488	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → 𝑤 ∈ Word 𝑉)
8		nn0re 12540	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ)
9		2re 12342	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 2 ∈ ℝ
10	9	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ)
11		nn0ge0 12556	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁)
12		2pos 12372	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 < 2
13	12	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 0 < 2)
14	8, 10, 11, 13	addgegt0d 11814	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ0 → 0 < (𝑁 + 2))
15	14	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → 0 < (𝑁 + 2))
16		breq2 5107	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘𝑤) = (𝑁 + 2) → (0 < (♯‘𝑤) ↔ 0 < (𝑁 + 2)))
17	16	ad2antll 742	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → (0 < (♯‘𝑤) ↔ 0 < (𝑁 + 2)))
18	15, 17	mpbird 260	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → 0 < (♯‘𝑤))
19		hashgt0n0 14432	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∈ Word 𝑉 ∧ 0 < (♯‘𝑤)) → 𝑤 ≠ ∅)
20	7, 18, 19	syl2an2 699	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → 𝑤 ≠ ∅)
21		lswcl 14636	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ Word 𝑉 ∧ 𝑤 ≠ ∅) → (lastS‘𝑤) ∈ 𝑉)
22	7, 20, 21	syl2an2 699	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → (lastS‘𝑤) ∈ 𝑉)
23	22	adantrr 730	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → (lastS‘𝑤) ∈ 𝑉)
24		pfxcl 14750	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑤 ∈ Word 𝑉 → (𝑤 prefix (𝑁 + 1)) ∈ Word 𝑉)
25		eleq1 2848	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑊 = (𝑤 prefix (𝑁 + 1)) → (𝑊 ∈ Word 𝑉 ↔ (𝑤 prefix (𝑁 + 1)) ∈ Word 𝑉))
26	24, 25	imbitrrid 249	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑊 = (𝑤 prefix (𝑁 + 1)) → (𝑤 ∈ Word 𝑉 → 𝑊 ∈ Word 𝑉))
27	26	eqcoms 2768	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑤 prefix (𝑁 + 1)) = 𝑊 → (𝑤 ∈ Word 𝑉 → 𝑊 ∈ Word 𝑉))
28	27	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → (𝑤 ∈ Word 𝑉 → 𝑊 ∈ Word 𝑉))
29	28	com12 33	. . . . . . . . . . . . . . . . 17 ⊢ (𝑤 ∈ Word 𝑉 → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → 𝑊 ∈ Word 𝑉))
30	29	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → 𝑊 ∈ Word 𝑉))
31	30	imp 412	. . . . . . . . . . . . . . 15 ⊢ (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑊 ∈ Word 𝑉)
32	31	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → 𝑊 ∈ Word 𝑉)
33		oveq1 7421	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑊 = (𝑤 prefix (𝑁 + 1)) → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
34	33	eqcoms 2768	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 prefix (𝑁 + 1)) = 𝑊 → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
35	34	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
36	35	ad2antll 742	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
37		oveq1 7421	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((♯‘𝑤) = (𝑁 + 2) → ((♯‘𝑤) − 1) = ((𝑁 + 2) − 1))
38	37	adantl 487	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → ((♯‘𝑤) − 1) = ((𝑁 + 2) − 1))
39		nn0cn 12541	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ)
40		2cnd 12346	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℂ)
41		1cnd 11229	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℂ)
42	39, 40, 41	addsubassd 11616	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 2) − 1) = (𝑁 + (2 − 1)))
43		2m1e1 12392	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (2 − 1) = 1
44	43	a1i 11	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ ℕ0 → (2 − 1) = 1)
45	44	oveq2d 7430	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (2 − 1)) = (𝑁 + 1))
46	42, 45	eqtrd 2795	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 2) − 1) = (𝑁 + 1))
47	38, 46	sylan9eqr 2817	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((♯‘𝑤) − 1) = (𝑁 + 1))
48	47	oveq2d 7430	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → (𝑤 prefix ((♯‘𝑤) − 1)) = (𝑤 prefix (𝑁 + 1)))
49	48	oveq1d 7429	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((𝑤 prefix ((♯‘𝑤) − 1)) ++ ⟨“(lastS‘𝑤)”⟩) = ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩))
50		pfxlswccat 14785	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑤 ∈ Word 𝑉 ∧ 𝑤 ≠ ∅) → ((𝑤 prefix ((♯‘𝑤) − 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
51	7, 20, 50	syl2an2 699	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((𝑤 prefix ((♯‘𝑤) − 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
52	49, 51	eqtr3d 2797	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))) → ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
53	52	adantrr 730	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → ((𝑤 prefix (𝑁 + 1)) ++ ⟨“(lastS‘𝑤)”⟩) = 𝑤)
54	36, 53	eqtr2d 2796	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → 𝑤 = (𝑊 ++ ⟨“(lastS‘𝑤)”⟩))
55		simprrr 794	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)
56		wwlksnextbij0.e	. . . . . . . . . . . . . . 15 ⊢ 𝐸 = (Edg‘𝐺)
57	4, 56	wwlksnextbi 30365	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ0 ∧ (lastS‘𝑤) ∈ 𝑉) ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑤 = (𝑊 ++ ⟨“(lastS‘𝑤)”⟩) ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ 𝑊 ∈ (𝑁 WWalksN 𝐺)))
58	6, 23, 32, 54, 55, 57	syl23anc 1404	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ0 ∧ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ 𝑊 ∈ (𝑁 WWalksN 𝐺)))
59	58	exbiri 823	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
60	59	com23 87	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
61	60	3ad2ant2 1152	. . . . . . . . . 10 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
62	5, 61	mpcom 39	. . . . . . . . 9 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺)))
63	62	expcomd 422	. . . . . . . 8 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
64	63	imp 412	. . . . . . 7 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) → 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺)))
65	4, 56	wwlknp 30314	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑤‘𝑖), (𝑤‘(𝑖 + 1))} ∈ 𝐸))
66	39, 41, 41	addassd 11258	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1)))
67		1p1e2 12391	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (1 + 1) = 2
68	67	a1i 11	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → (1 + 1) = 2)
69	68	oveq2d 7430	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + (1 + 1)) = (𝑁 + 2))
70	66, 69	eqtrd 2795	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 1) + 1) = (𝑁 + 2))
71	70	eqeq2d 2771	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ ℕ0 → ((♯‘𝑤) = ((𝑁 + 1) + 1) ↔ (♯‘𝑤) = (𝑁 + 2)))
72	71	biimpd 232	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℕ0 → ((♯‘𝑤) = ((𝑁 + 1) + 1) → (♯‘𝑤) = (𝑁 + 2)))
73	72	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → ((♯‘𝑤) = ((𝑁 + 1) + 1) → (♯‘𝑤) = (𝑁 + 2)))
74	73	com12 33	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑤) = ((𝑁 + 1) + 1) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (♯‘𝑤) = (𝑁 + 2)))
75	74	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1)) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (♯‘𝑤) = (𝑁 + 2)))
76		simpl 488	. . . . . . . . . . . . . 14 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1)) → 𝑤 ∈ Word 𝑉)
77	75, 76	jctild 535	. . . . . . . . . . . . 13 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1)) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
78	77	3adant3 1150	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑤‘𝑖), (𝑤‘(𝑖 + 1))} ∈ 𝐸) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
79	65, 78	syl 18	. . . . . . . . . . 11 ⊢ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
80	79	com12 33	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
81	80	3adant1 1148	. . . . . . . . 9 ⊢ ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0 ∧ 𝑊 ∈ Word 𝑉) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
82	5, 81	syl 18	. . . . . . . 8 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
83	82	adantr 486	. . . . . . 7 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2))))
84	64, 83	impbid 215	. . . . . 6 ⊢ ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ↔ 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺)))
85	84	ex 418	. . . . 5 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) → ((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ↔ 𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺))))
86	85	pm5.32rd 589	. . . 4 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → (((𝑤 ∈ Word 𝑉 ∧ (♯‘𝑤) = (𝑁 + 2)) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) ↔ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))))
87	3, 86	bitrid 286	. . 3 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑤 ∈ Word 𝑉 ∧ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)) ↔ (𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸))))
88	87	rabbidva2 3414	. 2 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
89	1, 88	eqtrid 2807	1 ⊢ (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076  {crab 3412  Vcvv 3450  ∅c0 4279  {cpr 4586   class class class wbr 5103  ‘cfv 6533  (class class class)co 7414  ℝcr 11126  0cc0 11127  1c1 11128   + caddc 11130   < clt 11270   − cmin 11468  2c2 12322  ℕ₀cn0 12531  ..^cfzo 13712  ♯chash 14397  Word cword 14581  lastSclsw 14630   ++ cconcat 14638  ⟨“cs1 14665   prefix cpfx 14743  Vtxcvtx 29456  Edgcedg 29507   WWalksN cwwlksn 30297

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8458  df-er 8699  df-map 8831  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-card 9947  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-n0 12532  df-xnn0 12605  df-z 12619  df-uz 12891  df-fz 13565  df-fzo 13713  df-hash 14398  df-word 14582  df-lsw 14631  df-concat 14639  df-s1 14666  df-substr 14712  df-pfx 14744  df-wwlks 30301  df-wwlksn 30302

This theorem is used by:  wwlksnextsurj  30371  wwlksnextbij  30373