proposition: Fact bt_rincl_trans r s t : r ≾ s -> s ≾ t -> r ≾ t.
proof: Proof. intros H1 H2 u Hu. destruct H1 with (1 := Hu) as (v & Hv & ?). destruct H2 with (1 := Hv) as (w & ? & ?). exists w; split; 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)