proposition: Fact hfs_pow_trans t : hfs_transitive t -> hfs_transitive (hfs_pow t).
proof: Proof. unfold hfs_pow; intros H u v. do 2 rewrite btm_repr_cls. rewrite hfs_mem_repr. apply bt_pow_transitive. apply bt_hfs_transitive; auto. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops membership btree)