1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 include "basic_2/notation/relations/lazysn_6.ma".
16 include "basic_2/substitution/lleq.ma".
17 include "basic_2/computation/lpxs.ma".
19 (* SN EXTENDED STRONGLY NORMALIZING LOCAL ENVIRONMENTS **********************)
21 definition lsx: ∀h. sd h → relation4 ynat term genv lenv ≝
22 λh,g,d,T,G. SN … (lpxs h g G) (lleq d T).
25 "extended strong normalization (local environment)"
26 'LazySN h g d T G L = (lsx h g T d G L).
28 (* Basic eliminators ********************************************************)
30 lemma lsx_ind: ∀h,g,G,T,d. ∀R:predicate lenv.
31 (∀L1. G ⊢ ⋕⬊*[h, g, T, d] L1 →
32 (∀L2. ⦃G, L1⦄ ⊢ ➡*[h, g] L2 → (L1 ⋕[T, d] L2 → ⊥) → R L2) →
35 ∀L. G ⊢ ⋕⬊*[h, g, T, d] L → R L.
36 #h #g #G #T #d #R #H0 #L1 #H elim H -L1
37 /5 width=1 by lleq_sym, SN_intro/
40 (* Basic properties *********************************************************)
42 lemma lsx_intro: ∀h,g,G,L1,T,d.
43 (∀L2. ⦃G, L1⦄ ⊢ ➡*[h, g] L2 → (L1 ⋕[T, d] L2 → ⊥) → G ⊢ ⋕⬊*[h, g, T, d] L2) →
44 G ⊢ ⋕⬊*[h, g, T, d] L1.
45 /5 width=1 by lleq_sym, SN_intro/ qed.
47 lemma lsx_atom: ∀h,g,G,T,d. G ⊢ ⋕⬊*[h, g, T, d] ⋆.
48 #h #g #G #T #d @lsx_intro
49 #X #H #HT lapply (lpxs_inv_atom1 … H) -H
50 #H destruct elim HT -HT //
53 lemma lsx_sort: ∀h,g,G,L,d,k. G ⊢ ⋕⬊*[h, g, ⋆k, d] L.
54 #h #g #G #L1 #d #k @lsx_intro
55 #L2 #HL12 #H elim H -H
56 /3 width=4 by lpxs_fwd_length, lleq_sort/
59 lemma lsx_gref: ∀h,g,G,L,d,p. G ⊢ ⋕⬊*[h, g, §p, d] L.
60 #h #g #G #L1 #d #p @lsx_intro
61 #L2 #HL12 #H elim H -H
62 /3 width=4 by lpxs_fwd_length, lleq_gref/
65 (* Basic forward lemmas *****************************************************)
67 lemma lsx_fwd_bind_sn: ∀h,g,a,I,G,L,V,T,d. G ⊢ ⋕⬊*[h, g, ⓑ{a,I}V.T, d] L →
68 G ⊢ ⋕⬊*[h, g, V, d] L.
69 #h #g #a #I #G #L #V #T #d #H @(lsx_ind … H) -L
70 #L1 #_ #IHL1 @lsx_intro
71 #L2 #HL12 #HV @IHL1 /3 width=4 by lleq_fwd_bind_sn/
74 lemma lsx_fwd_flat_sn: ∀h,g,I,G,L,V,T,d. G ⊢ ⋕⬊*[h, g, ⓕ{I}V.T, d] L →
75 G ⊢ ⋕⬊*[h, g, V, d] L.
76 #h #g #I #G #L #V #T #d #H @(lsx_ind … H) -L
77 #L1 #_ #IHL1 @lsx_intro
78 #L2 #HL12 #HV @IHL1 /3 width=3 by lleq_fwd_flat_sn/
81 lemma lsx_fwd_flat_dx: ∀h,g,I,G,L,V,T,d. G ⊢ ⋕⬊*[h, g, ⓕ{I}V.T, d] L →
82 G ⊢ ⋕⬊*[h, g, T, d] L.
83 #h #g #I #G #L #V #T #d #H @(lsx_ind … H) -L
84 #L1 #_ #IHL1 @lsx_intro
85 #L2 #HL12 #HV @IHL1 /3 width=3 by lleq_fwd_flat_dx/
88 lemma lsx_fwd_pair_sn: ∀h,g,I,G,L,V,T,d. G ⊢ ⋕⬊*[h, g, ②{I}V.T, d] L →
89 G ⊢ ⋕⬊*[h, g, V, d] L.
90 #h #g * /2 width=4 by lsx_fwd_bind_sn, lsx_fwd_flat_sn/
93 (* Basic inversion lemmas ***************************************************)
95 lemma lsx_inv_flat: ∀h,g,I,G,L,V,T,d. G ⊢ ⋕⬊*[h, g, ⓕ{I}V.T, d] L →
96 G ⊢ ⋕⬊*[h, g, V, d] L ∧ G ⊢ ⋕⬊*[h, g, T, d] L.
97 /3 width=3 by lsx_fwd_flat_sn, lsx_fwd_flat_dx, conj/ qed-.