Theorem wwlksnextbi 28839

Description: Extension of a walk (as word) by adding an edge/vertex. (Contributed by Alexander van der Vekens, 5-Aug-2018.) (Revised by AV, 16-Apr-2021.) (Proof shortened by AV, 27-Oct-2022.)

Hypotheses

Ref	Expression
wwlksnext.v	⊢ 𝑉 = (Vtx‘𝐺)
wwlksnext.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
wwlksnextbi	⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ 𝑇 ∈ (𝑁 WWalksN 𝐺)))

Proof of Theorem wwlksnextbi

Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		wwlksnext.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
2		wwlksnext.e	. . . . 5 ⊢ 𝐸 = (Edg‘𝐺)
3	1, 2	wwlknp 28788	. . . 4 ⊢ (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
4		wwlksnred 28837	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑊 prefix (𝑁 + 1)) ∈ (𝑁 WWalksN 𝐺)))
5	4	ad2antrr 724	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (𝑊 prefix (𝑁 + 1)) ∈ (𝑁 WWalksN 𝐺)))
6		fveqeq2 6851	. . . . . . . . . . . . . . . 16 ⊢ (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → ((♯‘𝑊) = ((𝑁 + 1) + 1) ↔ (♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1)))
7	6	3ad2ant2 1134	. . . . . . . . . . . . . . 15 ⊢ ((𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → ((♯‘𝑊) = ((𝑁 + 1) + 1) ↔ (♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1)))
8	7	adantl 482	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → ((♯‘𝑊) = ((𝑁 + 1) + 1) ↔ (♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1)))
9		s1cl 14490	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑆 ∈ 𝑉 → ⟨“𝑆”⟩ ∈ Word 𝑉)
10	9	adantl 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) → ⟨“𝑆”⟩ ∈ Word 𝑉)
11	10	anim1ci 616	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (𝑇 ∈ Word 𝑉 ∧ ⟨“𝑆”⟩ ∈ Word 𝑉))
12		ccatlen 14463	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑇 ∈ Word 𝑉 ∧ ⟨“𝑆”⟩ ∈ Word 𝑉) → (♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((♯‘𝑇) + (♯‘⟨“𝑆”⟩)))
13	11, 12	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((♯‘𝑇) + (♯‘⟨“𝑆”⟩)))
14	13	eqeq1d 2738	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → ((♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1) ↔ ((♯‘𝑇) + (♯‘⟨“𝑆”⟩)) = ((𝑁 + 1) + 1)))
15		s1len 14494	. . . . . . . . . . . . . . . . . . . 20 ⊢ (♯‘⟨“𝑆”⟩) = 1
16	15	a1i 11	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (♯‘⟨“𝑆”⟩) = 1)
17	16	oveq2d 7373	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → ((♯‘𝑇) + (♯‘⟨“𝑆”⟩)) = ((♯‘𝑇) + 1))
18	17	eqeq1d 2738	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (((♯‘𝑇) + (♯‘⟨“𝑆”⟩)) = ((𝑁 + 1) + 1) ↔ ((♯‘𝑇) + 1) = ((𝑁 + 1) + 1)))
19		lencl 14421	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ Word 𝑉 → (♯‘𝑇) ∈ ℕ0)
20	19	nn0cnd 12475	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑇 ∈ Word 𝑉 → (♯‘𝑇) ∈ ℂ)
21	20	adantl 482	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (♯‘𝑇) ∈ ℂ)
22		peano2nn0 12453	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
23	22	nn0cnd 12475	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℂ)
24	23	ad2antrr 724	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (𝑁 + 1) ∈ ℂ)
25		1cnd 11150	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → 1 ∈ ℂ)
26	21, 24, 25	addcan2d 11359	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → (((♯‘𝑇) + 1) = ((𝑁 + 1) + 1) ↔ (♯‘𝑇) = (𝑁 + 1)))
27	14, 18, 26	3bitrd 304	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → ((♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1) ↔ (♯‘𝑇) = (𝑁 + 1)))
28		oveq2 7365	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 + 1) = (♯‘𝑇) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = ((𝑇 ++ ⟨“𝑆”⟩) prefix (♯‘𝑇)))
29	28	eqcoms 2744	. . . . . . . . . . . . . . . . . 18 ⊢ ((♯‘𝑇) = (𝑁 + 1) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = ((𝑇 ++ ⟨“𝑆”⟩) prefix (♯‘𝑇)))
30		pfxccat1 14590	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑇 ∈ Word 𝑉 ∧ ⟨“𝑆”⟩ ∈ Word 𝑉) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (♯‘𝑇)) = 𝑇)
31	11, 30	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (♯‘𝑇)) = 𝑇)
32	29, 31	sylan9eqr 2798	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) ∧ (♯‘𝑇) = (𝑁 + 1)) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇)
33	32	ex 413	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → ((♯‘𝑇) = (𝑁 + 1) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
34	27, 33	sylbid 239	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ 𝑇 ∈ Word 𝑉) → ((♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
35	34	3ad2antr1 1188	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → ((♯‘(𝑇 ++ ⟨“𝑆”⟩)) = ((𝑁 + 1) + 1) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
36	8, 35	sylbid 239	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → ((♯‘𝑊) = ((𝑁 + 1) + 1) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
37	36	imp 407	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇)
38		oveq1 7364	. . . . . . . . . . . . . . 15 ⊢ (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → (𝑊 prefix (𝑁 + 1)) = ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)))
39	38	eqeq1d 2738	. . . . . . . . . . . . . 14 ⊢ (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → ((𝑊 prefix (𝑁 + 1)) = 𝑇 ↔ ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
40	39	3ad2ant2 1134	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → ((𝑊 prefix (𝑁 + 1)) = 𝑇 ↔ ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
41	40	ad2antlr 725	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → ((𝑊 prefix (𝑁 + 1)) = 𝑇 ↔ ((𝑇 ++ ⟨“𝑆”⟩) prefix (𝑁 + 1)) = 𝑇))
42	37, 41	mpbird 256	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → (𝑊 prefix (𝑁 + 1)) = 𝑇)
43	42	eleq1d 2822	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → ((𝑊 prefix (𝑁 + 1)) ∈ (𝑁 WWalksN 𝐺) ↔ 𝑇 ∈ (𝑁 WWalksN 𝐺)))
44	43	biimpd 228	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) ∧ (♯‘𝑊) = ((𝑁 + 1) + 1)) → ((𝑊 prefix (𝑁 + 1)) ∈ (𝑁 WWalksN 𝐺) → 𝑇 ∈ (𝑁 WWalksN 𝐺)))
45	44	ex 413	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → ((♯‘𝑊) = ((𝑁 + 1) + 1) → ((𝑊 prefix (𝑁 + 1)) ∈ (𝑁 WWalksN 𝐺) → 𝑇 ∈ (𝑁 WWalksN 𝐺))))
46	45	com23 86	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → ((𝑊 prefix (𝑁 + 1)) ∈ (𝑁 WWalksN 𝐺) → ((♯‘𝑊) = ((𝑁 + 1) + 1) → 𝑇 ∈ (𝑁 WWalksN 𝐺))))
47	5, 46	syld 47	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → ((♯‘𝑊) = ((𝑁 + 1) + 1) → 𝑇 ∈ (𝑁 WWalksN 𝐺))))
48	47	com13 88	. . . . 5 ⊢ ((♯‘𝑊) = ((𝑁 + 1) + 1) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → 𝑇 ∈ (𝑁 WWalksN 𝐺))))
49	48	3ad2ant2 1134	. . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = ((𝑁 + 1) + 1) ∧ ∀𝑖 ∈ (0..^(𝑁 + 1)){(𝑊‘𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → 𝑇 ∈ (𝑁 WWalksN 𝐺))))
50	3, 49	mpcom 38	. . 3 ⊢ (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → 𝑇 ∈ (𝑁 WWalksN 𝐺)))
51	50	com12 32	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) → 𝑇 ∈ (𝑁 WWalksN 𝐺)))
52	1, 2	wwlksnext 28838	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑆 ∈ 𝑉 ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → (𝑇 ++ ⟨“𝑆”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
53		eleq1 2825	. . . . . . . . . . 11 ⊢ (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ (𝑇 ++ ⟨“𝑆”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺)))
54	52, 53	syl5ibrcom 246	. . . . . . . . . 10 ⊢ ((𝑇 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑆 ∈ 𝑉 ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)))
55	54	3exp 1119	. . . . . . . . 9 ⊢ (𝑇 ∈ (𝑁 WWalksN 𝐺) → (𝑆 ∈ 𝑉 → ({(lastS‘𝑇), 𝑆} ∈ 𝐸 → (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)))))
56	55	com23 86	. . . . . . . 8 ⊢ (𝑇 ∈ (𝑁 WWalksN 𝐺) → ({(lastS‘𝑇), 𝑆} ∈ 𝐸 → (𝑆 ∈ 𝑉 → (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)))))
57	56	com14 96	. . . . . . 7 ⊢ (𝑊 = (𝑇 ++ ⟨“𝑆”⟩) → ({(lastS‘𝑇), 𝑆} ∈ 𝐸 → (𝑆 ∈ 𝑉 → (𝑇 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)))))
58	57	imp 407	. . . . . 6 ⊢ ((𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → (𝑆 ∈ 𝑉 → (𝑇 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))))
59	58	3adant1 1130	. . . . 5 ⊢ ((𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → (𝑆 ∈ 𝑉 → (𝑇 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))))
60	59	com12 32	. . . 4 ⊢ (𝑆 ∈ 𝑉 → ((𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → (𝑇 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))))
61	60	adantl 482	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) → ((𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸) → (𝑇 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺))))
62	61	imp 407	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → (𝑇 ∈ (𝑁 WWalksN 𝐺) → 𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺)))
63	51, 62	impbid 211	1 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ 𝑉) ∧ (𝑇 ∈ Word 𝑉 ∧ 𝑊 = (𝑇 ++ ⟨“𝑆”⟩) ∧ {(lastS‘𝑇), 𝑆} ∈ 𝐸)) → (𝑊 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ 𝑇 ∈ (𝑁 WWalksN 𝐺)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3064  {cpr 4588  ‘cfv 6496  (class class class)co 7357  ℂcc 11049  0cc0 11051  1c1 11052   + caddc 11054  ℕ₀cn0 12413  ..^cfzo 13567  ♯chash 14230  Word cword 14402  lastSclsw 14450   ++ cconcat 14458  ⟨“cs1 14483   prefix cpfx 14558  Vtxcvtx 27947  Edgcedg 27998   WWalksN cwwlksn 28771

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-map 8767  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-n0 12414  df-z 12500  df-uz 12764  df-fz 13425  df-fzo 13568  df-hash 14231  df-word 14403  df-lsw 14451  df-concat 14459  df-s1 14484  df-substr 14529  df-pfx 14559  df-wwlks 28775  df-wwlksn 28776

This theorem is referenced by:  wwlksnextwrd  28842