fact: Fixpoint Iterate_Dep_Type_BoundedIndex' (Remaining : nat) (P : Dep_Type (Fin.t Remaining)) {struct Remaining} : Type := match Remaining return Dep_Type (Fin.t Remaining) -> Type with | 0 => fun P => unit | S Remaining' => fun P => prim_prod (P (@Fin.F1 Remaining')) (@Iterate_Dep_Type_BoundedIndex' Remaining' (fun n' => P (@Fin.FS _ n'))) end P.
imports: Coq.Arith.Arith Coq.Lists.List Coq.Sets.Ensembles Coq.Strings.String Fiat.Common Fiat.Common.ilist Fiat.Common.BoundedLookup Fiat.Common.DecideableEnsembles