proposition: Lemma decides_EnumType_eq {A} {n} {tags} : forall (b b' : @EnumType n A tags), decides (fin_beq b b') (b = b').
proof: Proof. unfold decides, If_Then_Else; intros. destruct (fin_beq b b') eqn: H' ; unfold not; intros; try rewrite fin_beq_dec in H'; try rewrite fin_beq_neq_dec in H'; 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