proposition: Lemma lt_acc n : Acc lt n.
proof: Proof. induction n. - constructor. intros m H. lia. - constructor. intros m H. destruct (Nat.lt_total n m) as [H'|[->|H'] ]. + lia. + assumption. + now apply IHn. Qed.
imports: Undecidability(Shared.Dec) Undecidability.Synthetic(ListEnumerabilityFacts) List PeanoNat ConstructiveEpsilon Lia