proposition: Fact hfs_mem_btm s t : cls s ∈ cls t <-> bt_mem s t.
proof: Proof. rewrite btm_repr_cls, hfs_repr_bt_cls; tauto. Qed.
imports: List Arith Lia Max Wellfounded Setoid Eqdep_dec Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.Shared.Libs.DLW.Wf(wf_finite wf_chains) Undecidability.FOL.TRAKHTENBROT(notations fol_ops membership btree)