Metamath Proof Explorer


Theorem s3clhash

Description: Closure of the words of length 3 in a preimage using the hash function. (Contributed by Thierry Arnoux, 27-Sep-2023)

Ref Expression
Assertion s3clhash ⟨“IJK”⟩.-13

Proof

Step Hyp Ref Expression
1 s3cli ⟨“IJK”⟩WordV
2 1 elexi ⟨“IJK”⟩V
3 s3len ⟨“IJK”⟩=3
4 hashf .:V0+∞
5 ffn .:V0+∞.FnV
6 fniniseg .FnV⟨“IJK”⟩.-13⟨“IJK”⟩V⟨“IJK”⟩=3
7 4 5 6 mp2b ⟨“IJK”⟩.-13⟨“IJK”⟩V⟨“IJK”⟩=3
8 2 3 7 mpbir2an ⟨“IJK”⟩.-13