- we introduced the pointer_step rc in the perspective of proving

[helm.git] / matita / matita / contribs / lambda_delta / basic_2 / substitution / lift_vector.ma

diff --git a/matita/matita/contribs/lambda_delta/basic_2/substitution/lift_vector.ma b/matita/matita/contribs/lambda_delta/basic_2/substitution/lift_vector.ma
index aa0a30f9559f6c246a5943c1b4ab5c7f9b949846..35ecb653533012cf4692f4663a560bab3c1dbe35 100644 (file)
--- a/matita/matita/contribs/lambda_delta/basic_2/substitution/lift_vector.ma
+++ b/matita/matita/contribs/lambda_delta/basic_2/substitution/lift_vector.ma
@@ -12,8 +12,8 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "Basic_2/grammar/term_vector.ma".
-include "Basic_2/substitution/lift.ma".
+include "basic_2/grammar/term_vector.ma".
+include "basic_2/substitution/lift.ma".
 
 (* BASIC TERM VECTOR RELOCATION *********************************************)
 
@@ -21,7 +21,7 @@ inductive liftv (d,e:nat) : relation (list term) ≝
 | liftv_nil : liftv d e ◊ ◊
 | liftv_cons: ∀T1s,T2s,T1,T2.
               ⇧[d, e] T1 ≡ T2 → liftv d e T1s T2s →
-              liftv d e (T1 :: T1s) (T2 :: T2s)
+              liftv d e (T1 @ T1s) (T2 @ T2s)
 .
 
 interpretation "relocation (vector)" 'RLift d e T1s T2s = (liftv d e T1s T2s).
@@ -37,18 +37,18 @@ lemma liftv_inv_nil1: ∀T2s,d,e. ⇧[d, e] ◊ ≡ T2s → T2s = ◊.
 /2 width=5/ qed-.
 
 fact liftv_inv_cons1_aux: ∀T1s,T2s,d,e. ⇧[d, e] T1s ≡ T2s →
-                          ∀U1,U1s. T1s = U1 :: U1s →
+                          ∀U1,U1s. T1s = U1 @ U1s →
                           ∃∃U2,U2s. ⇧[d, e] U1 ≡ U2 & ⇧[d, e] U1s ≡ U2s &
-                                    T2s = U2 :: U2s.
+                                    T2s = U2 @ U2s.
 #T1s #T2s #d #e * -T1s -T2s
 [ #U1 #U1s #H destruct
 | #T1s #T2s #T1 #T2 #HT12 #HT12s #U1 #U1s #H destruct /2 width=5/
 ]
 qed.
 
-lemma liftv_inv_cons1: ∀U1,U1s,T2s,d,e. ⇧[d, e] U1 :: U1s ≡ T2s →
+lemma liftv_inv_cons1: ∀U1,U1s,T2s,d,e. ⇧[d, e] U1 @ U1s ≡ T2s →
                        ∃∃U2,U2s. ⇧[d, e] U1 ≡ U2 & ⇧[d, e] U1s ≡ U2s &
-                                 T2s = U2 :: U2s.
+                                 T2s = U2 @ U2s.
 /2 width=3/ qed-.
 
 (* Basic properties *********************************************************)