proposition: Fact bt_tc_mono s t : s ⊆ t -> ↓s ⊆ ↓t.
proof: Proof. intros H. apply bt_tc_incl_transitive; auto. apply bti_trans with (1 := H); 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)