- exclusion binder in local environments

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / rt_transition / cpr.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/rt_transition/cpr.ma b/matita/matita/contribs/lambdadelta/basic_2/rt_transition/cpr.ma
index 382bb119be09cc145ba829527584b88eadd43ffe..fd5163073baa4891db4e5c0d4a6adca55f699335 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/rt_transition/cpr.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/rt_transition/cpr.ma
@@ -16,19 +16,33 @@ include "basic_2/rt_transition/cpm.ma".
 
 (* CONTEXT-SENSITIVE PARALLEL R-TRANSITION FOR TERMS ************************)
 
+(* Basic properties *********************************************************)
+
+(* Note: cpr_flat: does not hold in basic_1 *)
+(* Basic_1: includes: pr2_thin_dx *)
+lemma cpr_flat: ∀h,I,G,L,V1,V2,T1,T2.
+                ⦃G, L⦄ ⊢ V1 ➡[h] V2 → ⦃G, L⦄ ⊢ T1 ➡[h] T2 →
+                ⦃G, L⦄ ⊢ ⓕ{I}V1.T1 ➡[h] ⓕ{I}V2.T2.
+#h * /2 width=1 by cpm_cast, cpm_appl/
+qed. 
+
+(* Basic_1: was: pr2_head_1 *)
+lemma cpr_pair_sn: ∀h,I,G,L,V1,V2. ⦃G, L⦄ ⊢ V1 ➡[h] V2 →
+                   ∀T. ⦃G, L⦄ ⊢ ②{I}V1.T ➡[h] ②{I}V2.T.
+#h * /2 width=1 by cpm_bind, cpr_flat/
+qed.
+
 (* Basic inversion properties ***********************************************)
 
 lemma cpr_inv_atom1: ∀h,J,G,L,T2. ⦃G, L⦄ ⊢ ⓪{J} ➡[h] T2 →
                      ∨∨ T2 = ⓪{J}
                       | ∃∃K,V1,V2. ⦃G, K⦄ ⊢ V1 ➡[h] V2 & ⬆*[1] V2 ≡ T2 &
                                    L = K.ⓓV1 & J = LRef 0
-                      | ∃∃I,K,V,T,i. ⦃G, K⦄ ⊢ #i ➡[h] T & ⬆*[1] T ≡ T2 &
-                                     L = K.ⓑ{I}V & J = LRef (⫯i).
+                      | ∃∃I,K,T,i. ⦃G, K⦄ ⊢ #i ➡[h] T & ⬆*[1] T ≡ T2 &
+                                   L = K.ⓘ{I} & J = LRef (⫯i).
 #h #J #G #L #T2 #H elim (cpm_inv_atom1 … H) -H *
-/3 width=9 by or3_intro0, or3_intro1, or3_intro2, ex4_5_intro, ex4_3_intro/
-[ #n #_ #_ #H destruct
-| #n #K #V1 #V2 #_ #_ #_ #_ #H destruct
-]
+/3 width=8 by tri_lt, or3_intro0, or3_intro1, or3_intro2, ex4_4_intro, ex4_3_intro/
+#n #_ #_ #H destruct
 qed-.
 
 (* Basic_1: includes: pr0_gen_sort pr2_gen_sort *)
@@ -37,25 +51,34 @@ lemma cpr_inv_sort1: ∀h,G,L,T2,s. ⦃G, L⦄ ⊢ ⋆s ➡[h] T2 → T2 = ⋆s.
 qed-.
 
 lemma cpr_inv_zero1: ∀h,G,L,T2. ⦃G, L⦄ ⊢ #0 ➡[h] T2 →
-                     T2 = #0 ∨
-                     ∃∃K,V1,V2. ⦃G, K⦄ ⊢ V1 ➡[h] V2 & ⬆*[1] V2 ≡ T2 &
-                                L = K.ⓓV1.
+                     ∨∨ T2 = #0
+                      | ∃∃K,V1,V2. ⦃G, K⦄ ⊢ V1 ➡[h] V2 & ⬆*[1] V2 ≡ T2 &
+                                   L = K.ⓓV1.
 #h #G #L #T2 #H elim (cpm_inv_zero1 … H) -H *
 /3 width=6 by ex3_3_intro, or_introl, or_intror/
 #n #K #V1 #V2 #_ #_ #_ #H destruct
 qed-.
 
 lemma cpr_inv_lref1: ∀h,G,L,T2,i. ⦃G, L⦄ ⊢ #⫯i ➡[h] T2 →
-                     T2 = #(⫯i) ∨
-                     ∃∃I,K,V,T. ⦃G, K⦄ ⊢ #i ➡[h] T & ⬆*[1] T ≡ T2 & L = K.ⓑ{I}V.
+                     ∨∨ T2 = #(⫯i)
+                      | ∃∃I,K,T. ⦃G, K⦄ ⊢ #i ➡[h] T & ⬆*[1] T ≡ T2 & L = K.ⓘ{I}.
 #h #G #L #T2 #i #H elim (cpm_inv_lref1 … H) -H *
-/3 width=7 by ex3_4_intro, or_introl, or_intror/
+/3 width=6 by ex3_3_intro, or_introl, or_intror/
 qed-.
 
 lemma cpr_inv_gref1: ∀h,G,L,T2,l. ⦃G, L⦄ ⊢ §l ➡[h] T2 → T2 = §l.
 #h #G #L #T2 #l #H elim (cpm_inv_gref1 … H) -H //
 qed-.
 
+(* Basic_1: includes: pr0_gen_cast pr2_gen_cast *)
+lemma cpr_inv_cast1: ∀h,G,L,V1,U1,U2. ⦃G, L⦄ ⊢ ⓝ V1.U1 ➡[h] U2 →
+                     ∨∨ ∃∃V2,T2. ⦃G, L⦄ ⊢ V1 ➡[h] V2 & ⦃G, L⦄ ⊢ U1 ➡[h] T2 &
+                                 U2 = ⓝV2.T2
+                      | ⦃G, L⦄ ⊢ U1 ➡[h] U2.
+#h #G #L #V1 #U1 #U2 #H elim (cpm_inv_cast1 … H) -H
+/2 width=1 by or_introl, or_intror/ * #n #_ #H destruct
+qed-.
+
 lemma cpr_inv_flat1: ∀h,I,G,L,V1,U1,U2. ⦃G, L⦄ ⊢ ⓕ{I}V1.U1 ➡[h] U2 →
                      ∨∨ ∃∃V2,T2. ⦃G, L⦄ ⊢ V1 ➡[h] V2 & ⦃G, L⦄ ⊢ U1 ➡[h] T2 &
                                  U2 = ⓕ{I}V2.T2
@@ -67,18 +90,12 @@ lemma cpr_inv_flat1: ∀h,I,G,L,V1,U1,U2. ⦃G, L⦄ ⊢ ⓕ{I}V1.U1 ➡[h] U2 
                                               ⦃G, L⦄ ⊢ W1 ➡[h] W2 & ⦃G, L.ⓓW1⦄ ⊢ T1 ➡[h] T2 &
                                               U1 = ⓓ{p}W1.T1 &
                                               U2 = ⓓ{p}W2.ⓐV2.T2 & I = Appl.
-#h #I #G #L #V1 #U1 #U2 #H elim (cpm_inv_flat1 … H) -H *
-/3 width=13 by or4_intro0, or4_intro1, or4_intro2, or4_intro3, ex7_7_intro, ex6_6_intro, ex3_2_intro, conj/
-#n #_ #_ #H destruct
-qed-.
-
-(* Basic_1: includes: pr0_gen_cast pr2_gen_cast *)
-lemma cpr_inv_cast1: ∀h,G,L,V1,U1,U2. ⦃G, L⦄ ⊢ ⓝ V1. U1 ➡[h] U2 → (
-                     ∃∃V2,T2. ⦃G, L⦄ ⊢ V1 ➡[h] V2 & ⦃G, L⦄ ⊢ U1 ➡[h] T2 &
-                              U2 = ⓝV2.T2
-                     ) ∨ ⦃G, L⦄ ⊢ U1 ➡[h] U2.
-#h #G #L #V1 #U1 #U2 #H elim (cpm_inv_cast1 … H) -H
-/2 width=1 by or_introl, or_intror/ * #n #_ #H destruct
+#h * #G #L #V1 #U1 #U2 #H
+[ elim (cpm_inv_appl1 … H) -H *
+  /3 width=13 by or4_intro0, or4_intro2, or4_intro3, ex7_7_intro, ex6_6_intro, ex3_2_intro/
+| elim (cpr_inv_cast1 … H) -H [ * ]
+  /3 width=5 by or4_intro0, or4_intro1, ex3_2_intro, conj/
+]
 qed-.
 
 (* Basic_1: removed theorems 12:
@@ -88,7 +105,3 @@ qed-.
             pr2_gen_csort pr2_gen_cflat pr2_gen_cbind
             pr2_gen_ctail pr2_ctail
 *)
-(* Basic_1: removed local theorems 4:
-            pr0_delta_eps pr0_cong_delta
-            pr2_free_free pr2_free_delta
-*)