diff options
| author | msozeau | 2008-04-14 15:38:12 +0000 |
|---|---|---|
| committer | msozeau | 2008-04-14 15:38:12 +0000 |
| commit | f6533eba11440dc181cddc80355d9a0f35a98481 (patch) | |
| tree | 10b1ca2ae9c401466e0c144db7912b4c36984127 | |
| parent | 39db249e97bcb30f66f468825d20d6e754e7c06e (diff) | |
Update doc and remove another overloading of equiv_*.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10788 85f007b7-540e-0410-9357-904b9bb8a0f7
| -rw-r--r-- | doc/refman/Setoid.tex | 6 | ||||
| -rw-r--r-- | theories/Classes/Equivalence.v | 6 |
2 files changed, 6 insertions, 6 deletions
diff --git a/doc/refman/Setoid.tex b/doc/refman/Setoid.tex index b124d6a969..a5cc6acbf0 100644 --- a/doc/refman/Setoid.tex +++ b/doc/refman/Setoid.tex @@ -454,9 +454,9 @@ is equivalent to an instance declaration: \texttt{Instance} ($x_1 : T_1$) \ldots ($x_n : T_k$) \texttt{=>} \textit{id} : \texttt{Equivalence} \textit{(A $t_1$ \ldots $t_n$) (Aeq $t'_1$ \ldots $t'_m$)} :=\\ - ~\zeroone{\texttt{equiv\_refl :=} \textit{refl}}\\ - ~\zeroone{\texttt{equiv\_sym :=} \textit{sym}}\\ - ~\zeroone{\texttt{equiv\_trans :=} \textit{trans}}. + ~\zeroone{\texttt{equivalence\_reflexive :=} \textit{refl}}\\ + ~\zeroone{\texttt{equivalence\_symmetric :=} \textit{sym}}\\ + ~\zeroone{\texttt{equivalence\_transitive :=} \textit{trans}}. \end{quote} The declaration itself amounts to the definition of an object of the diff --git a/theories/Classes/Equivalence.v b/theories/Classes/Equivalence.v index f40d2e2a5e..4f794af3f9 100644 --- a/theories/Classes/Equivalence.v +++ b/theories/Classes/Equivalence.v @@ -41,16 +41,16 @@ Typeclasses unfold @equiv. (* (** Shortcuts to make proof search possible (unification won't unfold equiv). *) *) -Program Instance [ sa : Equivalence A ] => equiv_refl : Reflexive equiv. +Program Instance [ sa : Equivalence A ] => equiv_reflexive : Reflexive equiv. -Program Instance [ sa : Equivalence A ] => equiv_sym : Symmetric equiv. +Program Instance [ sa : Equivalence A ] => equiv_symmetric : Symmetric equiv. Next Obligation. Proof. symmetry ; auto. Qed. -Program Instance [ sa : Equivalence A ] => equiv_trans : Transitive equiv. +Program Instance [ sa : Equivalence A ] => equiv_transitive : Transitive equiv. Next Obligation. Proof. |