  To obtain Curry’s paradox, let the unary connective \(\odot\) be such that \(\odot\alpha\) is \(\alpha {\rightarrow}\pi\), and let \(\mu\) be a sentence intersubstitutable with \(\mu {\rightarrow}\pi\) according to \(\mathcal{T}\). Then P1 amounts to the instance of MP used in our derivation of the Curry-Paradox Lemma, while P2 is nothing other than our rule Cont.