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/cnt/defs.ma".
19 implied rec lemma cnt_ind (P: (T \to Prop)) (f: (\forall (n: nat).(P (TSort
20 n)))) (f0: (\forall (t: T).((cnt t) \to ((P t) \to (\forall (k: K).(\forall
21 (v: T).(P (THead k v t)))))))) (t: T) (c: cnt t) on c: P t \def match c with
22 [(cnt_sort n) \Rightarrow (f n) | (cnt_head t0 c0 k v) \Rightarrow (f0 t0 c0
23 ((cnt_ind P f f0) t0 c0) k v)].