proposition: Lemma map_inj {A B}: forall (f: A -> B), (forall x y, f x = f y -> x = y) -> (forall x y, (map f) x = (map f) y -> x = y).
proof: Proof. induction x; destruct y; simpl; intros HH; try congruence. inversion HH; subst; f_equal; eauto. 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