proposition: Fact bt_lt_trans r s t : r ≺ s -> s ≺ t -> r ≺ t.
proof: Proof. intros H1; revert H1 t. induction 1; inversion 1; auto. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_decidable finite seteq) Undecidability.Shared.Libs.DLW.Vec(pos) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops)