proposition: Theorem bte_norm_iff s t : s ≈ t <-> s† = t†.
proof: Proof. split. + induction 1; simpl; auto. * transitivity s†; auto. * f_equal; auto. + intros H. apply bte_trans with s †; auto. rewrite 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)