fact: Fixpoint pvalues n : (forall i, i < n -> A) -> list A := match n as n return (forall i, i < n -> A) -> list A with | 0 => fun _ => nil | S k => fun f => f 0 (Nat.lt_0_succ k) :: pvalues (fun i h => f (S i) (NatCompat.lt_n_S h)) end.
imports: CoLoR(LogicUtil EqUtil RelUtil BoolUtil NatUtil) Coq(Setoid SetoidList FunInd)