proposition: Lemma bte_rincl s t : s ≈ t -> s ≾ t.
proof: Proof. intros H; assert (s ≾ t /\ t ≾ s) as K; [ | apply K ]. induction H as [ | | ? ? ? ? [] ? [] | | | ? ? ? ? ? [] ? [] ]; eauto; tauto. 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)