lenv refinement for native validity removed from big tree reduction

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

diff --git a/matita/matita/contribs/lambdadelta/basic_2/computation/yprs_yprs.ma b/matita/matita/contribs/lambdadelta/basic_2/computation/yprs_yprs.ma
index 4fd2d2a6080696a057243800721466a97046268e..f28153053b8ed566eadf738ce48a1f4fd4d85bd5 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/computation/yprs_yprs.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/computation/yprs_yprs.ma
@@ -16,5 +16,15 @@ include "basic_2/computation/yprs.ma".
 
 (* "BIG TREE" PARALLEL COMPUTATION FOR CLOSURES *****************************)
 
-theorem yprs_trans: ∀h,g. bi_transitive … (yprs h g).
-/2 width=4/ qed-.
+(* Main properties **********************************************************)
+
+theorem yprs_trans: ∀h,g. tri_transitive … (yprs h g).
+/2 width=5 by tri_TC_transitive/ qed-.
+
+(* Advanced properties ******************************************************)
+
+lemma cpr_lpr_ssta_yprs: ∀h,g,G,L1,L2,T1,T2,U2,l2.
+                         ⦃G, L1⦄ ⊢ T1 ➡ T2 → ⦃G, L1⦄ ⊢ ➡ L2 →
+                         ⦃G, L2⦄ ⊢ T2 ▪[h, g] l2+1 → ⦃G, L2⦄ ⊢ T2 •[h, g] U2 →
+                         ⦃G, L1, T1⦄ ≥[h, g] ⦃G, L2, U2⦄.
+/3 width=5 by yprs_trans, cpr_lpr_yprs, ssta_yprs/ qed.