proposition: Fact bt_insert_equiv s t : s→t ≈ s⪧t.
proof: Proof. induction t as [ | t u Hu ] using bt_rect'; simpl; auto. destruct (bt_lt_eq_lt_dec s t) as [[]|]; subst; auto. apply bte_trans with (t⪧s⪧u); 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)