proposition: Lemma nat_standard : standard nat interp_nat.
proof: Proof. split; try reflexivity. exists (fun n => n). setoid_rewrite <- (eval_num _ (fun n => n)). setoid_rewrite nat_eval_num. split; reflexivity. Qed.
imports: Undecidability.Synthetic.Definitions Undecidability.FOL(Syntax.Facts Deduction.FullNDFacts Semantics.Tarski.FullFacts Semantics.Tarski.FullSoundness) Undecidability.FOL.PA Undecidability.FOL.Arithmetics(TarskiFacts DeductionFacts NatModel) Undecidability.H10(H10p) List Lia