- we introduced the pointer_step rc in the perspective of proving

[helm.git] / matita / matita / contribs / lambda_delta / basic_2 / equivalence / cpcs_delift.ma

diff --git a/matita/matita/contribs/lambda_delta/basic_2/equivalence/cpcs_delift.ma b/matita/matita/contribs/lambda_delta/basic_2/equivalence/cpcs_delift.ma
index b812830ee9e3f5bde61789cd47f46d077a0f7131..7012ec11ed62816e80455c5f1e2c4f210adc1b58 100644 (file)
--- a/matita/matita/contribs/lambda_delta/basic_2/equivalence/cpcs_delift.ma
+++ b/matita/matita/contribs/lambda_delta/basic_2/equivalence/cpcs_delift.ma
@@ -12,6 +12,7 @@
 (*                                                                        *)
 (**************************************************************************)
 
+include "basic_2/unfold/delift_lift.ma".
 include "basic_2/unfold/delift_delift.ma".
 include "basic_2/computation/cprs_delift.ma".
 include "basic_2/equivalence/cpcs_cpcs.ma".
@@ -20,14 +21,14 @@ include "basic_2/equivalence/cpcs_cpcs.ma".
 
 (* Properties on inverse basic term relocation ******************************)
 
-lemma cpcs_zeta_delift_comm: ∀L,V,T1,T2. L.ⓓV ⊢ T1 ▼*[O, 1] ≡ T2 →
-                             L ⊢ T2 ⬌* ⓓV.T1.
+lemma cpcs_zeta_delift_comm: ∀L,V,T1,T2. L.ⓓV ⊢ ▼*[O, 1] T1 ≡ T2 →
+                             L ⊢ T2 ⬌* +ⓓV.T1.
 /3 width=1/ qed.
 
 (* Basic_1: was only: pc3_gen_cabbr *)
 lemma thin_cpcs_delift_mono: ∀L,U1,U2. L ⊢ U1 ⬌* U2 →
-                             ∀K,d,e. L ▼*[d, e] ≡ K → ∀T1. L ⊢ U1 ▼*[d, e] ≡ T1 →
-                             ∀T2. L ⊢ U2 ▼*[d, e] ≡ T2 → K ⊢ T1 ⬌* T2.
+                             ∀K,d,e. ▼*[d, e] L ≡ K → ∀T1. L ⊢ ▼*[d, e] U1 ≡ T1 →
+                             ∀T2. L ⊢ ▼*[d, e] U2 ≡ T2 → K ⊢ T1 ⬌* T2.
 #L #U1 #U2 #H #K #d #e #HLK #T1 #HTU1 #T2 #HTU2
 elim (cpcs_inv_cprs … H) -H #U #HU1 #HU2
 elim (thin_cprs_delift_conf … HU1 … HLK … HTU1) -U1 #T #HT1 #HUT