proposition: Fact bt_pow_trans_incl t : bt_transitive t -> t ⊆ bt_pow t.
proof: Proof. intros Ht. intros x Hx. apply bt_pow_spec; intros y Hy. revert Hx; apply Ht; 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)