proposition: Fact bt_insert_cntr s t : s→s→t = s→t.
proof: Proof. induction t as [ | t1 t2 IH2 ] using bt_rect'; rew bt insert; auto. bt insert case s t1; f_equal; 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)