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 /theories | |
| 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
Diffstat (limited to 'theories')
| -rw-r--r-- | theories/Logic/ConstructiveEpsilon.v | 4 |
1 files changed, 2 insertions, 2 deletions
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. |