proposition: Lemma decides_word_eq {sz}: forall (w w' : word sz), decides (weqb w w') (w = w').
proof: Proof. unfold decides, If_Then_Else; intros. destruct (weqb w w') eqn: ? ; unfold not; setoid_rewrite <- weqb_true_iff; congruence. 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