confluence of reduction started ...

diff --git a/matita/matita/lib/lambda-delta/reduction/pr_defs.ma b/matita/matita/lib/lambda-delta/reduction/pr_defs.ma
index b817d34ad7988339282aeb82a219dfaf1638903d..d45cbd0d84393512a72683057868b6f2eff38a3d 100644 (file)
--- a/matita/matita/lib/lambda-delta/reduction/pr_defs.ma
+++ b/matita/matita/lib/lambda-delta/reduction/pr_defs.ma
@@ -38,7 +38,7 @@ interpretation
    "single step parallel reduction (term)"
    'PR L T1 T2 = (pr L T1 T2).
 
-(* The basic properties *****************************************************)
+(* Basic properties *********************************************************)
 
 lemma pr_refl: ∀T,L. L ⊢ T ⇒ T.
 #T elim T -T //

diff --git a/matita/matita/lib/lambda-delta/reduction/pr_pr.ma b/matita/matita/lib/lambda-delta/reduction/pr_pr.ma
new file mode 100644 (file)
index 0000000..fc284e0
--- /dev/null
+++ b/matita/matita/lib/lambda-delta/reduction/pr_pr.ma
@@ -0,0 +1,84 @@
+(*
+    ||M||  This file is part of HELM, an Hypertextual, Electronic
+    ||A||  Library of Mathematics, developed at the Computer Science
+    ||T||  Department of the University of Bologna, Italy.
+    ||I||
+    ||T||
+    ||A||  This file is distributed under the terms of the
+    \   /  GNU General Public License Version 2
+     \ /
+      V_______________________________________________________________ *)
+
+include "lambda-delta/syntax/weight.ma".
+include "lambda-delta/reduction/pr_lift.ma".
+
+(* SINGLE STEP PARALLEL REDUCTION ON TERMS **********************************)
+
+(* Confluence lemmas ********************************************************)
+
+lemma pr_conf_sort_sort: ∀L,k1. ∃∃T0. L ⊢ (⋆k1) ⇒ T0 & L ⊢ (⋆k1) ⇒ T0.
+/2/ qed.
+
+lemma pr_conf_lref_lref: ∀L,i1. ∃∃T0. L ⊢ (#i1) ⇒ T0 & L ⊢ (#i1) ⇒ T0.
+/2/ qed.
+
+(* Confluence ***************************************************************)
+
+lemma pr_conf_aux:
+   ∀L,T. (
+      ∀L1,T1. #[L1, T1] < #[L, T] → 
+      ∀T3,T4. L1 ⊢ T1 ⇒ T3 → L1 ⊢ T1 ⇒ T4 →
+      ∃∃T0. L1 ⊢ T3 ⇒ T0 & L1 ⊢ T4 ⇒ T0
+         ) →
+   ∀K1,U1,T1,K2,U2,T2. K1 ⊢ U1 ⇒ T1 → K2 ⊢ U2 ⇒ T2 →
+   K1 = L → U1 = T → K2 = L → U2 = T →
+   ∃∃T0. L ⊢ T1 ⇒ T0 & L ⊢ T2 ⇒ T0.
+#L #T #IH #K1 #U1 #T1 #K2 #U2 #T2
+* -K1 U1 T1
+[ #K1 #k1 * -K2 U2 T2
+(* case 1: sort, sort *)
+  [ #K2 #k2 #H1 #H2 #H3 #H4 destruct -K1 K2 T k2 IH //
+(* case 2: sort, lref (excluded) *)
+  | #K2 #i2 #H1 #H2 #H3 #H4 destruct
+(* case 3: sort, bind (excluded) *)
+  | #K2 #I2 #V21 #V22 #T21 #T22 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 4: sort, flat (excluded) *)
+  | #K2 #I2 #V21 #V22 #T21 #T22 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 5: sort, beta (excluded) *)
+  | #K2 #V21 #V22 #W2 #T21 #T22 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 6: sort, delta (excluded) *)
+  | #K2 #K22 #V21 #V22 #V2 #i2 #_ #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 7: sort, theta (excluded) *)
+  | #K2 #V2 #V21 #V22 #W21 #W22 #T21 #T22 #_ #_ #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 8: sort, zeta (excluded) *)
+  | #K2 #V2 #T21 #T22 #T20 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 9: sort, tau (excluded) *)
+  | #K2 #V2 #T21 #T22 #_ #H1 #H2 #H3 #H4 destruct
+  ]
+| #K1 #i1 * -K2 U2 T2
+(* case 10: lref, sort (excluded) *)
+  [ #K2 #k2 #H1 #H2 #H3 #H4 destruct
+(* case 11: lref, sort (excluded) *)
+  | #K2 #i2 #H1 #H2 #H3 #H4 destruct -K1 K2 T i2 IH //
+(* case 12: lref, bind (excluded) *)
+  | #K2 #I2 #V21 #V22 #T21 #T22 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 13: lref, flat (excluded) *)
+  | #K2 #I2 #V21 #V22 #T21 #T22 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 14: lref, beta (excluded) *)
+  | #K2 #V21 #V22 #W2 #T21 #T22 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 15: lref, delta (excluded) *)
+  | #K2 #K22 #V21 #V22 #V2 #i2 #_ #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 16: lref, theta (excluded) *)
+  | #K2 #V2 #V21 #V22 #W21 #W22 #T21 #T22 #_ #_ #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 17: lref, zeta (excluded) *)
+  | #K2 #V2 #T21 #T22 #T20 #_ #_ #H1 #H2 #H3 #H4 destruct
+(* case 18: lref, tau (excluded) *)
+  | #K2 #V2 #T21 #T22 #_ #H1 #H2 #H3 #H4 destruct
+  ]  
+
+theorem pr_conf: ∀L,T,T1,T2. L ⊢ T ⇒ T1 → L ⊢ T ⇒ T2 →
+                 ∃∃T0. L ⊢ T1 ⇒ T0 & L ⊢ T2 ⇒ T0.
+#L #T @(cw_wf_ind … L T) -L T /3 width=12/
+qed.
+
+