X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Fcontribs%2Flambdadelta%2Fground%2Frelocation%2Fgr_pat_tls.ma;h=f31d01b5d4af621da8591a52b2a4f2253d608d19;hb=8bbe582d87984526f40182c4409cbfd43108cb79;hp=524e9aecc10b5db4d7fbdd667006a8ab30267480;hpb=55c768d7e45babb300b5010463ba3196a68f1bbe;p=helm.git

diff --git a/matita/matita/contribs/lambdadelta/ground/relocation/gr_pat_tls.ma b/matita/matita/contribs/lambdadelta/ground/relocation/gr_pat_tls.ma
index 524e9aecc..f31d01b5d 100644
--- a/matita/matita/contribs/lambdadelta/ground/relocation/gr_pat_tls.ma
+++ b/matita/matita/contribs/lambdadelta/ground/relocation/gr_pat_tls.ma
@@ -16,14 +16,14 @@ include "ground/arith/pnat_plus.ma".
 include "ground/relocation/gr_tls.ma".
 include "ground/relocation/gr_pat_eq.ma".
 
-(* POSITIVE APPLICATION FOR GENERIC RELOCATION MAPS ***********************************************************)
+(* POSITIVE APPLICATION FOR GENERIC RELOCATION MAPS *************************)
 
-(* Properties on tls ********************************************************)
+(* Constructions with gr_tls ************************************************)
 
 (* Note: this requires ↑ on first n *)
 (*** at_pxx_tls *)
 lemma gr_pat_unit_succ_tls (n) (f):
-      @❪𝟏,f❫ ≘ ↑n → @❪𝟏,⫱*[n]f❫ ≘ 𝟏.
+      @❪𝟏,f❫ ≘ ↑n → @❪𝟏,⫰*[n]f❫ ≘ 𝟏.
 #n @(nat_ind_succ … n) -n //
 #n #IH #f #Hf
 elim (gr_pat_inv_unit_succ … Hf) -Hf [|*: // ] #g #Hg #H0 destruct
@@ -32,7 +32,7 @@ qed.
 
 (* Note: this requires ↑ on third n2 *)
 (*** at_tls *)
-lemma gr_pat_tls (n2) (f): ⫯⫱*[↑n2]f ≡ ⫱*[n2]f → ∃i1. @❪i1,f❫ ≘ ↑n2.
+lemma gr_pat_tls (n2) (f): ⫯⫰*[↑n2]f ≡ ⫰*[n2]f → ∃i1. @❪i1,f❫ ≘ ↑n2.
 #n2 @(nat_ind_succ … n2) -n2
 [ /4 width=4 by gr_pat_eq_repl_back, gr_pat_refl, ex_intro/
 | #n2 #IH #f <gr_tls_swap <gr_tls_swap in ⊢ (??%→?); #H
@@ -42,13 +42,13 @@ lemma gr_pat_tls (n2) (f): ⫯⫱*[↑n2]f ≡ ⫱*[n2]f → ∃i1. @❪i1,f❫
 ]
 qed-.
 
-(* Inversion lemmas with tls ************************************************)
+(* Inversions with gr_tls ***************************************************)
 
 (* Note: this does not require ↑ on second and third p *)
 (*** at_inv_nxx *)
 lemma gr_pat_inv_succ_sn (p) (g) (i1) (j2):
       @❪↑i1,g❫ ≘ j2 → @❪𝟏,g❫ ≘ p →
-      ∃∃i2. @❪i1,⫱*[p]g❫ ≘ i2 & p+i2 = j2.
+      ∃∃i2. @❪i1,⫰*[p]g❫ ≘ i2 & p+i2 = j2.
 #p elim p -p
 [ #g #i1 #j2 #Hg #H
   elim (gr_pat_inv_unit_bi … H) -H [|*: // ] #f #H0
@@ -65,7 +65,7 @@ qed-.
 (* Note: this requires ↑ on first n2 *)
 (*** at_inv_tls *)
 lemma gr_pat_inv_succ_dx_tls (n2) (i1) (f):
-      @❪i1,f❫ ≘ ↑n2 → ⫯⫱*[↑n2]f ≡ ⫱*[n2]f.
+      @❪i1,f❫ ≘ ↑n2 → ⫯⫰*[↑n2]f ≡ ⫰*[n2]f.
 #n2 @(nat_ind_succ … n2) -n2
 [ #i1 #f #Hf elim (gr_pat_inv_unit_dx … Hf) -Hf // #g #H1 #H destruct
   /2 width=1 by gr_eq_refl/