aboutsummaryrefslogtreecommitdiff
path: root/doc/sphinx/user-extensions
diff options
context:
space:
mode:
authorThéo Zimmermann2020-09-27 12:31:14 +0200
committerThéo Zimmermann2020-09-27 12:31:14 +0200
commitc571af2f95cccfbffe4e0b93525066676e7f652d (patch)
tree68d4f8fd36d03482d2a33ee5e64d5ff813ebbe2c /doc/sphinx/user-extensions
parent9c2228ff011dc6188b70084fa1e1a5158affcf24 (diff)
Reduce nitpick_ignore list a little.
Diffstat (limited to 'doc/sphinx/user-extensions')
-rw-r--r--doc/sphinx/user-extensions/proof-schemes.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/sphinx/user-extensions/proof-schemes.rst b/doc/sphinx/user-extensions/proof-schemes.rst
index e05be7c2c2..8e23e61018 100644
--- a/doc/sphinx/user-extensions/proof-schemes.rst
+++ b/doc/sphinx/user-extensions/proof-schemes.rst
@@ -203,7 +203,7 @@ Generation of inversion principles with ``Derive`` ``Inversion``
This command generates an inversion principle for the
:tacn:`inversion ... using ...` tactic. The first :token:`ident` is the name
of the generated principle. The second :token:`ident` should be an inductive
- predicate, and :token:`binders` the variables occurring in the term
+ predicate, and :n:`{* @binder }` the variables occurring in the term
:token:`term`. This command generates the inversion lemma for the sort
:token:`sort` corresponding to the instance :n:`forall {* @binder }, @ident @term`.
When applied, it is equivalent to having inverted the instance with the