proposition: Fact bt_lt_irrefl s : ~ s ≺ s.
proof: Proof. intros H. assert (forall t, s ≺ t -> s <> t) as D; [ | apply D in H; destruct H; auto ]. clear H; induction 1 as [ | ? ? ? ? ? IH | ? ? ? ? IH ]; try discriminate; contradict IH; inversion IH; 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)