proposition: Lemma decides_nat_eq : forall (n n' : nat), decides (Nat.eqb n n') (n = n').
proof: Proof. unfold decides, If_Then_Else; intros. destruct (Nat.eqb n n') eqn: ? ; try eapply Nat.eqb_true_iff; try eapply Nat.eqb_false_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