diff options
| author | herbelin | 2009-04-28 15:50:01 +0000 |
|---|---|---|
| committer | herbelin | 2009-04-28 15:50:01 +0000 |
| commit | 349087c4fcbfbbe81bdc3d8ea48291f84dc45af2 (patch) | |
| tree | 40240a36b7b621a639f3f153ac20b117d5114f40 | |
| parent | 61ba3018fe697e23f907c47d61abf8fbb208e770 (diff) | |
Backporting 12112 from v8.2 branch to trunk (fixing documentation bugs
#2099 in ConstructiveEpsilon.v and #2100 on Global Opaque).
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12113 85f007b7-540e-0410-9357-904b9bb8a0f7
| -rw-r--r-- | doc/refman/RefMan-oth.tex | 4 | ||||
| -rw-r--r-- | theories/Logic/ConstructiveEpsilon.v | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/doc/refman/RefMan-oth.tex b/doc/refman/RefMan-oth.tex index 0f6871f95e..cc6c4c483c 100644 --- a/doc/refman/RefMan-oth.tex +++ b/doc/refman/RefMan-oth.tex @@ -934,7 +934,7 @@ case {\Coq} has to check the conversion (see Section~\ref{conv-rules}) of two distinct applied constants. The scope of {\tt Opaque} is limited to the current section, or -current file, unless the variant {\tt Opaque Global \qualid$_1$ \dots +current file, unless the variant {\tt Global Opaque \qualid$_1$ \dots \qualid$_n$} is used. \SeeAlso sections \ref{Conversion-tactics}, \ref{Automatizing}, @@ -962,7 +962,7 @@ distinguishes lemmas from the usual defined constants, whose actual values are of course relevant in general. The scope of {\tt Transparent} is limited to the current section, or -current file, unless the variant {\tt Transparent Global \qualid$_1$ +current file, unless the variant {\tt Global Transparent \qualid$_1$ \dots \qualid$_n$} is used. \begin{ErrMsgs} diff --git a/theories/Logic/ConstructiveEpsilon.v b/theories/Logic/ConstructiveEpsilon.v index 83d5e002aa..337ee05b60 100644 --- a/theories/Logic/ConstructiveEpsilon.v +++ b/theories/Logic/ConstructiveEpsilon.v @@ -14,8 +14,8 @@ predicate from the regular existence (i.e., [Prop]-existence). One requires that the underlying set is countable and that the predicate is decidable. *) -(** Coq does not allow case analysis on sort [Set] when the goal is in -[Prop]. Therefore, one cannot eliminate [exists n, P n] in order to +(** Coq does not allow case analysis on sort [Prop] when the goal is in +[Set]. Therefore, one cannot eliminate [exists n, P n] in order to show [{n : nat | P n}]. However, one can perform a recursion on an inductive predicate in sort [Prop] so that the returning type of the recursion is in [Set]. This trick is described in Coq'Art book, Sect. |