proposition: Lemma bounded_S_forall {ff : falsity_flag} N phi : bounded (S N) phi <-> bounded N (∀ phi).
proof: Proof. split; intros H. - now constructor. - inversion H. apply Eqdep_dec.inj_pair2_eq_dec in H4 as ->; trivial. unfold Dec.dec. decide equality. Qed.
imports: Undecidability.FOL.Syntax.Facts Undecidability.FOL.Syntax.Theories Undecidability.FOL.Semantics.Tarski.FragmentCore Undecidability(Shared.ListAutomation) Vector Lia