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 (* This file was automatically generated: do not edit *********************)
17 include "Basic-1/nf2/defs.ma".
19 include "Basic-1/pr2/clen.ma".
21 include "Basic-1/subst0/dec.ma".
23 include "Basic-1/T/props.ma".
26 \forall (c: C).(\forall (d: C).(\forall (u: T).(\forall (i: nat).((getl i c
27 (CHead d (Bind Abbr) u)) \to ((nf2 c (TLRef i)) \to (\forall (P: Prop).P))))))
29 \lambda (c: C).(\lambda (d: C).(\lambda (u: T).(\lambda (i: nat).(\lambda
30 (H: (getl i c (CHead d (Bind Abbr) u))).(\lambda (H0: ((\forall (t2: T).((pr2
31 c (TLRef i) t2) \to (eq T (TLRef i) t2))))).(\lambda (P:
32 Prop).(lift_gen_lref_false (S i) O i (le_O_n i) (le_n (plus O (S i))) u (H0
33 (lift (S i) O u) (pr2_delta c d u i H (TLRef i) (TLRef i) (pr0_refl (TLRef
34 i)) (lift (S i) O u) (subst0_lref u i))) P))))))).
40 \forall (c: C).(\forall (u: T).(\forall (t: T).((nf2 c (THead (Bind Abst) u
41 t)) \to (land (nf2 c u) (nf2 (CHead c (Bind Abst) u) t)))))
43 \lambda (c: C).(\lambda (u: T).(\lambda (t: T).(\lambda (H: ((\forall (t2:
44 T).((pr2 c (THead (Bind Abst) u t) t2) \to (eq T (THead (Bind Abst) u t)
45 t2))))).(conj (\forall (t2: T).((pr2 c u t2) \to (eq T u t2))) (\forall (t2:
46 T).((pr2 (CHead c (Bind Abst) u) t t2) \to (eq T t t2))) (\lambda (t2:
47 T).(\lambda (H0: (pr2 c u t2)).(let H1 \def (f_equal T T (\lambda (e:
48 T).(match e in T return (\lambda (_: T).T) with [(TSort _) \Rightarrow u |
49 (TLRef _) \Rightarrow u | (THead _ t0 _) \Rightarrow t0])) (THead (Bind Abst)
50 u t) (THead (Bind Abst) t2 t) (H (THead (Bind Abst) t2 t) (pr2_head_1 c u t2
51 H0 (Bind Abst) t))) in (let H2 \def (eq_ind_r T t2 (\lambda (t0: T).(pr2 c u
52 t0)) H0 u H1) in (eq_ind T u (\lambda (t0: T).(eq T u t0)) (refl_equal T u)
53 t2 H1))))) (\lambda (t2: T).(\lambda (H0: (pr2 (CHead c (Bind Abst) u) t
54 t2)).(let H1 \def (f_equal T T (\lambda (e: T).(match e in T return (\lambda
55 (_: T).T) with [(TSort _) \Rightarrow t | (TLRef _) \Rightarrow t | (THead _
56 _ t0) \Rightarrow t0])) (THead (Bind Abst) u t) (THead (Bind Abst) u t2) (H
57 (THead (Bind Abst) u t2) (let H_y \def (pr2_gen_cbind Abst c u t t2 H0) in
58 H_y))) in (let H2 \def (eq_ind_r T t2 (\lambda (t0: T).(pr2 (CHead c (Bind
59 Abst) u) t t0)) H0 t H1) in (eq_ind T t (\lambda (t0: T).(eq T t t0))
60 (refl_equal T t) t2 H1))))))))).
66 \forall (c: C).(\forall (u: T).(\forall (t: T).((nf2 c (THead (Flat Cast) u
67 t)) \to (\forall (P: Prop).P))))
69 \lambda (c: C).(\lambda (u: T).(\lambda (t: T).(\lambda (H: (nf2 c (THead
70 (Flat Cast) u t))).(\lambda (P: Prop).(thead_x_y_y (Flat Cast) u t (H t
71 (pr2_free c (THead (Flat Cast) u t) t (pr0_tau t t (pr0_refl t) u))) P))))).
77 \forall (c: C).(\forall (u: T).(\forall (v: T).(\forall (t: T).((nf2 c
78 (THead (Flat Appl) u (THead (Bind Abst) v t))) \to (\forall (P: Prop).P)))))
80 \lambda (c: C).(\lambda (u: T).(\lambda (v: T).(\lambda (t: T).(\lambda (H:
81 ((\forall (t2: T).((pr2 c (THead (Flat Appl) u (THead (Bind Abst) v t)) t2)
82 \to (eq T (THead (Flat Appl) u (THead (Bind Abst) v t)) t2))))).(\lambda (P:
83 Prop).(let H0 \def (eq_ind T (THead (Flat Appl) u (THead (Bind Abst) v t))
84 (\lambda (ee: T).(match ee in T return (\lambda (_: T).Prop) with [(TSort _)
85 \Rightarrow False | (TLRef _) \Rightarrow False | (THead k _ _) \Rightarrow
86 (match k in K return (\lambda (_: K).Prop) with [(Bind _) \Rightarrow False |
87 (Flat _) \Rightarrow True])])) I (THead (Bind Abbr) u t) (H (THead (Bind
88 Abbr) u t) (pr2_free c (THead (Flat Appl) u (THead (Bind Abst) v t)) (THead
89 (Bind Abbr) u t) (pr0_beta v u u (pr0_refl u) t t (pr0_refl t))))) in
90 (False_ind P H0))))))).
96 \forall (f: F).(\forall (c: C).(\forall (u: T).(\forall (t: T).((nf2 c
97 (THead (Flat f) u t)) \to (land (nf2 c u) (nf2 c t))))))
99 \lambda (f: F).(\lambda (c: C).(\lambda (u: T).(\lambda (t: T).(\lambda (H:
100 ((\forall (t2: T).((pr2 c (THead (Flat f) u t) t2) \to (eq T (THead (Flat f)
101 u t) t2))))).(conj (\forall (t2: T).((pr2 c u t2) \to (eq T u t2))) (\forall
102 (t2: T).((pr2 c t t2) \to (eq T t t2))) (\lambda (t2: T).(\lambda (H0: (pr2 c
103 u t2)).(let H1 \def (f_equal T T (\lambda (e: T).(match e in T return
104 (\lambda (_: T).T) with [(TSort _) \Rightarrow u | (TLRef _) \Rightarrow u |
105 (THead _ t0 _) \Rightarrow t0])) (THead (Flat f) u t) (THead (Flat f) t2 t)
106 (H (THead (Flat f) t2 t) (pr2_head_1 c u t2 H0 (Flat f) t))) in H1)))
107 (\lambda (t2: T).(\lambda (H0: (pr2 c t t2)).(let H1 \def (f_equal T T
108 (\lambda (e: T).(match e in T return (\lambda (_: T).T) with [(TSort _)
109 \Rightarrow t | (TLRef _) \Rightarrow t | (THead _ _ t0) \Rightarrow t0]))
110 (THead (Flat f) u t) (THead (Flat f) u t2) (H (THead (Flat f) u t2)
111 (pr2_head_2 c u t t2 (Flat f) (pr2_cflat c t t2 H0 f u)))) in H1)))))))).
116 theorem nf2_gen__nf2_gen_aux:
117 \forall (b: B).(\forall (x: T).(\forall (u: T).(\forall (d: nat).((eq T
118 (THead (Bind b) u (lift (S O) d x)) x) \to (\forall (P: Prop).P)))))
120 \lambda (b: B).(\lambda (x: T).(T_ind (\lambda (t: T).(\forall (u:
121 T).(\forall (d: nat).((eq T (THead (Bind b) u (lift (S O) d t)) t) \to
122 (\forall (P: Prop).P))))) (\lambda (n: nat).(\lambda (u: T).(\lambda (d:
123 nat).(\lambda (H: (eq T (THead (Bind b) u (lift (S O) d (TSort n))) (TSort
124 n))).(\lambda (P: Prop).(let H0 \def (eq_ind T (THead (Bind b) u (lift (S O)
125 d (TSort n))) (\lambda (ee: T).(match ee in T return (\lambda (_: T).Prop)
126 with [(TSort _) \Rightarrow False | (TLRef _) \Rightarrow False | (THead _ _
127 _) \Rightarrow True])) I (TSort n) H) in (False_ind P H0))))))) (\lambda (n:
128 nat).(\lambda (u: T).(\lambda (d: nat).(\lambda (H: (eq T (THead (Bind b) u
129 (lift (S O) d (TLRef n))) (TLRef n))).(\lambda (P: Prop).(let H0 \def (eq_ind
130 T (THead (Bind b) u (lift (S O) d (TLRef n))) (\lambda (ee: T).(match ee in T
131 return (\lambda (_: T).Prop) with [(TSort _) \Rightarrow False | (TLRef _)
132 \Rightarrow False | (THead _ _ _) \Rightarrow True])) I (TLRef n) H) in
133 (False_ind P H0))))))) (\lambda (k: K).(\lambda (t: T).(\lambda (_: ((\forall
134 (u: T).(\forall (d: nat).((eq T (THead (Bind b) u (lift (S O) d t)) t) \to
135 (\forall (P: Prop).P)))))).(\lambda (t0: T).(\lambda (H0: ((\forall (u:
136 T).(\forall (d: nat).((eq T (THead (Bind b) u (lift (S O) d t0)) t0) \to
137 (\forall (P: Prop).P)))))).(\lambda (u: T).(\lambda (d: nat).(\lambda (H1:
138 (eq T (THead (Bind b) u (lift (S O) d (THead k t t0))) (THead k t
139 t0))).(\lambda (P: Prop).(let H2 \def (f_equal T K (\lambda (e: T).(match e
140 in T return (\lambda (_: T).K) with [(TSort _) \Rightarrow (Bind b) | (TLRef
141 _) \Rightarrow (Bind b) | (THead k0 _ _) \Rightarrow k0])) (THead (Bind b) u
142 (lift (S O) d (THead k t t0))) (THead k t t0) H1) in ((let H3 \def (f_equal T
143 T (\lambda (e: T).(match e in T return (\lambda (_: T).T) with [(TSort _)
144 \Rightarrow u | (TLRef _) \Rightarrow u | (THead _ t1 _) \Rightarrow t1]))
145 (THead (Bind b) u (lift (S O) d (THead k t t0))) (THead k t t0) H1) in ((let
146 H4 \def (f_equal T T (\lambda (e: T).(match e in T return (\lambda (_: T).T)
147 with [(TSort _) \Rightarrow (THead k ((let rec lref_map (f: ((nat \to nat)))
148 (d0: nat) (t1: T) on t1: T \def (match t1 with [(TSort n) \Rightarrow (TSort
149 n) | (TLRef i) \Rightarrow (TLRef (match (blt i d0) with [true \Rightarrow i
150 | false \Rightarrow (f i)])) | (THead k0 u0 t2) \Rightarrow (THead k0
151 (lref_map f d0 u0) (lref_map f (s k0 d0) t2))]) in lref_map) (\lambda (x0:
152 nat).(plus x0 (S O))) d t) ((let rec lref_map (f: ((nat \to nat))) (d0: nat)
153 (t1: T) on t1: T \def (match t1 with [(TSort n) \Rightarrow (TSort n) |
154 (TLRef i) \Rightarrow (TLRef (match (blt i d0) with [true \Rightarrow i |
155 false \Rightarrow (f i)])) | (THead k0 u0 t2) \Rightarrow (THead k0 (lref_map
156 f d0 u0) (lref_map f (s k0 d0) t2))]) in lref_map) (\lambda (x0: nat).(plus
157 x0 (S O))) (s k d) t0)) | (TLRef _) \Rightarrow (THead k ((let rec lref_map
158 (f: ((nat \to nat))) (d0: nat) (t1: T) on t1: T \def (match t1 with [(TSort
159 n) \Rightarrow (TSort n) | (TLRef i) \Rightarrow (TLRef (match (blt i d0)
160 with [true \Rightarrow i | false \Rightarrow (f i)])) | (THead k0 u0 t2)
161 \Rightarrow (THead k0 (lref_map f d0 u0) (lref_map f (s k0 d0) t2))]) in
162 lref_map) (\lambda (x0: nat).(plus x0 (S O))) d t) ((let rec lref_map (f:
163 ((nat \to nat))) (d0: nat) (t1: T) on t1: T \def (match t1 with [(TSort n)
164 \Rightarrow (TSort n) | (TLRef i) \Rightarrow (TLRef (match (blt i d0) with
165 [true \Rightarrow i | false \Rightarrow (f i)])) | (THead k0 u0 t2)
166 \Rightarrow (THead k0 (lref_map f d0 u0) (lref_map f (s k0 d0) t2))]) in
167 lref_map) (\lambda (x0: nat).(plus x0 (S O))) (s k d) t0)) | (THead _ _ t1)
168 \Rightarrow t1])) (THead (Bind b) u (lift (S O) d (THead k t t0))) (THead k t
169 t0) H1) in (\lambda (_: (eq T u t)).(\lambda (H6: (eq K (Bind b) k)).(let H7
170 \def (eq_ind_r K k (\lambda (k0: K).(eq T (lift (S O) d (THead k0 t t0)) t0))
171 H4 (Bind b) H6) in (let H8 \def (eq_ind T (lift (S O) d (THead (Bind b) t
172 t0)) (\lambda (t1: T).(eq T t1 t0)) H7 (THead (Bind b) (lift (S O) d t) (lift
173 (S O) (S d) t0)) (lift_bind b t t0 (S O) d)) in (H0 (lift (S O) d t) (S d) H8
174 P)))))) H3)) H2))))))))))) x)).
179 theorem nf2_gen_abbr:
180 \forall (c: C).(\forall (u: T).(\forall (t: T).((nf2 c (THead (Bind Abbr) u
181 t)) \to (\forall (P: Prop).P))))
183 \lambda (c: C).(\lambda (u: T).(\lambda (t: T).(\lambda (H: ((\forall (t2:
184 T).((pr2 c (THead (Bind Abbr) u t) t2) \to (eq T (THead (Bind Abbr) u t)
185 t2))))).(\lambda (P: Prop).(let H_x \def (dnf_dec u t O) in (let H0 \def H_x
186 in (ex_ind T (\lambda (v: T).(or (subst0 O u t (lift (S O) O v)) (eq T t
187 (lift (S O) O v)))) P (\lambda (x: T).(\lambda (H1: (or (subst0 O u t (lift
188 (S O) O x)) (eq T t (lift (S O) O x)))).(or_ind (subst0 O u t (lift (S O) O
189 x)) (eq T t (lift (S O) O x)) P (\lambda (H2: (subst0 O u t (lift (S O) O
190 x))).(let H3 \def (f_equal T T (\lambda (e: T).(match e in T return (\lambda
191 (_: T).T) with [(TSort _) \Rightarrow t | (TLRef _) \Rightarrow t | (THead _
192 _ t0) \Rightarrow t0])) (THead (Bind Abbr) u t) (THead (Bind Abbr) u (lift (S
193 O) O x)) (H (THead (Bind Abbr) u (lift (S O) O x)) (pr2_free c (THead (Bind
194 Abbr) u t) (THead (Bind Abbr) u (lift (S O) O x)) (pr0_delta u u (pr0_refl u)
195 t t (pr0_refl t) (lift (S O) O x) H2)))) in (let H4 \def (eq_ind T t (\lambda
196 (t0: T).(subst0 O u t0 (lift (S O) O x))) H2 (lift (S O) O x) H3) in
197 (subst0_refl u (lift (S O) O x) O H4 P)))) (\lambda (H2: (eq T t (lift (S O)
198 O x))).(let H3 \def (eq_ind T t (\lambda (t0: T).(\forall (t2: T).((pr2 c
199 (THead (Bind Abbr) u t0) t2) \to (eq T (THead (Bind Abbr) u t0) t2)))) H
200 (lift (S O) O x) H2) in (nf2_gen__nf2_gen_aux Abbr x u O (H3 x (pr2_free c
201 (THead (Bind Abbr) u (lift (S O) O x)) x (pr0_zeta Abbr not_abbr_abst x x
202 (pr0_refl x) u))) P))) H1))) H0))))))).
207 theorem nf2_gen_void:
208 \forall (c: C).(\forall (u: T).(\forall (t: T).((nf2 c (THead (Bind Void) u
209 (lift (S O) O t))) \to (\forall (P: Prop).P))))
211 \lambda (c: C).(\lambda (u: T).(\lambda (t: T).(\lambda (H: ((\forall (t2:
212 T).((pr2 c (THead (Bind Void) u (lift (S O) O t)) t2) \to (eq T (THead (Bind
213 Void) u (lift (S O) O t)) t2))))).(\lambda (P: Prop).(nf2_gen__nf2_gen_aux
214 Void t u O (H t (pr2_free c (THead (Bind Void) u (lift (S O) O t)) t
215 (pr0_zeta Void (sym_not_eq B Abst Void not_abst_void) t t (pr0_refl t) u)))