aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorThéo Zimmermann2021-01-28 21:18:13 +0100
committerGitHub2021-01-28 21:18:13 +0100
commitae7b304a5a24816d31fbcef1212e15b98bada7a1 (patch)
treed77b45d7c861379cd37d9ce501640914fc489b50
parent639b75a6a5bc2779c684cb8de0042e287c716590 (diff)
Apply suggestions from code review
Co-authored-by: Jim Fehrle <jim.fehrle@gmail.com>
-rw-r--r--doc/sphinx/proofs/writing-proofs/rewriting.rst10
1 files changed, 5 insertions, 5 deletions
diff --git a/doc/sphinx/proofs/writing-proofs/rewriting.rst b/doc/sphinx/proofs/writing-proofs/rewriting.rst
index f316815e01..3d902a9c76 100644
--- a/doc/sphinx/proofs/writing-proofs/rewriting.rst
+++ b/doc/sphinx/proofs/writing-proofs/rewriting.rst
@@ -64,7 +64,7 @@ Rewriting with Leibniz and setoid equality
Some of the variables :g:`x`\ :sub:`i` are solved by unification,
and some of the types :n:`A__1, ..., A__n` may become new
subgoals. :tacn:`rewrite` won't find occurrences inside `forall` that refer
- to variables bound by the `forall`; use the much more advanced :tacn:`setoid_rewrite`
+ to variables bound by the `forall`; use the more advanced :tacn:`setoid_rewrite`
if you want to find such occurrences.
:n:`{+, @oriented_rewriter }`
@@ -110,14 +110,14 @@ Rewriting with Leibniz and setoid equality
For each selected hypothesis and/or the conclusion,
:tacn:`rewrite` finds the first matching subterm in
depth-first search order. Only subterms identical to the
- matched one are rewritten. If the `at` clause is specified,
+ that first matched subterm are rewritten. If the `at` clause is specified,
only these subterms are considered when counting occurrences.
To select a different set of matching subterms, you can
specify how some or all of the free variables are bound by
using a `with` clause (see :n:`@one_term_with_bindings`).
For instance, if we want to rewrite the right-hand side in the
- following goal, it will not work like this:
+ following goal, this will not work:
.. coqtop:: none
@@ -138,9 +138,9 @@ Rewriting with Leibniz and setoid equality
rewrite Nat.add_comm with (m := x).
- Note that the much more advanced :tacn:`setoid_rewrite` tactic
+ Note that the more advanced :tacn:`setoid_rewrite` tactic
behaves differently, and thus the number of occurrences
- available to rewrite may differ if using one or the other.
+ available to rewrite may differ between the two tactics.
.. exn:: Tactic failure: Setoid library not loaded.
:undocumented: