proposition: Corollary BoundedIndex_beq_dec {n Bound} : forall (idx idx' : BoundedIndex (n := n) Bound), BoundedIndex_beq idx idx' = true <-> idx = idx'.
proof: Proof. intros; setoid_rewrite fin_beq_dec; split; intros. - eauto using idx_ibound_eq. - subst; reflexivity. Qed.
imports: Coq.Lists.List Coq.Strings.String Coq.Arith.Arith Coq.Logic.Eqdep_dec Fiat.Common.ilist Fiat.Common.ilist2