proposition: Lemma BoundedN_below_pow2__le32 {size}: (size <= 32) -> forall v : BoundedN size, N.to_nat (proj1_sig v) < (pow2 32).
proof: Proof. intros; destruct v; simpl; eapply Lt.lt_le_trans; eauto using N_below_pow2_nat, pow2_weakly_monotone. 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