proposition: Lemma wordToNat_inj {sz} : forall (w1 w2: word sz), wordToNat w1 = wordToNat w2 -> w1 = w2.
proof: Proof. intros * H. apply (f_equal (@natToWord sz)) in H. rewrite !natToWord_wordToNat in H. assumption. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat CertifiedExtraction.Extraction.BinEncoders.Basics Coq.Lists.List Bedrock.Word Program Nomega