proposition: Lemma bounded_up {ff : falsity_flag} {n phi k} : bounded n phi -> k >= n -> bounded k phi.
proof: Proof. induction 1 in k |- *; intros Hk; constructor; eauto. - intros t Ht. eapply bounded_up_t; eauto. - apply IHbounded. lia. 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