proposition: Fact hfs_iter_pow_le t n m : n <= m -> hfs_transitive t -> iter hfs_pow t n ⊆ iter hfs_pow t m.
proof: Proof. intros H; revert H t. induction 1 as [ | m H IH ]; auto; intros t Ht. apply hfs_incl_trans with (1 := IH _ Ht); simpl. apply hfs_iter_pow_mono, hfs_pow_trans_incr, 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)