Using the top-level syntax for let-rec definitions.

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

diff --git a/helm/matita/tests/match.ma b/helm/matita/tests/match.ma
index 2382ba7b71f6a22e1f740e57c6e2d9b5cbc03750..9494d9cc8a3b37a9fa375330dd26ca8828f4c570 100644 (file)
--- a/helm/matita/tests/match.ma
+++ b/helm/matita/tests/match.ma
@@ -98,7 +98,7 @@ qed.
 
 
 definition plus : nat \to nat \to nat \def
-let rec plus (n,m) \def 
+let rec plus n m \def 
  match n with 
  [ O \Rightarrow m
  | (S p) \Rightarrow S (plus p m) ]
@@ -124,7 +124,7 @@ intros.elim n.simplify.apply refl_equal.simplify.apply f_equal.assumption.
 qed.
 
 definition times : nat \to nat \to nat \def
-let rec times (n,m) \def 
+let rec times n m \def 
  match n with 
  [ O \Rightarrow O
  | (S p) \Rightarrow (plus m (times p m)) ]
@@ -152,7 +152,7 @@ simplify.elim (sym_eq ? ? ? H).apply times_n_Sm.
 qed.
 
 definition minus : nat \to nat \to nat \def
-let rec minus (n,m) \def 
+let rec minus n m \def 
  [\lambda n:nat.nat] match n with 
  [ O \Rightarrow O
  | (S p) \Rightarrow 
@@ -271,7 +271,7 @@ apply le_S_n.assumption.
 qed.
 
 definition leb : nat \to nat \to bool \def
-let rec leb (n,m) \def 
+let rec leb n m \def 
    [\lambda n:nat.bool] match n with 
     [ O \Rightarrow true
     | (S p) \Rightarrow