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/C/defs.ma".
19 let rec C_rect (P: (C \to Type[0])) (f: (\forall (n: nat).(P (CSort n))))
20 (f0: (\forall (c: C).((P c) \to (\forall (k: K).(\forall (t: T).(P (CHead c k
21 t))))))) (c: C) on c: P c \def match c with [(CSort n) \Rightarrow (f n) |
22 (CHead c0 k t) \Rightarrow (let TMP_1 \def ((C_rect P f f0) c0) in (f0 c0
26 \forall (P: ((C \to Prop))).(((\forall (n: nat).(P (CSort n)))) \to
27 (((\forall (c: C).((P c) \to (\forall (k: K).(\forall (t: T).(P (CHead c k
28 t))))))) \to (\forall (c: C).(P c))))
30 \lambda (P: ((C \to Prop))).(C_rect P).
32 theorem clt_wf__q_ind:
33 \forall (P: ((C \to Prop))).(((\forall (n: nat).((\lambda (P0: ((C \to
34 Prop))).(\lambda (n0: nat).(\forall (c: C).((eq nat (cweight c) n0) \to (P0
35 c))))) P n))) \to (\forall (c: C).(P c)))
37 let Q \def (\lambda (P: ((C \to Prop))).(\lambda (n: nat).(\forall (c:
38 C).((eq nat (cweight c) n) \to (P c))))) in (\lambda (P: ((C \to
39 Prop))).(\lambda (H: ((\forall (n: nat).(\forall (c: C).((eq nat (cweight c)
40 n) \to (P c)))))).(\lambda (c: C).(let TMP_1 \def (cweight c) in (let TMP_2
41 \def (cweight c) in (let TMP_3 \def (refl_equal nat TMP_2) in (H TMP_1 c
45 \forall (P: ((C \to Prop))).(((\forall (c: C).(((\forall (d: C).((clt d c)
46 \to (P d)))) \to (P c)))) \to (\forall (c: C).(P c)))
48 let Q \def (\lambda (P: ((C \to Prop))).(\lambda (n: nat).(\forall (c:
49 C).((eq nat (cweight c) n) \to (P c))))) in (\lambda (P: ((C \to
50 Prop))).(\lambda (H: ((\forall (c: C).(((\forall (d: C).((lt (cweight d)
51 (cweight c)) \to (P d)))) \to (P c))))).(\lambda (c: C).(let TMP_1 \def
52 (\lambda (c0: C).(P c0)) in (let TMP_11 \def (\lambda (n: nat).(let TMP_2
53 \def (\lambda (c0: C).(P c0)) in (let TMP_3 \def (Q TMP_2) in (let TMP_10
54 \def (\lambda (n0: nat).(\lambda (H0: ((\forall (m: nat).((lt m n0) \to (Q
55 (\lambda (c0: C).(P c0)) m))))).(\lambda (c0: C).(\lambda (H1: (eq nat
56 (cweight c0) n0)).(let TMP_4 \def (\lambda (n1: nat).(\forall (m: nat).((lt m
57 n1) \to (\forall (c1: C).((eq nat (cweight c1) m) \to (P c1)))))) in (let
58 TMP_5 \def (cweight c0) in (let H2 \def (eq_ind_r nat n0 TMP_4 H0 TMP_5 H1)
59 in (let TMP_9 \def (\lambda (d: C).(\lambda (H3: (lt (cweight d) (cweight
60 c0))).(let TMP_6 \def (cweight d) in (let TMP_7 \def (cweight d) in (let
61 TMP_8 \def (refl_equal nat TMP_7) in (H2 TMP_6 H3 d TMP_8)))))) in (H c0
62 TMP_9))))))))) in (lt_wf_ind n TMP_3 TMP_10))))) in (clt_wf__q_ind TMP_1