new definition of lleq allows to complete the proof of lemma 1000

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / computation / cpxs_lleq.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/cpxs_lleq.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/cpxs_lleq.ma
index f8790c5d918229b077c40a70e6256f7be146ac03..6c5b811eb752600465ac755c479d7895c60a3da1 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/cpxs_lleq.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/cpxs_lleq.ma
@@ -12,7 +12,7 @@
 (*                                                                        *)
 (**************************************************************************)
 
-include "basic_2/reduction/lpx_leq.ma".
+include "basic_2/reduction/cpx_lleq.ma".
 include "basic_2/computation/cpxs.ma".
 
 (* CONTEXT-SENSITIVE EXTENDED PARALLEL COMPUTATION ON TERMS *****************)
@@ -20,12 +20,12 @@ include "basic_2/computation/cpxs.ma".
 (* Properties on lazy equivalence for local environments ********************)
 
 lemma lleq_cpxs_trans: ∀h,g,G,L2,T1,T2. ⦃G, L2⦄ ⊢ T1 ➡*[h, g] T2 →
-                       ∀L1. L1 ⋕[0, T1] L2 → ⦃G, L1⦄ ⊢ T1 ➡*[h, g] T2.
+                       ∀L1. L1 ⋕[T1, 0] L2 → ⦃G, L1⦄ ⊢ T1 ➡*[h, g] T2.
 #h #g #G #L2 #T1 #T2 #H @(cpxs_ind_dx … H) -T1
 /4 width=6 by lleq_cpx_conf_dx, lleq_cpx_trans, cpxs_strap2/
 qed-.
 
 lemma lleq_cpxs_conf_dx: ∀h,g,G,L2,T1,T2. ⦃G, L2⦄ ⊢ T1 ➡*[h, g] T2 →
-                         ∀L1. L1 ⋕[0, T1] L2 → L1 ⋕[0, T2] L2.
+                         ∀L1. L1 ⋕[T1, 0] L2 → L1 ⋕[T2, 0] L2.
 #h #g #G #L2 #T1 #T2 #H @(cpxs_ind … H) -T2 /3 width=6 by lleq_cpx_conf_dx/
 qed-.