diff options
| author | letouzey | 2011-01-04 16:53:58 +0000 |
|---|---|---|
| committer | letouzey | 2011-01-04 16:53:58 +0000 |
| commit | fdda04b92b7347f252d41aa76693ec221a07fe47 (patch) | |
| tree | 73a4c02ac7dee04734d6ef72b322c33427e09293 /theories/Numbers/Integer/Abstract/ZBase.v | |
| parent | 8e2d90a6a9f4480026afd433fc997d9958f76a38 (diff) | |
f_equiv : a clone of f_equal that handles setoid equivalences
For example, if we know that [f] is a morphism for [E1==>E2==>E],
then the goal [E (f x y) (f x' y')] will be transformed by [f_equiv]
into the subgoals [E1 x x'] and [E2 y y'].
This way, we can remove most of the explicit use of the morphism
instances in Numbers (lemmas foo_wd for each operator foo).
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@13763 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Numbers/Integer/Abstract/ZBase.v')
| -rw-r--r-- | theories/Numbers/Integer/Abstract/ZBase.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Numbers/Integer/Abstract/ZBase.v b/theories/Numbers/Integer/Abstract/ZBase.v index 4afc10201e..510548527a 100644 --- a/theories/Numbers/Integer/Abstract/ZBase.v +++ b/theories/Numbers/Integer/Abstract/ZBase.v @@ -24,7 +24,7 @@ Qed. Theorem pred_inj_wd : forall n1 n2, P n1 == P n2 <-> n1 == n2. Proof. -intros n1 n2; split; [apply pred_inj | apply pred_wd]. +intros n1 n2; split; [apply pred_inj | intros; now f_equiv]. Qed. Lemma succ_m1 : S (-1) == 0. |