ocaml 3.09 transition

[helm.git] / helm / matita / tests / rewrite.ma

diff --git a/helm/matita/tests/rewrite.ma b/helm/matita/tests/rewrite.ma
index aa4fa1f3285ad09f7cb64ce287cda697680b3881..a69e33d77c73915f30470fb3f11537df0695b1fc 100644 (file)
--- a/helm/matita/tests/rewrite.ma
+++ b/helm/matita/tests/rewrite.ma
@@ -1,9 +1,24 @@
+(**************************************************************************)
+(*       ___                                                              *)
+(*      ||M||                                                             *)
+(*      ||A||       A project by Andrea Asperti                           *)
+(*      ||T||                                                             *)
+(*      ||I||       Developers:                                           *)
+(*      ||T||         The HELM team.                                      *)
+(*      ||A||         http://helm.cs.unibo.it                             *)
+(*      \   /                                                             *)
+(*       \ /        This file is distributed under the terms of the       *)
+(*        v         GNU General Public License Version 2                  *)
+(*                                                                        *)
+(**************************************************************************)
+
 set "baseuri" "cic:/matita/tests/rewrite/".
+include "coq.ma".
 
 alias id "nat" = "cic:/Coq/Init/Datatypes/nat.ind#xpointer(1/1)".
 alias num (instance 0) = "natural number".
-alias symbol "eq" (instance 0) = "leibnitz's equality". 
-alias symbol "plus" (instance 0) = "natural plus".
+alias symbol "eq" (instance 0) = "Coq's leibnitz's equality". 
+alias symbol "plus" (instance 0) = "Coq's natural plus".
 alias id "plus_n_O" = "cic:/Coq/Init/Peano/plus_n_O.con".
 
 theorem a:
@@ -31,4 +46,19 @@ qed.
 theorem foo: \forall n. n = n + 0.
  intros.
  rewrite < t; reflexivity.
-qed.
\ No newline at end of file
+qed.
+
+theorem test_rewrite_in_hyp:
+          \forall n,m. n + 0 = m \to m = n + 0 \to n=m \land m+0=n+0.
+ intros.
+ rewrite < plus_n_O in H.
+ rewrite > plus_n_O in H1.
+ split; [ exact H | exact H1].
+qed.
+
+theorem test_rewrite_in_hyp2:
+          \forall n,m. n + 0 = m \to n + 0 = m \to n=m \land n+0=m.
+ intros.
+ rewrite < plus_n_O in H H1 \vdash (? ? %).
+ split; [ exact H | exact H1].
+qed.