proposition: Fact bt_pow_iter_le t n m : n <= m -> bt_transitive t -> iter bt_pow t n ⊆ iter bt_pow t m.
proof: Proof. intros H; revert H t. induction 1 as [ | m Hm IHm ]; auto; intros t Ht. apply bti_trans with (1 := IHm _ Ht); simpl. apply bt_pow_iter_mono, bt_pow_trans_incl; 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)