proposition: Lemma evalList_Const : forall n (v:t nat n) x, v_apply (evalConstFunc n x) v = x.
proof: Proof. induction n; cbn. - intros; cbn ; replace v with (@Vector.nil nat). + now cbn. + symmetry; apply t_0_nil. - intros; cbn; rewrite (decomp _ _ v); cbn; auto. Qed.
imports: hydras(primRec Ack MoreVectors) Coq(Arith ArithRing List Lia Compare_dec)