Theorem wwlktovf1 14600

Description: Lemma 2 for wrd2f1tovbij 14603. (Contributed by Alexander van der Vekens, 27-Jul-2018.)

Hypotheses

Ref	Expression
wwlktovf1o.d	⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}
wwlktovf1o.r	⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋}
wwlktovf1o.f	⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡‘1))

Assertion

Ref	Expression
wwlktovf1	⊢ 𝐹:𝐷–1-1→𝑅

Distinct variable groups:   𝑡,𝐷   𝑃,𝑛,𝑡,𝑤   𝑡,𝑅   𝑛,𝑉,𝑡,𝑤   𝑛,𝑋,𝑤

Allowed substitution hints:   𝐷(𝑤,𝑛)   𝑅(𝑤,𝑛)   𝐹(𝑤,𝑡,𝑛)   𝑋(𝑡)

Proof of Theorem wwlktovf1

Dummy variables 𝑥 𝑦 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		wwlktovf1o.d	. . 3 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}
2		wwlktovf1o.r	. . 3 ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋}
3		wwlktovf1o.f	. . 3 ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡‘1))
4	1, 2, 3	wwlktovf 14599	. 2 ⊢ 𝐹:𝐷⟶𝑅
5		fveq1 6755	. . . . . 6 ⊢ (𝑡 = 𝑥 → (𝑡‘1) = (𝑥‘1))
6		fvex 6769	. . . . . 6 ⊢ (𝑥‘1) ∈ V
7	5, 3, 6	fvmpt 6857	. . . . 5 ⊢ (𝑥 ∈ 𝐷 → (𝐹‘𝑥) = (𝑥‘1))
8		fveq1 6755	. . . . . 6 ⊢ (𝑡 = 𝑦 → (𝑡‘1) = (𝑦‘1))
9		fvex 6769	. . . . . 6 ⊢ (𝑦‘1) ∈ V
10	8, 3, 9	fvmpt 6857	. . . . 5 ⊢ (𝑦 ∈ 𝐷 → (𝐹‘𝑦) = (𝑦‘1))
11	7, 10	eqeqan12d 2752	. . . 4 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝑥‘1) = (𝑦‘1)))
12		fveqeq2 6765	. . . . . . 7 ⊢ (𝑤 = 𝑥 → ((♯‘𝑤) = 2 ↔ (♯‘𝑥) = 2))
13		fveq1 6755	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → (𝑤‘0) = (𝑥‘0))
14	13	eqeq1d 2740	. . . . . . 7 ⊢ (𝑤 = 𝑥 → ((𝑤‘0) = 𝑃 ↔ (𝑥‘0) = 𝑃))
15		fveq1 6755	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (𝑤‘1) = (𝑥‘1))
16	13, 15	preq12d 4674	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → {(𝑤‘0), (𝑤‘1)} = {(𝑥‘0), (𝑥‘1)})
17	16	eleq1d 2823	. . . . . . 7 ⊢ (𝑤 = 𝑥 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋))
18	12, 14, 17	3anbi123d 1434	. . . . . 6 ⊢ (𝑤 = 𝑥 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)))
19	18, 1	elrab2 3620	. . . . 5 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)))
20		fveqeq2 6765	. . . . . . 7 ⊢ (𝑤 = 𝑦 → ((♯‘𝑤) = 2 ↔ (♯‘𝑦) = 2))
21		fveq1 6755	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (𝑤‘0) = (𝑦‘0))
22	21	eqeq1d 2740	. . . . . . 7 ⊢ (𝑤 = 𝑦 → ((𝑤‘0) = 𝑃 ↔ (𝑦‘0) = 𝑃))
23		fveq1 6755	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝑤‘1) = (𝑦‘1))
24	21, 23	preq12d 4674	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → {(𝑤‘0), (𝑤‘1)} = {(𝑦‘0), (𝑦‘1)})
25	24	eleq1d 2823	. . . . . . 7 ⊢ (𝑤 = 𝑦 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))
26	20, 22, 25	3anbi123d 1434	. . . . . 6 ⊢ (𝑤 = 𝑦 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)))
27	26, 1	elrab2 3620	. . . . 5 ⊢ (𝑦 ∈ 𝐷 ↔ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)))
28		simpr1 1192	. . . . . . . . 9 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) → (♯‘𝑥) = 2)
29		simpr1 1192	. . . . . . . . . 10 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → (♯‘𝑦) = 2)
30	29	eqcomd 2744	. . . . . . . . 9 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → 2 = (♯‘𝑦))
31	28, 30	sylan9eq 2799	. . . . . . . 8 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → (♯‘𝑥) = (♯‘𝑦))
32	31	adantr 480	. . . . . . 7 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (♯‘𝑥) = (♯‘𝑦))
33		simpr2 1193	. . . . . . . . . 10 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) → (𝑥‘0) = 𝑃)
34		simpr2 1193	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → (𝑦‘0) = 𝑃)
35	34	eqcomd 2744	. . . . . . . . . 10 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → 𝑃 = (𝑦‘0))
36	33, 35	sylan9eq 2799	. . . . . . . . 9 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → (𝑥‘0) = (𝑦‘0))
37	36	adantr 480	. . . . . . . 8 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (𝑥‘0) = (𝑦‘0))
38		simpr 484	. . . . . . . 8 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (𝑥‘1) = (𝑦‘1))
39		oveq2 7263	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑥) = 2 → (0..^(♯‘𝑥)) = (0..^2))
40		fzo0to2pr 13400	. . . . . . . . . . . . 13 ⊢ (0..^2) = {0, 1}
41	39, 40	eqtrdi 2795	. . . . . . . . . . . 12 ⊢ ((♯‘𝑥) = 2 → (0..^(♯‘𝑥)) = {0, 1})
42	41	raleqdv 3339	. . . . . . . . . . 11 ⊢ ((♯‘𝑥) = 2 → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ∀𝑖 ∈ {0, 1} (𝑥‘𝑖) = (𝑦‘𝑖)))
43		c0ex 10900	. . . . . . . . . . . 12 ⊢ 0 ∈ V
44		1ex 10902	. . . . . . . . . . . 12 ⊢ 1 ∈ V
45		fveq2 6756	. . . . . . . . . . . . 13 ⊢ (𝑖 = 0 → (𝑥‘𝑖) = (𝑥‘0))
46		fveq2 6756	. . . . . . . . . . . . 13 ⊢ (𝑖 = 0 → (𝑦‘𝑖) = (𝑦‘0))
47	45, 46	eqeq12d 2754	. . . . . . . . . . . 12 ⊢ (𝑖 = 0 → ((𝑥‘𝑖) = (𝑦‘𝑖) ↔ (𝑥‘0) = (𝑦‘0)))
48		fveq2 6756	. . . . . . . . . . . . 13 ⊢ (𝑖 = 1 → (𝑥‘𝑖) = (𝑥‘1))
49		fveq2 6756	. . . . . . . . . . . . 13 ⊢ (𝑖 = 1 → (𝑦‘𝑖) = (𝑦‘1))
50	48, 49	eqeq12d 2754	. . . . . . . . . . . 12 ⊢ (𝑖 = 1 → ((𝑥‘𝑖) = (𝑦‘𝑖) ↔ (𝑥‘1) = (𝑦‘1)))
51	43, 44, 47, 50	ralpr 4633	. . . . . . . . . . 11 ⊢ (∀𝑖 ∈ {0, 1} (𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1)))
52	42, 51	bitrdi 286	. . . . . . . . . 10 ⊢ ((♯‘𝑥) = 2 → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1))))
53	52	3ad2ant1 1131	. . . . . . . . 9 ⊢ (((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋) → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1))))
54	53	ad3antlr 727	. . . . . . . 8 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1))))
55	37, 38, 54	mpbir2and 709	. . . . . . 7 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))
56		eqwrd 14188	. . . . . . . . 9 ⊢ ((𝑥 ∈ Word 𝑉 ∧ 𝑦 ∈ Word 𝑉) → (𝑥 = 𝑦 ↔ ((♯‘𝑥) = (♯‘𝑦) ∧ ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))))
57	56	ad2ant2r 743	. . . . . . . 8 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → (𝑥 = 𝑦 ↔ ((♯‘𝑥) = (♯‘𝑦) ∧ ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))))
58	57	adantr 480	. . . . . . 7 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (𝑥 = 𝑦 ↔ ((♯‘𝑥) = (♯‘𝑦) ∧ ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))))
59	32, 55, 58	mpbir2and 709	. . . . . 6 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → 𝑥 = 𝑦)
60	59	ex 412	. . . . 5 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → ((𝑥‘1) = (𝑦‘1) → 𝑥 = 𝑦))
61	19, 27, 60	syl2anb 597	. . . 4 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) → ((𝑥‘1) = (𝑦‘1) → 𝑥 = 𝑦))
62	11, 61	sylbid 239	. . 3 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
63	62	rgen2 3126	. 2 ⊢ ∀𝑥 ∈ 𝐷 ∀𝑦 ∈ 𝐷 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)
64		dff13 7109	. 2 ⊢ (𝐹:𝐷–1-1→𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑥 ∈ 𝐷 ∀𝑦 ∈ 𝐷 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
65	4, 63, 64	mpbir2an 707	1 ⊢ 𝐹:𝐷–1-1→𝑅

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  {crab 3067  {cpr 4560   ↦ cmpt 5153  ⟶wf 6414  –1-1→wf1 6415  ‘cfv 6418  (class class class)co 7255  0cc0 10802  1c1 10803  2c2 11958  ..^cfzo 13311  ♯chash 13972  Word cword 14145

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-card 9628  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-n0 12164  df-z 12250  df-uz 12512  df-fz 13169  df-fzo 13312  df-hash 13973  df-word 14146

This theorem is referenced by:  wwlktovf1o  14602