diff --git a/papers/LMCS.md b/papers/LMCS.md
index e217303f50b37e302005d564d22a2ba566458cec..81e9f3ba856ae2e77f490d9ae993b0ce464ecf3e 100644
--- a/papers/LMCS.md
+++ b/papers/LMCS.md
@@ -27,8 +27,9 @@ in [papers/POPL20.md](POPL20.md), that are briefly discussed here.
 
 The paper presents a set of rules for the subprotocol relation with binders,
 namely `⊑-send-mono'`, `⊑-recv-mono'`, and `⊑-swap'`. These are not available
-in the mechanisation, for technical reasons related to the encoding of binders.
-However, the rules are admissible from the primitive rules, as explained in the
-paper. The consequence of this is observed in the proof of the Löb recursion
-example, which differs from the proof presented in the paper, as it uses the
-rules with binders.
+in the mechanisation, as applying them can be cumbersome, due to the encoding of
+the binders. However, the rules are admissible from the primitive rules, as
+explained in the paper. Additionally, working with the tactics, as elaborated on
+in the mechanisation section of the paper, is recommended. This can be observed in
+the proof of the Löb recursion example, which differs from the proof presented in
+the paper.