2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department of the University of Bologna, Italy.
7 ||A|| This file is distributed under the terms of the
8 \ / GNU General Public License Version 2
10 V_______________________________________________________________ *)
12 include "lambda/subst.ma".
13 include "basics/list.ma".
16 (*************************** substl *****************************)
18 let rec substl (G:list T) (N:T) : list T ≝
21 | cons A D ⇒ ((subst A (length T D) N)::(substl D N))
25 nlemma substl_cons: ∀A,N.∀G.
26 substl (A::G) N = (subst_aux A (length T G) N)::(substl G N).
31 nlemma length_cons: ∀A.∀G. length T (A::G) = length T G + 1.
34 (****************************************************************)
36 axiom A: nat → nat → Prop.
37 axiom R: nat → nat → nat → Prop.
38 axiom conv: T → T → Prop.
40 inductive TJ: list T → T → T → Prop ≝
41 | ax : ∀i,j. A i j → TJ (nil T) (Sort i) (Sort j)
42 | start: ∀G.∀A.∀i.TJ G A (Sort i) → TJ (A::G) (Rel 0) (lift A 0 1)
44 TJ G A B → TJ G C (Sort i) → TJ (C::G) (lift A 0 1) (lift B 0 1)
45 | prod: ∀G.∀A,B.∀i,j,k. R i j k →
46 TJ G A (Sort i) → TJ (A::G) B (Sort j) → TJ G (Prod A B) (Sort k)
48 TJ G F (Prod A B) → TJ G a A → TJ G (App F a) (subst B 0 a)
50 TJ (A::G) b B → TJ G (Prod A B) (Sort i) → TJ G (Lambda A b) (Prod A B)
51 | conv: ∀G.∀A,B,C.∀i. conv B C →
52 TJ G A B → TJ G B (Sort i) → TJ G A C
54 TJ G A B → TJ G B (Sort i) → TJ G (D A) B.
56 notation "hvbox(G break ⊢ A : B)" non associative with precedence 50 for @{'TJ $G $A $B}.
57 interpretation "type judgement" 'TJ G A B = (TJ G A B).
59 (* ninverter TJ_inv2 for TJ (%?%) : Prop. *)
61 (**** definitions ****)
63 inductive Glegal (G: list T) : Prop ≝
64 glegalk : ∀A,B. G ⊢ A : B → Glegal G.
66 inductive Gterm (G: list T) (A:T) : Prop ≝
67 | is_term: ∀B.G ⊢ A:B → Gterm G A
68 | is_type: ∀B.G ⊢ B:A → Gterm G A.
70 inductive Gtype (G: list T) (A:T) : Prop ≝
71 gtypek: ∀i.G ⊢ A : Sort i → Gtype G A.
73 inductive Gelement (G:list T) (A:T) : Prop ≝
74 gelementk: ∀B.G ⊢ A:B → Gtype G B → Gelement G A.
76 inductive Tlegal (A:T) : Prop ≝
77 tlegalk: ∀G. Gterm G A → Tlegal A.
80 ndefinition Glegal ≝ λG: list T.∃A,B:T.TJ G A B .
82 ndefinition Gterm ≝ λG: list T.λA.∃B.TJ G A B ∨ TJ G B A.
84 ndefinition Gtype ≝ λG: list T.λA.∃i.TJ G A (Sort i).
86 ndefinition Gelement ≝ λG: list T.λA.∃B.TJ G A B ∨ Gtype G B.
88 ndefinition Tlegal ≝ λA:T.∃G: list T.Gterm G A.
92 ntheorem free_var1: ∀G.∀A,B,C. TJ G A B →
94 #G; #i; #j; #axij; #Gleg; ncases Gleg;
95 #A; #B; #tjAB; nelim tjAB; /2/; (* bello *) nqed.
98 theorem start_lemma1: ∀G.∀i,j.
99 A i j → Glegal G → G ⊢ Sort i: Sort j.
100 #G #i #j #axij #Gleg (cases Gleg)
101 #A #B #tjAB (elim tjAB) /2/
104 theorem start_rel: ∀G.∀A.∀C.∀n,i,q.
105 G ⊢ C: Sort q → G ⊢ Rel n: lift A 0 i → (C::G) ⊢ Rel (S n): lift A 0 (S i).
106 #G #A #C #n #i #p #tjC #tjn
107 (applyS (weak G (Rel n))) //. (* bello *)
109 nrewrite > (plus_n_O i);
110 nrewrite > (plus_n_Sm i O);
111 nrewrite < (lift_lift A 1 i);
112 nrewrite > (plus_n_O n); nrewrite > (plus_n_Sm n O);
113 applyS (weak G (Rel n) (lift A i) C p tjn tjC). *)
116 theorem start_lemma2: ∀G.
117 Glegal G → ∀n. n < |G| → G ⊢ Rel n: lift (nth n T G (Rel O)) 0 (S n).
118 #G #Gleg (cases Gleg) #A #B #tjAB (elim tjAB) /2/
119 [#i #j #axij #p normalize #abs @False_ind @(absurd … abs) //
120 |#G #A #i #tjA #Hind #m (cases m) /2/
121 #p #Hle @start_rel // @Hind @le_S_S_to_le @Hle
122 |#G #A #B #C #i #tjAB #tjC #Hind1 #_ #m (cases m)
123 /2/ #p #Hle @start_rel // @Hind1 @le_S_S_to_le @Hle
128 nlet rec TJm G D on D : Prop ≝
131 | cons A D1 ⇒ TJ G (Rel 0) A ∧ TJm G D1
134 nlemma tjm1: ∀G,D.∀A. TJm G (A::D) → TJ G (Rel 0) A.
135 #G; #D; #A; *; //; nqed.
137 ntheorem transitivity_tj: ∀D.∀A,B. TJ D A B →
138 ∀G. Glegal G → TJm G D → TJ G A B.
139 #D; #A; #B; #tjAB; nelim tjAB;
142 ##|#E; #T; #T0; #T1; #n; #tjT; #tjT1; #H; #H1; #G; #HlegG;
147 ntheorem substitution_tj:
148 ∀G.∀A,B,N,M.TJ (A::G) M B → TJ G N A →
149 TJ G (subst N M) (subst N B).
151 napply (TJ_inv2 (A::G) M B);
153 ##|#G; #A; #N; #tjA; #Hind; #Heq;
155 ##|#G; #A; #B; #C; #n; #tjA; #tjC; #Hind1; #Hind2; #Heq;
157 ##|nnormalize; #E; #A; #B; #i; #j; #k;
158 #Ax; #tjA; #tjB; #Hind1; #_;
159 #Heq; #HeqB; #tjN; napply (prod ?????? Ax);
161 ##|nnormalize; napplyS weak;
166 axiom conv_subst: ∀P,Q,N,i.conv P Q → conv P[i := N] Q[i := N].
168 theorem substitution_tj:
169 ∀E.∀A,B,M. E ⊢M:B → ∀G,D.∀N. E = D@A::G → G ⊢ N:A →
170 ((substl D N)@G) ⊢ M[|D| := N]: B[|D| := N].
171 #E #A #B #M #tjMB (elim tjMB)
172 [normalize #i #j #k #G #D #N (cases D)
173 [normalize #isnil destruct
174 |#P #L normalize #isnil destruct
176 |#G #A1 #i #tjA #Hind #G1 #D (cases D)
177 [#N #Heq #tjN >(delift (lift N O O) A1 O O O ??) //
178 (normalize in Heq) destruct /2/
179 |#H #L #N1 #Heq (normalize in Heq)
180 #tjN1 normalize destruct; (applyS start) /2/
182 |#G #P #Q #R #i #tjP #tjR #Hind1 #Hind2 #G1 #D #N
184 [#Heq destruct #tjN //
185 |#H #L #Heq #tjN1 destruct;
186 (* napplyS weak non va *)
187 (cut (S (length T L) = (length T L)+0+1)) [//]
188 #Hee (applyS weak) /2/
190 |#G #P #Q #i #j #k #Ax #tjP #tjQ #Hind1 #Hind2
191 #G1 #D #N #Heq #tjN normalize @(prod … Ax);
193 |(cut (S (length T D) = (length T D)+1)) [//]
194 #Heq1 <Heq1 @(Hind2 ? (P::D)) normalize //
196 |#G #P #Q #R #S #tjP #tjS #Hind1 #Hind2
197 #G1 #D #N #Heq #tjN (normalize in Hind1 ⊢ %)
198 >(plus_n_O (length ? D)) in ⊢ (? ? ? (? ? % ?))
199 >(subst_lemma R S N ? 0) (applyS app) /2/
200 |#G #P #Q #R #i #tjR #tjProd #Hind1 #Hind2
201 #G1 #D #N #Heq #tjN normalize
203 [normalize in Hind2 /2/
204 |(* napplyS (Hind1 G1 (P::D) N ? tjN); sistemare *)
205 generalize in match (Hind1 G1 (P::D) N ? tjN);
206 [#H (normalize in H) (applyS H) | normalize // ]
208 |#G #P #Q #R #i #convQR #tjP #tjQ #Hind1 #Hind2
210 @(conv …(conv_subst … convQR) ? (Hind2 …)) // @Hind1 //
211 |#G #P #Q #i #tjP #tjQ #Hind1 #Hind2
212 #G1 #D #N #Heq #tjN @dummy /2/