X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fmatita%2Ftests%2Ffguidi.ma;h=07e7989ceb38745e55dca3d61b0a9556f0cd180f;hb=7bbce6bc163892cfd99cfcda65db42001b86789f;hp=8958b250de097fe9974b0406c1798d9c7e15cd74;hpb=6b5e1d495c61f459738187e8d71efadb162abdbe;p=helm.git diff --git a/helm/matita/tests/fguidi.ma b/helm/matita/tests/fguidi.ma index 8958b250d..07e7989ce 100644 --- a/helm/matita/tests/fguidi.ma +++ b/helm/matita/tests/fguidi.ma @@ -10,9 +10,9 @@ alias id "ex_intro" = "cic:/Coq/Init/Logic/ex.ind#xpointer(1/1/1)". alias id "False" = "cic:/Coq/Init/Logic/False.ind#xpointer(1/1)". alias id "True" = "cic:/Coq/Init/Logic/True.ind#xpointer(1/1)". -alias symbol "and" (instance 0) = "logical and". -alias symbol "eq" (instance 0) = "leibnitz's equality". -alias symbol "exists" (instance 0) = "exists". +alias symbol "and" (instance 0) = "Coq's logical and". +alias symbol "eq" (instance 0) = "Coq's leibnitz's equality". +alias symbol "exists" (instance 0) = "Coq's exists". definition is_S: nat \to Prop \def \lambda n. match n with @@ -53,7 +53,7 @@ qed. theorem le_gen_x_O_aux: \forall x, y. (le x y) \to (y =O) \to (x = O). -intros 3. elim H. auto. apply eq_gen_S_O. exact e3. auto. +intros 3. elim H. auto. apply eq_gen_S_O. exact n1. auto. qed. theorem le_gen_x_O: \forall x. (le x O) \to (x = O). @@ -68,7 +68,7 @@ theorem le_gen_S_x_aux: \forall m,x,y. (le y x) \to (y = S m) \to (\exists n. x = (S n) \land (le m n)). intros 4. elim H. apply eq_gen_S_O. exact m. elim H1. auto. -cut e4 = m. elim Hcut. apply ex_intro. exact e3. auto. auto. +cut n = m. elim Hcut. apply ex_intro. exact n1. auto. auto. qed. theorem le_gen_S_x: \forall m,x. (le (S m) x) \to @@ -90,10 +90,10 @@ qed. theorem le_gen_S_S_cc: \forall m,n. (le m n) \to (le (S m) (S n)). intros. auto. qed. + (* theorem le_trans: \forall x,y. (le x y) \to \forall z. (le y z) \to (le x z). -intros 1. elim x. -clear x. auto. -clear H. fwd H1 [H]. decompose H. +intros 1. elim x; clear H. clear x. +auto. +fwd H1 [H]. decompose H. *) -