]> matita.cs.unibo.it Git - helm.git/blobdiff - matita/matita/contribs/lambdadelta/basic_2/relocation/lreq_lreq.ma
advances towards confluence of reduction in local environments ...
[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / relocation / lreq_lreq.ma
index 70abd6f5bcd45fcd72b1a04ceb9407726991e801..42aaf3eea96a40d58d772dae5619b9e24c12fd45 100644 (file)
@@ -13,7 +13,6 @@
 (**************************************************************************)
 
 include "basic_2/relocation/lexs_lexs.ma".
-include "basic_2/relocation/lreq.ma".
 
 (* RANGED EQUIVALENCE FOR LOCAL ENVIRONMENTS ********************************)
 
@@ -28,10 +27,10 @@ theorem lreq_canc_sn: ∀f. left_cancellable … (lreq f).
 theorem lreq_canc_dx: ∀f. right_cancellable … (lreq f).
 /3 width=3 by lexs_canc_dx, lreq_trans, lreq_sym/ qed-.
 
-theorem lreq_join: ∀L1,L2,f1. L1 ≡[f1] L2 → ∀f2. L1 ≡[f2] L2 →
+theorem lreq_join: ∀f1,L1,L2. L1 ≡[f1] L2 → ∀f2. L1 ≡[f2] L2 →
                    ∀f. f1 ⋓ f2 ≡ f → L1 ≡[f] L2.
 /2 width=5 by lexs_join/ qed-.
 
-theorem lreq_meet: ∀L1,L2,f1. L1 ≡[f1] L2 → ∀f2. L1 ≡[f2] L2 →
+theorem lreq_meet: ∀f1,L1,L2. L1 ≡[f1] L2 → ∀f2. L1 ≡[f2] L2 →
                    ∀f. f1 ⋒ f2 ≡ f → L1 ≡[f] L2.
 /2 width=5 by lexs_meet/ qed-.