proposition: Lemma firstn_lt_decides {A}: forall m n (l : list A), (lt m n)%nat -> decides true (lt (length (firstn m l)) n)%nat.
proof: Proof. simpl; intros; rewrite firstn_length. eapply NPeano.Nat.min_lt_iff; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Bool.Bool Coq.ZArith.ZArith Coq.Lists.List Fiat.Common.DecideableEnsembles Fiat.Common.EnumType Fiat.Common.BoundedLookup Fiat.Common Fiat.Common.ilist Fiat.Common.Tactics.CacheStringConstant Fiat.Common.IterateBoundedIndex Fiat.Computation Bedrock.Word