proposition: Theorem bt_tc_trans t : bt_transitive ↓t.
proof: Proof. induction t as [ | s Hs t Ht ]; simpl; intros u v H1; btm simpl. rewrite !bt_cup_spec; intros [ H2 | [] ]; eauto. rewrite H2 in H1; right; left; auto; apply bt_tc_incr; 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)