proposition: Corollary BoundedIndex_beq_trans {n Bound} : forall (p q r : BoundedIndex (n := n) Bound), BoundedIndex_beq p q = true -> BoundedIndex_beq q r = true -> BoundedIndex_beq p q = true.
proof: Proof. repeat setoid_rewrite BoundedIndex_beq_dec; congruence. Qed.
imports: Coq.Lists.List Coq.Strings.String Coq.Arith.Arith Coq.Logic.Eqdep_dec Fiat.Common.ilist Fiat.Common.ilist2