Theorem wwlksnextinj 29986

Description: Lemma for wwlksnextbij 29989. (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
wwlksnextinj	⊢ (𝑁 ∈ ℕ0 → 𝐹:𝐷–1-1→𝑅)

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

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

Proof of Theorem wwlksnextinj

Dummy variables 𝑑 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		wwlksnextbij0.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		wwlksnextbij0.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
3		wwlksnextbij0.d	. . 3 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
4		wwlksnextbij0.r	. . 3 ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}
5		wwlksnextbij0.f	. . 3 ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (lastS‘𝑡))
6	1, 2, 3, 4, 5	wwlksnextfun 29985	. 2 ⊢ (𝑁 ∈ ℕ0 → 𝐹:𝐷⟶𝑅)
7		fveq2 6828	. . . . . . 7 ⊢ (𝑡 = 𝑑 → (lastS‘𝑡) = (lastS‘𝑑))
8		fvex 6841	. . . . . . 7 ⊢ (lastS‘𝑑) ∈ V
9	7, 5, 8	fvmpt 6936	. . . . . 6 ⊢ (𝑑 ∈ 𝐷 → (𝐹‘𝑑) = (lastS‘𝑑))
10		fveq2 6828	. . . . . . 7 ⊢ (𝑡 = 𝑥 → (lastS‘𝑡) = (lastS‘𝑥))
11		fvex 6841	. . . . . . 7 ⊢ (lastS‘𝑥) ∈ V
12	10, 5, 11	fvmpt 6936	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → (𝐹‘𝑥) = (lastS‘𝑥))
13	9, 12	eqeqan12d 2753	. . . . 5 ⊢ ((𝑑 ∈ 𝐷 ∧ 𝑥 ∈ 𝐷) → ((𝐹‘𝑑) = (𝐹‘𝑥) ↔ (lastS‘𝑑) = (lastS‘𝑥)))
14	13	adantl 482	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑑 ∈ 𝐷 ∧ 𝑥 ∈ 𝐷)) → ((𝐹‘𝑑) = (𝐹‘𝑥) ↔ (lastS‘𝑑) = (lastS‘𝑥)))
15		fveqeq2 6837	. . . . . . . 8 ⊢ (𝑤 = 𝑑 → ((♯‘𝑤) = (𝑁 + 2) ↔ (♯‘𝑑) = (𝑁 + 2)))
16		oveq1 7364	. . . . . . . . 9 ⊢ (𝑤 = 𝑑 → (𝑤 prefix (𝑁 + 1)) = (𝑑 prefix (𝑁 + 1)))
17	16	eqeq1d 2741	. . . . . . . 8 ⊢ (𝑤 = 𝑑 → ((𝑤 prefix (𝑁 + 1)) = 𝑊 ↔ (𝑑 prefix (𝑁 + 1)) = 𝑊))
18		fveq2 6828	. . . . . . . . . 10 ⊢ (𝑤 = 𝑑 → (lastS‘𝑤) = (lastS‘𝑑))
19	18	preq2d 4673	. . . . . . . . 9 ⊢ (𝑤 = 𝑑 → {(lastS‘𝑊), (lastS‘𝑤)} = {(lastS‘𝑊), (lastS‘𝑑)})
20	19	eleq1d 2824	. . . . . . . 8 ⊢ (𝑤 = 𝑑 → ({(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸))
21	15, 17, 20	3anbi123d 1444	. . . . . . 7 ⊢ (𝑤 = 𝑑 → (((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
22	21, 3	elrab2 3632	. . . . . 6 ⊢ (𝑑 ∈ 𝐷 ↔ (𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
23		fveqeq2 6837	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → ((♯‘𝑤) = (𝑁 + 2) ↔ (♯‘𝑥) = (𝑁 + 2)))
24		oveq1 7364	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (𝑤 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)))
25	24	eqeq1d 2741	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → ((𝑤 prefix (𝑁 + 1)) = 𝑊 ↔ (𝑥 prefix (𝑁 + 1)) = 𝑊))
26		fveq2 6828	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → (lastS‘𝑤) = (lastS‘𝑥))
27	26	preq2d 4673	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → {(lastS‘𝑊), (lastS‘𝑤)} = {(lastS‘𝑊), (lastS‘𝑥)})
28	27	eleq1d 2824	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → ({(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))
29	23, 25, 28	3anbi123d 1444	. . . . . . 7 ⊢ (𝑤 = 𝑥 → (((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)))
30	29, 3	elrab2 3632	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)))
31		eqtr3 2761	. . . . . . . . . . . . . . . . 17 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ (♯‘𝑥) = (𝑁 + 2)) → (♯‘𝑑) = (♯‘𝑥))
32	31	expcom 414	. . . . . . . . . . . . . . . 16 ⊢ ((♯‘𝑥) = (𝑁 + 2) → ((♯‘𝑑) = (𝑁 + 2) → (♯‘𝑑) = (♯‘𝑥)))
33	32	3ad2ant1 1139	. . . . . . . . . . . . . . 15 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸) → ((♯‘𝑑) = (𝑁 + 2) → (♯‘𝑑) = (♯‘𝑥)))
34	33	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → ((♯‘𝑑) = (𝑁 + 2) → (♯‘𝑑) = (♯‘𝑥)))
35	34	com12 32	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑑) = (𝑁 + 2) → ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (♯‘𝑑) = (♯‘𝑥)))
36	35	3ad2ant1 1139	. . . . . . . . . . . 12 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸) → ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (♯‘𝑑) = (♯‘𝑥)))
37	36	adantl 482	. . . . . . . . . . 11 ⊢ ((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) → ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (♯‘𝑑) = (♯‘𝑥)))
38	37	imp 407	. . . . . . . . . 10 ⊢ (((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) → (♯‘𝑑) = (♯‘𝑥))
39	38	adantr 481	. . . . . . . . 9 ⊢ ((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) → (♯‘𝑑) = (♯‘𝑥))
40	39	adantr 481	. . . . . . . 8 ⊢ (((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) ∧ (lastS‘𝑑) = (lastS‘𝑥)) → (♯‘𝑑) = (♯‘𝑥))
41		simpr 485	. . . . . . . 8 ⊢ (((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) ∧ (lastS‘𝑑) = (lastS‘𝑥)) → (lastS‘𝑑) = (lastS‘𝑥))
42		eqtr3 2761	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊) → (𝑑 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)))
43		1e2m1 12295	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ 1 = (2 − 1)
44	43	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑁 ∈ ℕ0 → 1 = (2 − 1))
45	44	oveq2d 7373	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) = (𝑁 + (2 − 1)))
46		nn0cn 12439	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ)
47		2cnd 12251	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℂ)
48		1cnd 11131	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑁 ∈ ℕ0 → 1 ∈ ℂ)
49	46, 47, 48	addsubassd 11517	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 + 2) − 1) = (𝑁 + (2 − 1)))
50	45, 49	eqtr4d 2777	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) = ((𝑁 + 2) − 1))
51	50	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝑑) = (𝑁 + 2)) → (𝑁 + 1) = ((𝑁 + 2) − 1))
52		oveq1 7364	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((♯‘𝑑) = (𝑁 + 2) → ((♯‘𝑑) − 1) = ((𝑁 + 2) − 1))
53	52	eqeq2d 2750	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((♯‘𝑑) = (𝑁 + 2) → ((𝑁 + 1) = ((♯‘𝑑) − 1) ↔ (𝑁 + 1) = ((𝑁 + 2) − 1)))
54	53	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝑑) = (𝑁 + 2)) → ((𝑁 + 1) = ((♯‘𝑑) − 1) ↔ (𝑁 + 1) = ((𝑁 + 2) − 1)))
55	51, 54	mpbird 258	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝑑) = (𝑁 + 2)) → (𝑁 + 1) = ((♯‘𝑑) − 1))
56		oveq2 7365	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑁 + 1) = ((♯‘𝑑) − 1) → (𝑑 prefix (𝑁 + 1)) = (𝑑 prefix ((♯‘𝑑) − 1)))
57		oveq2 7365	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑁 + 1) = ((♯‘𝑑) − 1) → (𝑥 prefix (𝑁 + 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))
58	56, 57	eqeq12d 2755	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 + 1) = ((♯‘𝑑) − 1) → ((𝑑 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)) ↔ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))
59	55, 58	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝑑) = (𝑁 + 2)) → ((𝑑 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)) ↔ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))
60	59	biimpd 230	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝑑) = (𝑁 + 2)) → ((𝑑 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)) → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))
61	60	ex 413	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → ((♯‘𝑑) = (𝑁 + 2) → ((𝑑 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)) → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
62	61	com13 88	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑑 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)) → ((♯‘𝑑) = (𝑁 + 2) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
63	42, 62	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊) → ((♯‘𝑑) = (𝑁 + 2) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
64	63	ex 413	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑑 prefix (𝑁 + 1)) = 𝑊 → ((𝑥 prefix (𝑁 + 1)) = 𝑊 → ((♯‘𝑑) = (𝑁 + 2) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))))
65	64	com23 86	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑑 prefix (𝑁 + 1)) = 𝑊 → ((♯‘𝑑) = (𝑁 + 2) → ((𝑥 prefix (𝑁 + 1)) = 𝑊 → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))))
66	65	impcom 408	. . . . . . . . . . . . . . . 16 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊) → ((𝑥 prefix (𝑁 + 1)) = 𝑊 → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
67	66	com12 32	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 prefix (𝑁 + 1)) = 𝑊 → (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
68	67	3ad2ant2 1140	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸) → (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
69	68	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
70	69	com12 32	. . . . . . . . . . . 12 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊) → ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
71	70	3adant3 1138	. . . . . . . . . . 11 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸) → ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
72	71	adantl 482	. . . . . . . . . 10 ⊢ ((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) → ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (𝑁 ∈ ℕ0 → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
73	72	imp31 418	. . . . . . . . 9 ⊢ ((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))
74	73	adantr 481	. . . . . . . 8 ⊢ (((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) ∧ (lastS‘𝑑) = (lastS‘𝑥)) → (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))
75		simpl 483	. . . . . . . . . . . . 13 ⊢ ((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) → 𝑑 ∈ Word 𝑉)
76		simpl 483	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → 𝑥 ∈ Word 𝑉)
77	75, 76	anim12i 619	. . . . . . . . . . . 12 ⊢ (((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) → (𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉))
78	77	adantr 481	. . . . . . . . . . 11 ⊢ ((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) → (𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉))
79		nn0re 12438	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ)
80		2re 12247	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 2 ∈ ℝ
81	80	a1i 11	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℝ)
82		nn0ge0 12454	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁)
83		2pos 12276	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ 0 < 2
84	83	a1i 11	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ0 → 0 < 2)
85	79, 81, 82, 84	addgegt0d 11715	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ0 → 0 < (𝑁 + 2))
86	85	adantl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0) → 0 < (𝑁 + 2))
87		breq2 5077	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘𝑑) = (𝑁 + 2) → (0 < (♯‘𝑑) ↔ 0 < (𝑁 + 2)))
88	87	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0) → (0 < (♯‘𝑑) ↔ 0 < (𝑁 + 2)))
89	86, 88	mpbird 258	. . . . . . . . . . . . . . . . . 18 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0) → 0 < (♯‘𝑑))
90		hashgt0n0 14319	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑑 ∈ Word 𝑉 ∧ 0 < (♯‘𝑑)) → 𝑑 ≠ ∅)
91	89, 90	sylan2 599	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0)) → 𝑑 ≠ ∅)
92	91	exp32 421	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 ∈ Word 𝑉 → ((♯‘𝑑) = (𝑁 + 2) → (𝑁 ∈ ℕ0 → 𝑑 ≠ ∅)))
93	92	com12 32	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑑) = (𝑁 + 2) → (𝑑 ∈ Word 𝑉 → (𝑁 ∈ ℕ0 → 𝑑 ≠ ∅)))
94	93	3ad2ant1 1139	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸) → (𝑑 ∈ Word 𝑉 → (𝑁 ∈ ℕ0 → 𝑑 ≠ ∅)))
95	94	impcom 408	. . . . . . . . . . . . 13 ⊢ ((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) → (𝑁 ∈ ℕ0 → 𝑑 ≠ ∅))
96	95	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) → (𝑁 ∈ ℕ0 → 𝑑 ≠ ∅))
97	96	imp 407	. . . . . . . . . . 11 ⊢ ((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) → 𝑑 ≠ ∅)
98	85	adantl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0) → 0 < (𝑁 + 2))
99		breq2 5077	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘𝑥) = (𝑁 + 2) → (0 < (♯‘𝑥) ↔ 0 < (𝑁 + 2)))
100	99	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0) → (0 < (♯‘𝑥) ↔ 0 < (𝑁 + 2)))
101	98, 100	mpbird 258	. . . . . . . . . . . . . . . . . 18 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0) → 0 < (♯‘𝑥))
102		hashgt0n0 14319	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ Word 𝑉 ∧ 0 < (♯‘𝑥)) → 𝑥 ≠ ∅)
103	101, 102	sylan2 599	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑁 ∈ ℕ0)) → 𝑥 ≠ ∅)
104	103	exp32 421	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ Word 𝑉 → ((♯‘𝑥) = (𝑁 + 2) → (𝑁 ∈ ℕ0 → 𝑥 ≠ ∅)))
105	104	com12 32	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝑥) = (𝑁 + 2) → (𝑥 ∈ Word 𝑉 → (𝑁 ∈ ℕ0 → 𝑥 ≠ ∅)))
106	105	3ad2ant1 1139	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸) → (𝑥 ∈ Word 𝑉 → (𝑁 ∈ ℕ0 → 𝑥 ≠ ∅)))
107	106	impcom 408	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸)) → (𝑁 ∈ ℕ0 → 𝑥 ≠ ∅))
108	107	adantl 482	. . . . . . . . . . . 12 ⊢ (((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) → (𝑁 ∈ ℕ0 → 𝑥 ≠ ∅))
109	108	imp 407	. . . . . . . . . . 11 ⊢ ((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) → 𝑥 ≠ ∅)
110	78, 97, 109	jca32 520	. . . . . . . . . 10 ⊢ ((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) → ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)))
111	110	adantr 481	. . . . . . . . 9 ⊢ (((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) ∧ (lastS‘𝑑) = (lastS‘𝑥)) → ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)))
112		simpl 483	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) → 𝑑 ∈ Word 𝑉)
113	112	adantr 481	. . . . . . . . . . 11 ⊢ (((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)) → 𝑑 ∈ Word 𝑉)
114		simpr 485	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) → 𝑥 ∈ Word 𝑉)
115	114	adantr 481	. . . . . . . . . . 11 ⊢ (((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)) → 𝑥 ∈ Word 𝑉)
116		hashneq0 14318	. . . . . . . . . . . . . . . 16 ⊢ (𝑑 ∈ Word 𝑉 → (0 < (♯‘𝑑) ↔ 𝑑 ≠ ∅))
117	116	biimprd 249	. . . . . . . . . . . . . . 15 ⊢ (𝑑 ∈ Word 𝑉 → (𝑑 ≠ ∅ → 0 < (♯‘𝑑)))
118	117	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) → (𝑑 ≠ ∅ → 0 < (♯‘𝑑)))
119	118	com12 32	. . . . . . . . . . . . 13 ⊢ (𝑑 ≠ ∅ → ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) → 0 < (♯‘𝑑)))
120	119	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅) → ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) → 0 < (♯‘𝑑)))
121	120	impcom 408	. . . . . . . . . . 11 ⊢ (((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)) → 0 < (♯‘𝑑))
122		pfxsuff1eqwrdeq 14653	. . . . . . . . . . 11 ⊢ ((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉 ∧ 0 < (♯‘𝑑)) → (𝑑 = 𝑥 ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ ((𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)) ∧ (lastS‘𝑑) = (lastS‘𝑥)))))
123	113, 115, 121, 122	syl3anc 1379	. . . . . . . . . 10 ⊢ (((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)) → (𝑑 = 𝑥 ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ ((𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)) ∧ (lastS‘𝑑) = (lastS‘𝑥)))))
124		ancom 461	. . . . . . . . . . . 12 ⊢ (((𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)) ∧ (lastS‘𝑑) = (lastS‘𝑥)) ↔ ((lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))
125	124	anbi2i 629	. . . . . . . . . . 11 ⊢ (((♯‘𝑑) = (♯‘𝑥) ∧ ((𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)) ∧ (lastS‘𝑑) = (lastS‘𝑥))) ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ ((lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
126		3anass 1100	. . . . . . . . . . 11 ⊢ (((♯‘𝑑) = (♯‘𝑥) ∧ (lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))) ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ ((lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
127	125, 126	bitr4i 279	. . . . . . . . . 10 ⊢ (((♯‘𝑑) = (♯‘𝑥) ∧ ((𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)) ∧ (lastS‘𝑑) = (lastS‘𝑥))) ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ (lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1))))
128	123, 127	bitrdi 288	. . . . . . . . 9 ⊢ (((𝑑 ∈ Word 𝑉 ∧ 𝑥 ∈ Word 𝑉) ∧ (𝑑 ≠ ∅ ∧ 𝑥 ≠ ∅)) → (𝑑 = 𝑥 ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ (lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
129	111, 128	syl 17	. . . . . . . 8 ⊢ (((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) ∧ (lastS‘𝑑) = (lastS‘𝑥)) → (𝑑 = 𝑥 ↔ ((♯‘𝑑) = (♯‘𝑥) ∧ (lastS‘𝑑) = (lastS‘𝑥) ∧ (𝑑 prefix ((♯‘𝑑) − 1)) = (𝑥 prefix ((♯‘𝑑) − 1)))))
130	40, 41, 74, 129	mpbir3and 1349	. . . . . . 7 ⊢ (((((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) ∧ 𝑁 ∈ ℕ0) ∧ (lastS‘𝑑) = (lastS‘𝑥)) → 𝑑 = 𝑥)
131	130	exp31 420	. . . . . 6 ⊢ (((𝑑 ∈ Word 𝑉 ∧ ((♯‘𝑑) = (𝑁 + 2) ∧ (𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ (𝑥 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑥)} ∈ 𝐸))) → (𝑁 ∈ ℕ0 → ((lastS‘𝑑) = (lastS‘𝑥) → 𝑑 = 𝑥)))
132	22, 30, 131	syl2anb 604	. . . . 5 ⊢ ((𝑑 ∈ 𝐷 ∧ 𝑥 ∈ 𝐷) → (𝑁 ∈ ℕ0 → ((lastS‘𝑑) = (lastS‘𝑥) → 𝑑 = 𝑥)))
133	132	impcom 408	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑑 ∈ 𝐷 ∧ 𝑥 ∈ 𝐷)) → ((lastS‘𝑑) = (lastS‘𝑥) → 𝑑 = 𝑥))
134	14, 133	sylbid 241	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑑 ∈ 𝐷 ∧ 𝑥 ∈ 𝐷)) → ((𝐹‘𝑑) = (𝐹‘𝑥) → 𝑑 = 𝑥))
135	134	ralrimivva 3182	. 2 ⊢ (𝑁 ∈ ℕ0 → ∀𝑑 ∈ 𝐷 ∀𝑥 ∈ 𝐷 ((𝐹‘𝑑) = (𝐹‘𝑥) → 𝑑 = 𝑥))
136		dff13 7199	. 2 ⊢ (𝐹:𝐷–1-1→𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑑 ∈ 𝐷 ∀𝑥 ∈ 𝐷 ((𝐹‘𝑑) = (𝐹‘𝑥) → 𝑑 = 𝑥)))
137	6, 135, 136	sylanbrc 589	1 ⊢ (𝑁 ∈ ℕ0 → 𝐹:𝐷–1-1→𝑅)

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119   ≠ wne 2934  ∀wral 3053  {crab 3391  ∅c0 4262  {cpr 4558   class class class wbr 5073   ↦ cmpt 5154  ⟶wf 6482  –1-1→wf1 6483  ‘cfv 6486  (class class class)co 7357  ℝcr 11029  0cc0 11030  1c1 11031   + caddc 11033   < clt 11171   − cmin 11369  2c2 12228  ℕ₀cn0 12429  ♯chash 14284  Word cword 14467  lastSclsw 14516   prefix cpfx 14625  Vtxcvtx 29084  Edgcedg 29135

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5200  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-int 4879  df-iun 4924  df-br 5074  df-opab 5136  df-mpt 5155  df-tr 5181  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7314  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7808  df-1st 7932  df-2nd 7933  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-er 8634  df-en 8885  df-dom 8886  df-sdom 8887  df-fin 8888  df-card 9855  df-pnf 11173  df-mnf 11174  df-xr 11175  df-ltxr 11176  df-le 11177  df-sub 11371  df-neg 11372  df-nn 12167  df-2 12236  df-n0 12430  df-xnn0 12503  df-z 12517  df-uz 12781  df-fz 13454  df-fzo 13601  df-hash 14285  df-word 14468  df-lsw 14517  df-s1 14551  df-substr 14596  df-pfx 14626

This theorem is referenced by:  wwlksnextbij0  29988