proposition: Lemma whd_wtl {n} : forall w: word (S n), w = WS (whd w) (wtl w).
proof: Proof. intros. destruct (shatter_word_S w) as (b & w' & p). rewrite p; reflexivity. Qed.
imports: Coq.Program.Program Fiat.CertifiedExtraction.Core Fiat.CertifiedExtraction.FacadeWrappers Fiat.CertifiedExtraction.Extraction.BinEncoders.Basics Fiat.CertifiedExtraction.Extraction.BinEncoders.Properties Bedrock.Arrays Bedrock.Platform.Facade.examples.QsADTs Bedrock.Word