huge commit in automation:

[helm.git] / helm / software / matita / library / nat / times.ma

diff --git a/helm/software/matita/library/nat/times.ma b/helm/software/matita/library/nat/times.ma
index 32fbc7651caf25f77ee7e97e149e28336dc99a7c..f59622218e84c38535f862a7f8917fd7a5b4d87d 100644 (file)
--- a/helm/software/matita/library/nat/times.ma
+++ b/helm/software/matita/library/nat/times.ma
@@ -1,3 +1,4 @@
+
 (**************************************************************************)
 (*       __                                                               *)
 (*      ||M||                                                             *)
@@ -19,7 +20,7 @@ let rec times n m \def
  [ O \Rightarrow O
  | (S p) \Rightarrow m+(times p m) ].
 
-interpretation "natural times" 'times x y = (cic:/matita/nat/times/times.con x y).
+interpretation "natural times" 'times x y = (times x y).
 
 theorem times_Sn_m:
 \forall n,m:nat. m+n*m = S n*m.
@@ -36,13 +37,17 @@ theorem times_n_Sm :
 \forall n,m:nat. n+(n*m) = n*(S m).
 intros.elim n.
 simplify.reflexivity.
-simplify.apply eq_f.rewrite < H.
+simplify.
+demodulate all.
+(*
+apply eq_f.rewrite < H.
 transitivity ((n1+m)+n1*m).symmetry.apply assoc_plus.
 transitivity ((m+n1)+n1*m).
 apply eq_f2.
 apply sym_plus.
 reflexivity.
 apply assoc_plus.
+*)
 qed.
 
 theorem times_O_to_O: \forall n,m:nat.n*m = O \to n = O \lor m= O.
@@ -56,11 +61,11 @@ apply nat_elim2;intros
 qed.
 
 theorem times_n_SO : \forall n:nat. n = n * S O.
-intros.
+intros. demodulate. reflexivity. (*
 rewrite < times_n_Sm.
 rewrite < times_n_O.
 rewrite < plus_n_O.
-reflexivity.
+reflexivity.*)
 qed.
 
 theorem times_SSO_n : \forall n:nat. n + n = S (S O) * n.
@@ -93,10 +98,11 @@ qed.
 
 theorem symmetric_times : symmetric nat times. 
 unfold symmetric.
-intros.elim x.
-simplify.apply times_n_O.
+intros.elim x;
+ [ simplify. apply times_n_O.
+ | demodulate. reflexivity. (*
 (* applyS times_n_Sm. *) 
-simplify.rewrite > H.apply times_n_Sm.
+simplify.rewrite > H.apply times_n_Sm.*)]
 qed.
 
 variant sym_times : \forall n,m:nat. n*m = m*n \def
@@ -106,9 +112,12 @@ theorem distributive_times_plus : distributive nat times plus.
 unfold distributive.
 intros.elim x.
 simplify.reflexivity.
-simplify.rewrite > H. rewrite > assoc_plus.rewrite > assoc_plus.
+simplify.
+demodulate all.
+(*
+rewrite > H. rewrite > assoc_plus.rewrite > assoc_plus.
 apply eq_f.rewrite < assoc_plus. rewrite < (sym_plus ? z).
-rewrite > assoc_plus.reflexivity.
+rewrite > assoc_plus.reflexivity. *)
 qed.
 
 variant distr_times_plus: \forall n,m,p:nat. n*(m+p) = n*m + n*p
@@ -118,17 +127,23 @@ theorem associative_times: associative nat times.
 unfold associative.
 intros.
 elim x. simplify.apply refl_eq. 
-simplify.rewrite < sym_times.
+simplify.
+demodulate all.
+(*
+rewrite < sym_times.
 rewrite > distr_times_plus.
 rewrite < sym_times.
 rewrite < (sym_times (times n y) z).
 rewrite < H.apply refl_eq.
+*)
 qed.
 
 variant assoc_times: \forall n,m,p:nat. (n*m)*p = n*(m*p) \def
 associative_times.
 
 lemma times_times: ∀x,y,z. x*(y*z) = y*(x*z).
-intros.autobatch paramodulation.
+intros. 
+demodulate. reflexivity.
+(* autobatch paramodulation. *)
 qed.