proposition: Lemma bti_equiv s t : s ⊆ t -> t ⊆ s -> s ≈ t.
proof: Proof. intros H1 H2. rewrite <- (list_bt_list s), <- (list_bt_list t). do 2 apply bte_trans with (1 := list_bt_norm_eq _), bte_sym. apply list_seteq_bte, lseq_lequiv_iff. split; apply bti_norm_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)