update in ground_2, static_2, basic_2, apps_2, alpha_1

[helm.git] / matita / matita / contribs / lambdadelta / apps_2 / functional / flifts.ma

diff --git a/matita/matita/contribs/lambdadelta/apps_2/functional/flifts.ma b/matita/matita/contribs/lambdadelta/apps_2/functional/flifts.ma
index 30b8b65170937fda18daec0d02b4fd0f9e335ae7..10d9636db228563956e9dbc7d23d0de49129e820 100644 (file)
--- a/matita/matita/contribs/lambdadelta/apps_2/functional/flifts.ma
+++ b/matita/matita/contribs/lambdadelta/apps_2/functional/flifts.ma
@@ -21,12 +21,12 @@ include "static_2/relocation/lifts.ma".
 rec definition flifts f U on U ≝ match U with
 [ TAtom I     ⇒ match I with
   [ Sort _ ⇒ U
-  | LRef i â\87\92 #(f@â\9d´iâ\9dµ)
+  | LRef i â\87\92 #(f@â\9d¨iâ\9d©)
   | GRef _ ⇒ U
   ]
 | TPair I V T ⇒ match I with
-  [ Bind2 p I ⇒ ⓑ{p,I}(flifts f V).(flifts (⫯f) T)
-  | Flat2 I   ⇒ ⓕ{I}(flifts f V).(flifts f T)
+  [ Bind2 p I ⇒ ⓑ[p,I](flifts f V).(flifts (⫯f) T)
+  | Flat2 I   ⇒ ⓕ[I](flifts f V).(flifts f T)
   ]
 ].
 
@@ -38,25 +38,25 @@ interpretation "uniform functional relocation (term)"
 
 (* Basic properties *********************************************************)
 
-lemma flifts_lref (f) (i): â\86\91*[f](#i) = #(f@â\9d´iâ\9dµ).
+lemma flifts_lref (f) (i): â\86\91*[f](#i) = #(f@â\9d¨iâ\9d©).
 // qed.
 
-lemma flifts_bind (f) (p) (I) (V) (T): ↑*[f](ⓑ{p,I}V.T) = ⓑ{p,I}↑*[f]V.↑*[⫯f]T.
+lemma flifts_bind (f) (p) (I) (V) (T): ↑*[f](ⓑ[p,I]V.T) = ⓑ[p,I]↑*[f]V.↑*[⫯f]T.
 // qed.
 
-lemma flifts_flat (f) (I) (V) (T): ↑*[f](ⓕ{I}V.T) = ⓕ{I}↑*[f]V.↑*[f]T.
+lemma flifts_flat (f) (I) (V) (T): ↑*[f](ⓕ[I]V.T) = ⓕ[I]↑*[f]V.↑*[f]T.
 // qed.
 
 (* Main properties **********************************************************)
 
-theorem flifts_lifts: â\88\80T,f. â¬\86*[f]T ≘ ↑*[f]T.
+theorem flifts_lifts: â\88\80T,f. â\87§*[f]T ≘ ↑*[f]T.
 #T elim T -T *
 /2 width=1 by lifts_sort, lifts_lref, lifts_gref, lifts_bind, lifts_flat/
 qed.
 
 (* Main inversion properties ************************************************)
 
-theorem flifts_inv_lifts: â\88\80f,T1,T2. â¬\86*[f]T1 ≘ T2 → ↑*[f]T1 = T2.
+theorem flifts_inv_lifts: â\88\80f,T1,T2. â\87§*[f]T1 ≘ T2 → ↑*[f]T1 = T2.
 #f #T1 #T2 #H elim H -f -T1 -T2 //
 [ #f #i1 #i2 #H <(at_inv_total … H) //
 | #f #p #I #V1 #V2 #T1 #T2 #_ #_ #IHV #IHT <IHV <IHT -V2 -T2 //