proposition: Lemma bounded_up_t {n t k} : bounded_t n t -> k >= n -> bounded_t k t.
proof: Proof. Proof using Σ_preds ops. induction 1; intros Hk; constructor; try lia. firstorder. Qed.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability(Shared.ListAutomation Shared.Dec) Coq(Eqdep_dec PeanoNat) Coq.Vectors.Vector Undecidability.Shared.Libs.PSL.Vectors(Vectors) EqdepFacts