Theorem wwlktovf1 14994

Description: Lemma 2 for wrd2f1tovbij 14997. (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 14993	. 2 ⊢ 𝐹:𝐷⟶𝑅
5		fveq1 6881	. . . . . 6 ⊢ (𝑡 = 𝑥 → (𝑡‘1) = (𝑥‘1))
6		fvex 6895	. . . . . 6 ⊢ (𝑥‘1) ∈ V
7	5, 3, 6	fvmpt 6990	. . . . 5 ⊢ (𝑥 ∈ 𝐷 → (𝐹‘𝑥) = (𝑥‘1))
8		fveq1 6881	. . . . . 6 ⊢ (𝑡 = 𝑦 → (𝑡‘1) = (𝑦‘1))
9		fvex 6895	. . . . . 6 ⊢ (𝑦‘1) ∈ V
10	8, 3, 9	fvmpt 6990	. . . . 5 ⊢ (𝑦 ∈ 𝐷 → (𝐹‘𝑦) = (𝑦‘1))
11	7, 10	eqeqan12d 2783	. . . 4 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝑥‘1) = (𝑦‘1)))
12		fveqeq2 6891	. . . . . . 7 ⊢ (𝑤 = 𝑥 → ((♯‘𝑤) = 2 ↔ (♯‘𝑥) = 2))
13		fveq1 6881	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → (𝑤‘0) = (𝑥‘0))
14	13	eqeq1d 2771	. . . . . . 7 ⊢ (𝑤 = 𝑥 → ((𝑤‘0) = 𝑃 ↔ (𝑥‘0) = 𝑃))
15		fveq1 6881	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (𝑤‘1) = (𝑥‘1))
16	13, 15	preq12d 4712	. . . . . . . 8 ⊢ (𝑤 = 𝑥 → {(𝑤‘0), (𝑤‘1)} = {(𝑥‘0), (𝑥‘1)})
17	16	eleq1d 2854	. . . . . . 7 ⊢ (𝑤 = 𝑥 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋))
18	12, 14, 17	3anbi123d 1462	. . . . . 6 ⊢ (𝑤 = 𝑥 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)))
19	18, 1	elrab2 3663	. . . . 5 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)))
20		fveqeq2 6891	. . . . . . 7 ⊢ (𝑤 = 𝑦 → ((♯‘𝑤) = 2 ↔ (♯‘𝑦) = 2))
21		fveq1 6881	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → (𝑤‘0) = (𝑦‘0))
22	21	eqeq1d 2771	. . . . . . 7 ⊢ (𝑤 = 𝑦 → ((𝑤‘0) = 𝑃 ↔ (𝑦‘0) = 𝑃))
23		fveq1 6881	. . . . . . . . 9 ⊢ (𝑤 = 𝑦 → (𝑤‘1) = (𝑦‘1))
24	21, 23	preq12d 4712	. . . . . . . 8 ⊢ (𝑤 = 𝑦 → {(𝑤‘0), (𝑤‘1)} = {(𝑦‘0), (𝑦‘1)})
25	24	eleq1d 2854	. . . . . . 7 ⊢ (𝑤 = 𝑦 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))
26	20, 22, 25	3anbi123d 1462	. . . . . 6 ⊢ (𝑤 = 𝑦 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)))
27	26, 1	elrab2 3663	. . . . 5 ⊢ (𝑦 ∈ 𝐷 ↔ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)))
28		simpr1 1211	. . . . . . . . 9 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) → (♯‘𝑥) = 2)
29		simpr1 1211	. . . . . . . . . 10 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → (♯‘𝑦) = 2)
30	29	eqcomd 2775	. . . . . . . . 9 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → 2 = (♯‘𝑦))
31	28, 30	sylan9eq 2824	. . . . . . . 8 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → (♯‘𝑥) = (♯‘𝑦))
32	31	adantr 485	. . . . . . 7 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (♯‘𝑥) = (♯‘𝑦))
33		simpr2 1212	. . . . . . . . . 10 ⊢ ((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) → (𝑥‘0) = 𝑃)
34		simpr2 1212	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → (𝑦‘0) = 𝑃)
35	34	eqcomd 2775	. . . . . . . . . 10 ⊢ ((𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋)) → 𝑃 = (𝑦‘0))
36	33, 35	sylan9eq 2824	. . . . . . . . 9 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → (𝑥‘0) = (𝑦‘0))
37	36	adantr 485	. . . . . . . 8 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (𝑥‘0) = (𝑦‘0))
38		simpr 489	. . . . . . . 8 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (𝑥‘1) = (𝑦‘1))
39		oveq2 7419	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑥) = 2 → (0..^(♯‘𝑥)) = (0..^2))
40		fzo0to2pr 13779	. . . . . . . . . . . . 13 ⊢ (0..^2) = {0, 1}
41	39, 40	eqtrdi 2820	. . . . . . . . . . . 12 ⊢ ((♯‘𝑥) = 2 → (0..^(♯‘𝑥)) = {0, 1})
42	41	raleqdv 3329	. . . . . . . . . . 11 ⊢ ((♯‘𝑥) = 2 → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ∀𝑖 ∈ {0, 1} (𝑥‘𝑖) = (𝑦‘𝑖)))
43		c0ex 11200	. . . . . . . . . . . 12 ⊢ 0 ∈ V
44		1ex 11203	. . . . . . . . . . . 12 ⊢ 1 ∈ V
45		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑖 = 0 → (𝑥‘𝑖) = (𝑥‘0))
46		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑖 = 0 → (𝑦‘𝑖) = (𝑦‘0))
47	45, 46	eqeq12d 2785	. . . . . . . . . . . 12 ⊢ (𝑖 = 0 → ((𝑥‘𝑖) = (𝑦‘𝑖) ↔ (𝑥‘0) = (𝑦‘0)))
48		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑖 = 1 → (𝑥‘𝑖) = (𝑥‘1))
49		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑖 = 1 → (𝑦‘𝑖) = (𝑦‘1))
50	48, 49	eqeq12d 2785	. . . . . . . . . . . 12 ⊢ (𝑖 = 1 → ((𝑥‘𝑖) = (𝑦‘𝑖) ↔ (𝑥‘1) = (𝑦‘1)))
51	43, 44, 47, 50	ralpr 4671	. . . . . . . . . . 11 ⊢ (∀𝑖 ∈ {0, 1} (𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1)))
52	42, 51	bitrdi 290	. . . . . . . . . 10 ⊢ ((♯‘𝑥) = 2 → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1))))
53	52	3ad2ant1 1149	. . . . . . . . 9 ⊢ (((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋) → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1))))
54	53	ad3antlr 743	. . . . . . . 8 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖) ↔ ((𝑥‘0) = (𝑦‘0) ∧ (𝑥‘1) = (𝑦‘1))))
55	37, 38, 54	mpbir2and 725	. . . . . . 7 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))
56		eqwrd 14594	. . . . . . . . 9 ⊢ ((𝑥 ∈ Word 𝑉 ∧ 𝑦 ∈ Word 𝑉) → (𝑥 = 𝑦 ↔ ((♯‘𝑥) = (♯‘𝑦) ∧ ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))))
57	56	ad2ant2r 759	. . . . . . . 8 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → (𝑥 = 𝑦 ↔ ((♯‘𝑥) = (♯‘𝑦) ∧ ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))))
58	57	adantr 485	. . . . . . 7 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → (𝑥 = 𝑦 ↔ ((♯‘𝑥) = (♯‘𝑦) ∧ ∀𝑖 ∈ (0..^(♯‘𝑥))(𝑥‘𝑖) = (𝑦‘𝑖))))
59	32, 55, 58	mpbir2and 725	. . . . . 6 ⊢ ((((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) ∧ (𝑥‘1) = (𝑦‘1)) → 𝑥 = 𝑦)
60	59	ex 417	. . . . 5 ⊢ (((𝑥 ∈ Word 𝑉 ∧ ((♯‘𝑥) = 2 ∧ (𝑥‘0) = 𝑃 ∧ {(𝑥‘0), (𝑥‘1)} ∈ 𝑋)) ∧ (𝑦 ∈ Word 𝑉 ∧ ((♯‘𝑦) = 2 ∧ (𝑦‘0) = 𝑃 ∧ {(𝑦‘0), (𝑦‘1)} ∈ 𝑋))) → ((𝑥‘1) = (𝑦‘1) → 𝑥 = 𝑦))
61	19, 27, 60	syl2anb 609	. . . 4 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) → ((𝑥‘1) = (𝑦‘1) → 𝑥 = 𝑦))
62	11, 61	sylbid 243	. . 3 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐷) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
63	62	rgen2 3211	. 2 ⊢ ∀𝑥 ∈ 𝐷 ∀𝑦 ∈ 𝐷 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)
64		dff13 7253	. 2 ⊢ (𝐹:𝐷–1-1→𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑥 ∈ 𝐷 ∀𝑦 ∈ 𝐷 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
65	4, 63, 64	mpbir2an 723	1 ⊢ 𝐹:𝐷–1-1→𝑅

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∀wral 3085  {crab 3423  {cpr 4596   ↦ cmpt 5196  ⟶wf 6533  –1-1→wf1 6534  ‘cfv 6537  (class class class)co 7411  0cc0 11100  1c1 11101  2c2 12295  ..^cfzo 13682  ♯chash 14366  Word cword 14550

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-card 9925  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-2 12303  df-n0 12505  df-z 12592  df-uz 12863  df-fz 13536  df-fzo 13683  df-hash 14367  df-word 14551

This theorem is referenced by:  wwlktovf1o  14996