proposition: Fact hfs_pow_trans_incr t : hfs_transitive t -> t ⊆ hfs_pow t.
proof: Proof. intros Ht z H; apply hfs_pow_spec. intros u Hu; revert Hu H; apply Ht. 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)