- we proved that context-free reduction admits no one-step loops

[helm.git] / matita / matita / contribs / lambda_delta / Basic_2 / reducibility / cpr_lift.ma

diff --git a/matita/matita/contribs/lambda_delta/Basic_2/reducibility/cpr_lift.ma b/matita/matita/contribs/lambda_delta/Basic_2/reducibility/cpr_lift.ma
index 4c2101504a9a3eab9bc4c7e1d62a6035861747ac..457cb1b7d0c24ecabc3f548fe58ba31c6320d210 100644 (file)
--- a/matita/matita/contribs/lambda_delta/Basic_2/reducibility/cpr_lift.ma
+++ b/matita/matita/contribs/lambda_delta/Basic_2/reducibility/cpr_lift.ma
@@ -24,7 +24,8 @@ lemma cpr_cdelta: ∀L,K,V1,W1,W2,i.
                   ↓[0, i] L ≡ K. 𝕓{Abbr} V1 → K ⊢ V1 [0, |L| - i - 1] ≫* W1 →
                   ↑[0, i + 1] W1 ≡ W2 → L ⊢ #i ⇒ W2.
 #L #K #V1 #W1 #W2 #i #HLK #HVW1 #HW12
-@ex2_1_intro [2: // | skip | @tpss_subst /2 width=6/ ] (**) (* /4 width=6/ is too slow *)
+lapply (ldrop_fwd_ldrop2_length … HLK) #Hi
+@ex2_1_intro [2: // | skip | @tpss_subst /width=6/ ] (**) (* /3 width=6/ is too slow *)
 qed.
 
 (* Advanced inversion lemmas ************************************************)
@@ -40,12 +41,12 @@ lemma cpr_inv_lref1: ∀L,T2,i. L ⊢ #i ⇒ T2 →
 >(tpr_inv_atom1 … H) -H #H
 elim (tpss_inv_lref1 … H) -H /2/
 * /3 width=6/
-qed.
+qed-.
 
 (* Basic_1: was: pr2_gen_abst *)
 lemma cpr_inv_abst1: ∀V1,T1,U2. 𝕔{Abst} V1. T1 ⇒ U2 →
                      ∃∃V2,T2. V1 ⇒ V2 & T1 ⇒ T2 & U2 = 𝕔{Abst} V2. T2.
-/2/ qed.
+/2/ qed-.
 
 (* Relocation properties ****************************************************)