aboutsummaryrefslogtreecommitdiff
path: root/doc/refman
diff options
context:
space:
mode:
authorlarsr2017-08-02 14:47:45 +0200
committerGitHub2017-08-02 14:47:45 +0200
commit00745dd8a0a9597c7f3eecab7578d7069f85386a (patch)
treeaff20f6647dbb2fa078348164a1165ee23187ae3 /doc/refman
parent1f46ff6db53c2ca471d9ea067d0824755b2f34da (diff)
Update Setoid.tex
The term of type `list nat` should be `(@nil nat)` instead of `(nil nat)`.
Diffstat (limited to 'doc/refman')
-rw-r--r--doc/refman/Setoid.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/refman/Setoid.tex b/doc/refman/Setoid.tex
index 2c9602a229..6c79284389 100644
--- a/doc/refman/Setoid.tex
+++ b/doc/refman/Setoid.tex
@@ -156,9 +156,9 @@ compatibility constraints.
\begin{cscexample}[Rewriting]
Continuing the previous examples, suppose that the user must prove
\texttt{set\_eq int (union int (union int S1 S2) S2) (f S1 S2)} under the
-hypothesis \texttt{H: set\_eq int S2 (nil int)}. It is possible to
+hypothesis \texttt{H: set\_eq int S2 (@nil int)}. It is possible to
use the \texttt{rewrite} tactic to replace the first two occurrences of
-\texttt{S2} with \texttt{nil int} in the goal since the context
+\texttt{S2} with \texttt{@nil int} in the goal since the context
\texttt{set\_eq int (union int (union int S1 nil) nil) (f S1 S2)}, being
a composition of morphisms instances, is a morphism. However the tactic
will fail replacing the third occurrence of \texttt{S2} unless \texttt{f}