diff options
author | corbinea <corbinea@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2006-09-20 09:21:15 +0000 |
---|---|---|
committer | corbinea <corbinea@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2006-09-20 09:21:15 +0000 |
commit | c6b9d70f9292fc9f4b5f272b5b955af0e8fe0bea (patch) | |
tree | 83ff39fae6f9de76a2c51a9cf6e95a8a23f7bd79 /doc | |
parent | 32590a461f21875215d15e1db93c2eeedc3e49b2 (diff) |
congruence doc update
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@9153 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'doc')
-rw-r--r-- | doc/refman/RefMan-tac.tex | 12 |
1 files changed, 10 insertions, 2 deletions
diff --git a/doc/refman/RefMan-tac.tex b/doc/refman/RefMan-tac.tex index 9aa5b9474..2aa0b5b65 100644 --- a/doc/refman/RefMan-tac.tex +++ b/doc/refman/RefMan-tac.tex @@ -120,7 +120,7 @@ subgoal is proved. Otherwise, it fails. \end{ErrMsgs} \begin{Variants} -\tacindex{eassumption}} +\tacindex{eassumption} \item \texttt{eassumption} This tactic behaves like \texttt{assumption} but is able to handle @@ -1717,7 +1717,7 @@ accepted as regular setoids for {\tt rewrite} and {\tt \tacindex{stepr} \comindex{Declare Right Step} \begin{Variants} -\item{\tt stepl {\term} by {\tac}}\\ +\item{\tt stepl {\term}{\sl n} by {\tac}}\\ This applies {\tt stepl {\term}} then applies {\tac} to the second goal. \item{\tt stepr {\term}}\\ @@ -2601,6 +2601,8 @@ If the goal is a non-quantified equality, {\tt congruence} tries to prove it with non-quantified equalities in the context. Otherwise it tries to infer a discriminable equality from those in the context. Alternatively, congruence tries to prove that an hypothesis is equal to the goal or to the negation of another hypothesis. +{\tt congruence} is also able to take advantage of hypotheses stating quantified equalities, you have to provide a bound for the number of extra equalities generated that way. Please note that one of the memebers of the equality must contain all the quantified variables in order for {\tt congruence} to match against it. + \begin{coq_eval} Reset Initial. Variable A:Set. @@ -2630,6 +2632,12 @@ congruence. \end{coq_example} \begin{Variants} + \item {\tt congruence {\sl n}}\\ + Tries to add at most {\tt \sl n} instances of hypotheses satting quantifiesd equalities to the problem in order to solve it. A bigger value of {\tt \sl n} does not make success slower, only failure. You might consider adding some lemmata as hypotheses using {\tt assert} in order for congruence to use them. + +\end{Variants} + +\begin{Variants} \item {\tt congruence with \term$_1$ \dots\ \term$_n$}\\ Adds {\tt \term$_1$ \dots\ \term$_n$} to the pool of terms used by {\tt congruence}. This helps in case you have partially applied |