proposition: Fact pos2bt_inj n p q : @pos2bt n p ≈ pos2bt q -> p = q.
proof: Proof. intro H; apply pos2nat_inj, nat2bt_inj, H. 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)