X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;ds=sidebyside;f=matita%2Fmatita%2Fcontribs%2Flambda_delta%2Fground_2%2Fstar.ma;fp=matita%2Fmatita%2Fcontribs%2Flambda_delta%2Fground_2%2Fstar.ma;h=c951ddac038e8d82b69c961a12d87fdc746385fc;hb=78d4844bcccb3deb58a3179151c3045298782b18;hp=c183111ddf429584bd0aca1b6548a9ae9ceee1cd;hpb=9d2ded02c4252d3db0a9f5249d5b5d0f84f48d04;p=helm.git

diff --git a/matita/matita/contribs/lambda_delta/ground_2/star.ma b/matita/matita/contribs/lambda_delta/ground_2/star.ma
index c183111dd..c951ddac0 100644
--- a/matita/matita/contribs/lambda_delta/ground_2/star.ma
+++ b/matita/matita/contribs/lambda_delta/ground_2/star.ma
@@ -18,7 +18,7 @@ include "ground_2/notation.ma".
 
 (* PROPERTIES OF RELATIONS **************************************************)
 
-definition Decidable: Prop → Prop ≝ λR. R ∨ (R → False).
+definition Decidable: Prop → Prop ≝ λR. R ∨ (R → ⊥).
 
 definition confluent2: ∀A. ∀R1,R2: relation A. Prop ≝ λA,R1,R2.
                        ∀a0,a1. R1 a0 a1 → ∀a2. R2 a0 a2 →
@@ -99,10 +99,10 @@ lemma TC_transitive2: ∀A,R1,R2.
 qed.
 
 definition NF: ∀A. relation A → relation A → predicate A ≝
-   λA,R,S,a1. ∀a2. R a1 a2 → S a1 a2.
+   λA,R,S,a1. ∀a2. R a1 a2 → S a2 a1.
 
 inductive SN (A) (R,S:relation A): predicate A ≝
-| SN_intro: ∀a1. (∀a2. R a1 a2 → (S a1 a2 → False) → SN A R S a2) → SN A R S a1
+| SN_intro: ∀a1. (∀a2. R a1 a2 → (S a2 a1 → ⊥) → SN A R S a2) → SN A R S a1
 .
 
 lemma NF_to_SN: ∀A,R,S,a. NF A R S a → SN A R S a.