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/static/ssta_lift.ma".
16 include "basic_2/unfold/lsstas.ma".
18 (* NAT-ITERATED STRATIFIED STATIC TYPE ASSIGNMENT FOR TERMS *****************)
20 (* Properties on relocation *************************************************)
22 lemma lsstas_lift: ∀h,g,G,l. l_liftable (llstar … (ssta h g G) l).
23 /3 width=10 by l_liftable_llstar, ssta_lift/ qed.
25 (* Inversion lemmas on relocation *******************************************)
27 lemma lsstas_inv_lift1: ∀h,g,G,l. l_deliftable_sn (llstar … (ssta h g G) l).
28 /3 width=6 by l_deliftable_sn_llstar, ssta_inv_lift1/ qed-.
30 (* Advanced inversion lemmas ************************************************)
32 lemma lsstas_inv_lref1: ∀h,g,G,L,U,i,l. ⦃G, L⦄ ⊢ #i •*[h, g, l+1] U →
33 (∃∃K,V,W. ⇩[i] L ≡ K.ⓓV & ⦃G, K⦄ ⊢ V •*[h, g, l+1] W &
36 (∃∃K,W,V,l0. ⇩[i] L ≡ K.ⓛW & ⦃G, K⦄ ⊢ W ▪[h, g] l0 &
37 ⦃G, K⦄ ⊢ W •*[h, g, l] V & ⇧[0, i + 1] V ≡ U
39 #h #g #G #L #U #i #l #H elim (lsstas_inv_step_sn … H) -H
40 #X #H #HXU elim (ssta_inv_lref1 … H) -H
41 * #K [ #V #W | #W #l0 ] #HLK [ #HVW | #HWl0 ] #HWX
42 lapply (ldrop_fwd_drop2 … HLK) #H0LK
43 elim (lsstas_inv_lift1 … HXU … H0LK … HWX) -H0LK -X
44 /4 width=8 by lsstas_step_sn, ex4_4_intro, ex3_3_intro, or_introl, or_intror/
47 (* Advanced forward lemmas **************************************************)
49 lemma lsstas_fwd_correct: ∀h,g,G,L,T1,U1. ⦃G, L⦄ ⊢ T1 •[h, g] U1 →
50 ∀T2,l. ⦃G, L⦄ ⊢ T1 •*[h, g, l] T2 →
51 ∃U2. ⦃G, L⦄ ⊢ T2 •[h, g] U2.
52 #h #g #G #L #T1 #U1 #HTU1 #T2 #l #H @(lsstas_ind_dx … H) -l -T2 [ /2 width=3 by ex_intro/ ] -HTU1
53 #l #T #T2 #_ #HT2 #_ -T1 -U1 -l
54 elim (ssta_fwd_correct … HT2) -T /2 width=2 by ex_intro/
57 (* Advanced properties ******************************************************)
59 lemma lsstas_total: ∀h,g,G,L,T,U. ⦃G, L⦄ ⊢ T •[h, g] U →
60 ∀l. ∃U0. ⦃G, L⦄ ⊢ T •*[h, g, l] U0.
61 #h #g #G #L #T #U #HTU #l @(nat_ind_plus … l) -l [ /2 width=2 by lstar_O, ex_intro/ ]
63 elim (lsstas_fwd_correct … HTU … HTU0) -U /3 width=4 by lsstas_step_dx, ex_intro/
66 lemma lsstas_ldef: ∀h,g,G,L,K,V,i. ⇩[i] L ≡ K.ⓓV →
67 ∀W,l. ⦃G, K⦄ ⊢ V •*[h, g, l+1] W →
68 ∀U. ⇧[0, i+1] W ≡ U → ⦃G, L⦄ ⊢ #i •*[h, g, l+1] U.
69 #h #g #G #L #K #V #i #HLK #W #l #HVW #U #HWU
70 lapply (ldrop_fwd_drop2 … HLK)
71 elim (lsstas_inv_step_sn … HVW) -HVW #W0
72 elim (lift_total W0 0 (i+1)) /3 width=12 by lsstas_step_sn, ssta_ldef, lsstas_lift/
75 lemma lsstas_ldec: ∀h,g,G,L,K,W,i. ⇩[i] L ≡ K.ⓛW → ∀l0. ⦃G, K⦄ ⊢ W ▪[h, g] l0 →
76 ∀V,l. ⦃G, K⦄ ⊢ W •*[h, g, l] V →
77 ∀U. ⇧[0, i+1] V ≡ U → ⦃G, L⦄ ⊢ #i •*[h, g, l+1] U.
78 #h #g #G #L #K #W #i #HLK #T #HWT #V #l #HWV #U #HVU
79 lapply (ldrop_fwd_drop2 … HLK) #H
80 elim (lift_total W 0 (i+1)) /3 width=12 by lsstas_step_sn, ssta_ldec, lsstas_lift/
83 (* Properties on degree assignment for terms ********************************)
85 lemma lsstas_da_conf: ∀h,g,G,L,T,U,l1. ⦃G, L⦄ ⊢ T •*[h, g, l1] U →
86 ∀l2. ⦃G, L⦄ ⊢ T ▪[h, g] l2 → ⦃G, L⦄ ⊢ U ▪[h, g] l2-l1.
87 #h #g #G #L #T #U #l1 #H @(lsstas_ind_dx … H) -U -l1 //
88 #l1 #U #U0 #_ #HU0 #IHTU #l2 #HT
89 <minus_plus /3 width=3 by ssta_da_conf/