proposition: Fact bti_congr_r x s t : s ≈ t -> x ⊆ s -> x ⊆ t.
proof: Proof. intros H1 H2 z Hz. generalize (H2 _ Hz); apply btm_congr_r; 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)