MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reuccats1 Structured version   Visualization version   GIF version

Theorem reuccats1 13651
Description: A set of words having the length of a given word increased by 1 contains a unique word with the given word as prefix if there is a unique symbol which extends the given word to be a word of the set. (Contributed by Alexander van der Vekens, 6-Oct-2018.) (Revised by AV, 21-Jan-2022.)
Hypothesis
Ref Expression
reuccats1.1 𝑣𝑋
Assertion
Ref Expression
reuccats1 ((𝑊 ∈ Word 𝑉 ∧ ∀𝑥𝑋 (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑊) + 1))) → (∃!𝑣𝑉 (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)))
Distinct variable groups:   𝑣,𝑉,𝑥   𝑣,𝑊,𝑥   𝑥,𝑋
Allowed substitution hint:   𝑋(𝑣)

Proof of Theorem reuccats1
Dummy variables 𝑢 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1w 2810 . . . 4 (𝑥 = 𝑦 → (𝑥 ∈ Word 𝑉𝑦 ∈ Word 𝑉))
2 fveq2 6340 . . . . 5 (𝑥 = 𝑦 → (♯‘𝑥) = (♯‘𝑦))
32eqeq1d 2750 . . . 4 (𝑥 = 𝑦 → ((♯‘𝑥) = ((♯‘𝑊) + 1) ↔ (♯‘𝑦) = ((♯‘𝑊) + 1)))
41, 3anbi12d 749 . . 3 (𝑥 = 𝑦 → ((𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑊) + 1)) ↔ (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))))
54cbvralv 3298 . 2 (∀𝑥𝑋 (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑊) + 1)) ↔ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1)))
6 reuccats1.1 . . . . 5 𝑣𝑋
76nfel2 2907 . . . 4 𝑣(𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋
86nfel2 2907 . . . 4 𝑣(𝑊 ++ ⟨“𝑥”⟩) ∈ 𝑋
9 s1eq 13541 . . . . . 6 (𝑣 = 𝑥 → ⟨“𝑣”⟩ = ⟨“𝑥”⟩)
109oveq2d 6817 . . . . 5 (𝑣 = 𝑥 → (𝑊 ++ ⟨“𝑣”⟩) = (𝑊 ++ ⟨“𝑥”⟩))
1110eleq1d 2812 . . . 4 (𝑣 = 𝑥 → ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ↔ (𝑊 ++ ⟨“𝑥”⟩) ∈ 𝑋))
12 s1eq 13541 . . . . . 6 (𝑥 = 𝑢 → ⟨“𝑥”⟩ = ⟨“𝑢”⟩)
1312oveq2d 6817 . . . . 5 (𝑥 = 𝑢 → (𝑊 ++ ⟨“𝑥”⟩) = (𝑊 ++ ⟨“𝑢”⟩))
1413eleq1d 2812 . . . 4 (𝑥 = 𝑢 → ((𝑊 ++ ⟨“𝑥”⟩) ∈ 𝑋 ↔ (𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋))
157, 8, 11, 14reu8nf 3645 . . 3 (∃!𝑣𝑉 (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ↔ ∃𝑣𝑉 ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢)))
16 nfv 1980 . . . . 5 𝑣 𝑊 ∈ Word 𝑉
17 nfv 1980 . . . . . 6 𝑣(𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))
186, 17nfral 3071 . . . . 5 𝑣𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))
1916, 18nfan 1965 . . . 4 𝑣(𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1)))
20 nfv 1980 . . . . 5 𝑣 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)
216, 20nfreu 3240 . . . 4 𝑣∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)
22 simprl 811 . . . . . 6 ((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) → (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋)
23 simp-4l 825 . . . . . . . . 9 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → 𝑊 ∈ Word 𝑉)
24 simpr 479 . . . . . . . . 9 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → 𝑥𝑋)
2522adantr 472 . . . . . . . . 9 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋)
26 simplrr 820 . . . . . . . . 9 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))
27 simp-4r 827 . . . . . . . . 9 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1)))
28 reuccats1lem 13650 . . . . . . . . 9 (((𝑊 ∈ Word 𝑉𝑥𝑋 ∧ (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋) ∧ (∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢) ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1)))) → (𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩) → 𝑥 = (𝑊 ++ ⟨“𝑣”⟩)))
2923, 24, 25, 26, 27, 28syl32anc 1471 . . . . . . . 8 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → (𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩) → 𝑥 = (𝑊 ++ ⟨“𝑣”⟩)))
30 oveq1 6808 . . . . . . . . . . 11 (𝑥 = (𝑊 ++ ⟨“𝑣”⟩) → (𝑥 substr ⟨0, (♯‘𝑊)⟩) = ((𝑊 ++ ⟨“𝑣”⟩) substr ⟨0, (♯‘𝑊)⟩))
31 simpl 474 . . . . . . . . . . . . . . 15 ((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) → 𝑊 ∈ Word 𝑉)
32 s1cl 13543 . . . . . . . . . . . . . . 15 (𝑣𝑉 → ⟨“𝑣”⟩ ∈ Word 𝑉)
3331, 32anim12i 591 . . . . . . . . . . . . . 14 (((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) → (𝑊 ∈ Word 𝑉 ∧ ⟨“𝑣”⟩ ∈ Word 𝑉))
3433adantr 472 . . . . . . . . . . . . 13 ((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) → (𝑊 ∈ Word 𝑉 ∧ ⟨“𝑣”⟩ ∈ Word 𝑉))
3534adantr 472 . . . . . . . . . . . 12 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → (𝑊 ∈ Word 𝑉 ∧ ⟨“𝑣”⟩ ∈ Word 𝑉))
36 swrdccat1 13628 . . . . . . . . . . . 12 ((𝑊 ∈ Word 𝑉 ∧ ⟨“𝑣”⟩ ∈ Word 𝑉) → ((𝑊 ++ ⟨“𝑣”⟩) substr ⟨0, (♯‘𝑊)⟩) = 𝑊)
3735, 36syl 17 . . . . . . . . . . 11 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → ((𝑊 ++ ⟨“𝑣”⟩) substr ⟨0, (♯‘𝑊)⟩) = 𝑊)
3830, 37sylan9eqr 2804 . . . . . . . . . 10 ((((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) ∧ 𝑥 = (𝑊 ++ ⟨“𝑣”⟩)) → (𝑥 substr ⟨0, (♯‘𝑊)⟩) = 𝑊)
3938eqcomd 2754 . . . . . . . . 9 ((((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) ∧ 𝑥 = (𝑊 ++ ⟨“𝑣”⟩)) → 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩))
4039ex 449 . . . . . . . 8 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → (𝑥 = (𝑊 ++ ⟨“𝑣”⟩) → 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)))
4129, 40impbid 202 . . . . . . 7 (((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) ∧ 𝑥𝑋) → (𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩) ↔ 𝑥 = (𝑊 ++ ⟨“𝑣”⟩)))
4241ralrimiva 3092 . . . . . 6 ((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) → ∀𝑥𝑋 (𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩) ↔ 𝑥 = (𝑊 ++ ⟨“𝑣”⟩)))
43 reu6i 3526 . . . . . 6 (((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑥𝑋 (𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩) ↔ 𝑥 = (𝑊 ++ ⟨“𝑣”⟩))) → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩))
4422, 42, 43syl2anc 696 . . . . 5 ((((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) ∧ 𝑣𝑉) ∧ ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢))) → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩))
4544exp31 631 . . . 4 ((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) → (𝑣𝑉 → (((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢)) → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩))))
4619, 21, 45rexlimd 3152 . . 3 ((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) → (∃𝑣𝑉 ((𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 ∧ ∀𝑢𝑉 ((𝑊 ++ ⟨“𝑢”⟩) ∈ 𝑋𝑣 = 𝑢)) → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)))
4715, 46syl5bi 232 . 2 ((𝑊 ∈ Word 𝑉 ∧ ∀𝑦𝑋 (𝑦 ∈ Word 𝑉 ∧ (♯‘𝑦) = ((♯‘𝑊) + 1))) → (∃!𝑣𝑉 (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)))
485, 47sylan2b 493 1 ((𝑊 ∈ Word 𝑉 ∧ ∀𝑥𝑋 (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑊) + 1))) → (∃!𝑣𝑉 (𝑊 ++ ⟨“𝑣”⟩) ∈ 𝑋 → ∃!𝑥𝑋 𝑊 = (𝑥 substr ⟨0, (♯‘𝑊)⟩)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1620  wcel 2127  wnfc 2877  wral 3038  wrex 3039  ∃!wreu 3040  cop 4315  cfv 6037  (class class class)co 6801  0cc0 10099  1c1 10100   + caddc 10102  chash 13282  Word cword 13448   ++ cconcat 13450  ⟨“cs1 13451   substr csubstr 13452
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1859  ax-4 1874  ax-5 1976  ax-6 2042  ax-7 2078  ax-8 2129  ax-9 2136  ax-10 2156  ax-11 2171  ax-12 2184  ax-13 2379  ax-ext 2728  ax-rep 4911  ax-sep 4921  ax-nul 4929  ax-pow 4980  ax-pr 5043  ax-un 7102  ax-cnex 10155  ax-resscn 10156  ax-1cn 10157  ax-icn 10158  ax-addcl 10159  ax-addrcl 10160  ax-mulcl 10161  ax-mulrcl 10162  ax-mulcom 10163  ax-addass 10164  ax-mulass 10165  ax-distr 10166  ax-i2m1 10167  ax-1ne0 10168  ax-1rid 10169  ax-rnegex 10170  ax-rrecex 10171  ax-cnre 10172  ax-pre-lttri 10173  ax-pre-lttrn 10174  ax-pre-ltadd 10175  ax-pre-mulgt0 10176
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1623  df-ex 1842  df-nf 1847  df-sb 2035  df-eu 2599  df-mo 2600  df-clab 2735  df-cleq 2741  df-clel 2744  df-nfc 2879  df-ne 2921  df-nel 3024  df-ral 3043  df-rex 3044  df-reu 3045  df-rab 3047  df-v 3330  df-sbc 3565  df-csb 3663  df-dif 3706  df-un 3708  df-in 3710  df-ss 3717  df-pss 3719  df-nul 4047  df-if 4219  df-pw 4292  df-sn 4310  df-pr 4312  df-tp 4314  df-op 4316  df-uni 4577  df-int 4616  df-iun 4662  df-br 4793  df-opab 4853  df-mpt 4870  df-tr 4893  df-id 5162  df-eprel 5167  df-po 5175  df-so 5176  df-fr 5213  df-we 5215  df-xp 5260  df-rel 5261  df-cnv 5262  df-co 5263  df-dm 5264  df-rn 5265  df-res 5266  df-ima 5267  df-pred 5829  df-ord 5875  df-on 5876  df-lim 5877  df-suc 5878  df-iota 6000  df-fun 6039  df-fn 6040  df-f 6041  df-f1 6042  df-fo 6043  df-f1o 6044  df-fv 6045  df-riota 6762  df-ov 6804  df-oprab 6805  df-mpt2 6806  df-om 7219  df-1st 7321  df-2nd 7322  df-wrecs 7564  df-recs 7625  df-rdg 7663  df-1o 7717  df-oadd 7721  df-er 7899  df-en 8110  df-dom 8111  df-sdom 8112  df-fin 8113  df-card 8926  df-pnf 10239  df-mnf 10240  df-xr 10241  df-ltxr 10242  df-le 10243  df-sub 10431  df-neg 10432  df-nn 11184  df-n0 11456  df-xnn0 11527  df-z 11541  df-uz 11851  df-fz 12491  df-fzo 12631  df-hash 13283  df-word 13456  df-lsw 13457  df-concat 13458  df-s1 13459  df-substr 13460
This theorem is referenced by:  reuccats1v  13652  numclwlk2lem2f1o  27511  numclwlk2lem2f1oOLD  27518
  Copyright terms: Public domain W3C validator