proposition: Fact bt_insert_lt s t u : s ≺ t -> s→t⪧u = s⪧t⪧u.
proof: Proof. intros H; simpl. destruct (bt_lt_eq_lt_dec s t) as [[|]|]; auto; destruct (@bt_lt_irrefl s); subst; eauto. 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)