X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground%2Frelocation%2Ffr2_nat.ma;h=59dec122901841abe12ab81ccc0e932f662f60df;hb=742e21da086654af82f308027250d00b50d67f52;hp=d71dc8fb4df8496e6f800baf28d0a68e74c42c85;hpb=55c768d7e45babb300b5010463ba3196a68f1bbe;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/ground/relocation/fr2_nat.ma b/matita/matita/contribs/lambdadelta/ground/relocation/fr2_nat.ma
index d71dc8fb4..59dec1229 100644
--- a/matita/matita/contribs/lambdadelta/ground/relocation/fr2_nat.ma
+++ b/matita/matita/contribs/lambdadelta/ground/relocation/fr2_nat.ma
@@ -17,7 +17,7 @@ include "ground/arith/nat_plus.ma".
 include "ground/arith/nat_lt.ma".
 include "ground/relocation/fr2_map.ma".
 
-(* NON-NEGATIVE APPLICATION FOR FINITE RELOCATION MAPS WITH PAIRS *******************************************)
+(* NON-NEGATIVE APPLICATION FOR FINITE RELOCATION MAPS WITH PAIRS ***********)
 
 (*** at *)
 inductive fr2_nat: fr2_map → relation nat ≝
@@ -36,11 +36,11 @@ interpretation
   "non-negative relational application (finite relocation maps with pairs)"
   'RAt l1 f l2 = (fr2_nat f l1 l2).
 
-(* Basic inversion lemmas ***************************************************)
+(* Basic inversions *********************************************************)
 
 (*** at_inv_nil *)
 lemma fr2_nat_inv_nil (l1) (l2):
-      @❪l1, ◊❫ ≘ l2 → l1 = l2.
+      @❨l1, ◊❩ ≘ l2 → l1 = l2.
 #l1 #l2 @(insert_eq_1 … (◊))
 #f * -f -l1 -l2
 [ //
@@ -51,9 +51,9 @@ qed-.
 
 (*** at_inv_cons *)
 lemma fr2_nat_inv_cons (f) (d) (h) (l1) (l2):
-      @❪l1, ❨d,h❩;f❫ ≘ l2 →
-      ∨∨ ∧∧ l1 < d & @❪l1, f❫ ≘ l2 
-       | ∧∧ d ≤ l1 & @❪l1+h, f❫ ≘ l2.
+      @❨l1, ❨d,h❩;f❩ ≘ l2 →
+      ∨∨ ∧∧ l1 < d & @❨l1, f❩ ≘ l2 
+       | ∧∧ d ≤ l1 & @❨l1+h, f❩ ≘ l2.
 #g #d #h #l1 #l2 @(insert_eq_1 … (❨d, h❩;g))
 #f * -f -l1 -l2
 [ #l #H destruct
@@ -64,7 +64,7 @@ qed-.
 
 (*** at_inv_cons *)
 lemma fr2_nat_inv_cons_lt (f) (d) (h) (l1) (l2):
-      @❪l1, ❨d,h❩;f❫ ≘ l2 → l1 < d → @❪l1, f❫ ≘ l2.
+      @❨l1, ❨d,h❩;f❩ ≘ l2 → l1 < d → @❨l1, f❩ ≘ l2.
 #f #d #h #l1 #h2 #H
 elim (fr2_nat_inv_cons … H) -H * // #Hdl1 #_ #Hl1d
 elim (nlt_ge_false … Hl1d Hdl1)
@@ -72,7 +72,7 @@ qed-.
 
 (*** at_inv_cons *)
 lemma fr2_nat_inv_cons_ge (f) (d) (h) (l1) (l2):
-      @❪l1, ❨d,h❩;f❫ ≘ l2 → d ≤ l1 → @❪l1+h, f❫ ≘ l2.
+      @❨l1, ❨d,h❩;f❩ ≘ l2 → d ≤ l1 → @❨l1+h, f❩ ≘ l2.
 #f #d #h #l1 #h2 #H
 elim (fr2_nat_inv_cons … H) -H * // #Hl1d #_ #Hdl1
 elim (nlt_ge_false … Hl1d Hdl1)