proposition: Corollary BoundedIndex_eq_dec n Bound : forall idx idx' : BoundedIndex (n := n) Bound, {idx = idx'} + {idx <> idx'}.
proof: Proof. intros; destruct (fin_eq_dec (ibound (indexb idx)) (ibound (indexb idx'))). - left; auto using idx_ibound_eq. - right; auto using idx_ibound_neq. Defined.
imports: Coq.Lists.List Coq.Strings.String Coq.Arith.Arith Coq.Logic.Eqdep_dec Fiat.Common.ilist Fiat.Common.ilist2