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 "LambdaDelta-1/getl/defs.ma".
19 include "LambdaDelta-1/drop/fwd.ma".
21 include "LambdaDelta-1/clear/fwd.ma".
24 \forall (c1: C).(\forall (c2: C).(\forall (i: nat).((getl i c1 c2) \to (ex2
25 C (\lambda (e: C).(drop i O c1 e)) (\lambda (e: C).(clear e c2))))))
27 \lambda (c1: C).(\lambda (c2: C).(\lambda (i: nat).(\lambda (H: (getl i c1
28 c2)).(let H0 \def (match H in getl return (\lambda (_: (getl ? ? ?)).(ex2 C
29 (\lambda (e: C).(drop i O c1 e)) (\lambda (e: C).(clear e c2)))) with
30 [(getl_intro e H0 H1) \Rightarrow (ex_intro2 C (\lambda (e0: C).(drop i O c1
31 e0)) (\lambda (e0: C).(clear e0 c2)) e H0 H1)]) in H0)))).
33 theorem getl_gen_sort:
34 \forall (n: nat).(\forall (h: nat).(\forall (x: C).((getl h (CSort n) x) \to
35 (\forall (P: Prop).P))))
37 \lambda (n: nat).(\lambda (h: nat).(\lambda (x: C).(\lambda (H: (getl h
38 (CSort n) x)).(\lambda (P: Prop).(let H0 \def (getl_gen_all (CSort n) x h H)
39 in (ex2_ind C (\lambda (e: C).(drop h O (CSort n) e)) (\lambda (e: C).(clear
40 e x)) P (\lambda (x0: C).(\lambda (H1: (drop h O (CSort n) x0)).(\lambda (H2:
41 (clear x0 x)).(and3_ind (eq C x0 (CSort n)) (eq nat h O) (eq nat O O) P
42 (\lambda (H3: (eq C x0 (CSort n))).(\lambda (_: (eq nat h O)).(\lambda (_:
43 (eq nat O O)).(let H6 \def (eq_ind C x0 (\lambda (c: C).(clear c x)) H2
44 (CSort n) H3) in (clear_gen_sort x n H6 P))))) (drop_gen_sort n h O x0
48 \forall (e: C).(\forall (x: C).((getl O e x) \to (clear e x)))
50 \lambda (e: C).(\lambda (x: C).(\lambda (H: (getl O e x)).(let H0 \def
51 (getl_gen_all e x O H) in (ex2_ind C (\lambda (e0: C).(drop O O e e0))
52 (\lambda (e0: C).(clear e0 x)) (clear e x) (\lambda (x0: C).(\lambda (H1:
53 (drop O O e x0)).(\lambda (H2: (clear x0 x)).(let H3 \def (eq_ind_r C x0
54 (\lambda (c: C).(clear c x)) H2 e (drop_gen_refl e x0 H1)) in H3)))) H0)))).
57 \forall (k: K).(\forall (c: C).(\forall (x: C).(\forall (u: T).(\forall (h:
58 nat).((getl (S h) (CHead c k u) x) \to (getl (r k h) c x))))))
60 \lambda (k: K).(\lambda (c: C).(\lambda (x: C).(\lambda (u: T).(\lambda (h:
61 nat).(\lambda (H: (getl (S h) (CHead c k u) x)).(let H0 \def (getl_gen_all
62 (CHead c k u) x (S h) H) in (ex2_ind C (\lambda (e: C).(drop (S h) O (CHead c
63 k u) e)) (\lambda (e: C).(clear e x)) (getl (r k h) c x) (\lambda (x0:
64 C).(\lambda (H1: (drop (S h) O (CHead c k u) x0)).(\lambda (H2: (clear x0
65 x)).(getl_intro (r k h) c x x0 (drop_gen_drop k c x0 u h H1) H2)))) H0))))))).
67 theorem getl_gen_flat:
68 \forall (f: F).(\forall (e: C).(\forall (d: C).(\forall (v: T).(\forall (i:
69 nat).((getl i (CHead e (Flat f) v) d) \to (getl i e d))))))
71 \lambda (f: F).(\lambda (e: C).(\lambda (d: C).(\lambda (v: T).(\lambda (i:
72 nat).(nat_ind (\lambda (n: nat).((getl n (CHead e (Flat f) v) d) \to (getl n
73 e d))) (\lambda (H: (getl O (CHead e (Flat f) v) d)).(getl_intro O e d e
74 (drop_refl e) (clear_gen_flat f e d v (getl_gen_O (CHead e (Flat f) v) d
75 H)))) (\lambda (n: nat).(\lambda (_: (((getl n (CHead e (Flat f) v) d) \to
76 (getl n e d)))).(\lambda (H0: (getl (S n) (CHead e (Flat f) v)
77 d)).(getl_gen_S (Flat f) e d v n H0)))) i))))).
79 theorem getl_gen_bind:
80 \forall (b: B).(\forall (e: C).(\forall (d: C).(\forall (v: T).(\forall (i:
81 nat).((getl i (CHead e (Bind b) v) d) \to (or (land (eq nat i O) (eq C d
82 (CHead e (Bind b) v))) (ex2 nat (\lambda (j: nat).(eq nat i (S j))) (\lambda
83 (j: nat).(getl j e d)))))))))
85 \lambda (b: B).(\lambda (e: C).(\lambda (d: C).(\lambda (v: T).(\lambda (i:
86 nat).(nat_ind (\lambda (n: nat).((getl n (CHead e (Bind b) v) d) \to (or
87 (land (eq nat n O) (eq C d (CHead e (Bind b) v))) (ex2 nat (\lambda (j:
88 nat).(eq nat n (S j))) (\lambda (j: nat).(getl j e d)))))) (\lambda (H: (getl
89 O (CHead e (Bind b) v) d)).(eq_ind_r C (CHead e (Bind b) v) (\lambda (c:
90 C).(or (land (eq nat O O) (eq C c (CHead e (Bind b) v))) (ex2 nat (\lambda
91 (j: nat).(eq nat O (S j))) (\lambda (j: nat).(getl j e c))))) (or_introl
92 (land (eq nat O O) (eq C (CHead e (Bind b) v) (CHead e (Bind b) v))) (ex2 nat
93 (\lambda (j: nat).(eq nat O (S j))) (\lambda (j: nat).(getl j e (CHead e
94 (Bind b) v)))) (conj (eq nat O O) (eq C (CHead e (Bind b) v) (CHead e (Bind
95 b) v)) (refl_equal nat O) (refl_equal C (CHead e (Bind b) v)))) d
96 (clear_gen_bind b e d v (getl_gen_O (CHead e (Bind b) v) d H)))) (\lambda (n:
97 nat).(\lambda (_: (((getl n (CHead e (Bind b) v) d) \to (or (land (eq nat n
98 O) (eq C d (CHead e (Bind b) v))) (ex2 nat (\lambda (j: nat).(eq nat n (S
99 j))) (\lambda (j: nat).(getl j e d))))))).(\lambda (H0: (getl (S n) (CHead e
100 (Bind b) v) d)).(or_intror (land (eq nat (S n) O) (eq C d (CHead e (Bind b)
101 v))) (ex2 nat (\lambda (j: nat).(eq nat (S n) (S j))) (\lambda (j: nat).(getl
102 j e d))) (ex_intro2 nat (\lambda (j: nat).(eq nat (S n) (S j))) (\lambda (j:
103 nat).(getl j e d)) n (refl_equal nat (S n)) (getl_gen_S (Bind b) e d v n