proposition: Lemma betaThm4 n (y : nat -> nat) : {a : nat | forall z, z < n -> y z = Usual.β (cdr a) (car a) z}.
proof: Proof. destruct (betaThm3 n y) as [x e]; exists x; intros z Hz. intros ; rewrite <- betaEquiv; now apply e. Qed.
imports: Coq(Arith) hydras.Ackermann(extEqualNat subAll folProp subProp folReplace folLogic3 NN NNtheory primRec expressible) Coqprime(ChineseRem) Coq(Vector List Lia) hydras(ListExt cPair MoreDecidable) hydras(Compat815 ssrnat_extracts) Coq(Utf8)