proposition: Lemma computable_valuation_extend : forall n val P, computable_valuation val -> computable P -> computable_valuation (extend val n P).
proof: Proof. unfold extend, computable_valuation. intros n ? ? ? ? m. case (m =? n); auto. Qed.
imports: List Arith Bool