 Centralizing HNN extension detects subgroup membership

In the HNN extension $⟨P,t\mid t^{-1}\ell t=\ell (\ell \in L)⟩$, the displayed equivalence follows from Britton's lemma. If $p\in L$, the word collapses by the defining isomorphism; otherwise it has stable letters and no pinch, so it is nonidentity. When $P$ is finitely presented and $L$ is finitely generated, imposing commutation with the finitely many subgroup generators gives a finite presentation. An undecidable membership problem for $L$ then becomes an undecidable word problem for a group in the extension.