3 Require Export terms_defs.
5 Inductive Set C := CSort : nat -> C
6 | CTail : C -> K -> T -> C.
8 Hint f3CKT : ltlc := Resolve (f_equal3 C K T).
10 Tactic Definition CGenBase :=
12 | [ H: (CTail ? ? ?) = (CTail ? ? ?) |- ? ] -> Inversion H; Clear H
15 Definition r: K -> nat -> nat := [k;i] Cases k of
20 Fixpoint app [c:C] : nat -> T -> T := [j;t]Cases j c of
23 | (S i) (CTail c k u) => (app c (r k i) (TTail k u t))
26 Section r_props. (********************************************************)
28 Theorem r_S: (k:?; i:?) (r k (S i)) = (S (r k i)).
32 Theorem r_plus_sym: (k:?; i,j:?) (r k (plus i j)) = (plus i (r k j)).
33 XElim k; Intros; Simpl; XAuto.
36 Theorem r_minus: (i,n:?) (lt n i) ->
37 (k:?) (minus (r k i) (S n)) = (r k (minus i (S n))).
38 XElim k; Intros; Simpl; XEAuto.
41 Theorem r_dis: (k:?; P:Prop)
42 (((i:?) (r k i) = i) -> P) ->
43 (((i:?) (r k i) = (S i)) -> P) -> P.
49 Tactic Definition RRw :=
50 Repeat (Rewrite r_S Orelse Rewrite r_plus_sym).
52 Section r_arith. (********************************************************)
54 Theorem r_arith0: (k:?; i:?) (minus (r k (S i)) (1)) = (r k i).
55 Intros; RRw; Rewrite minus_Sx_SO; XAuto.
58 Theorem r_arith1: (k:?; i,j:?) (minus (r k (S i)) (S j)) = (minus (r k i) j).
64 Section app_props. (******************************************************)
66 Theorem app_csort : (t:?; i,n:?) (app (CSort n) i t) = t.
67 XElim i; Intros; Simpl; XAuto.
70 Theorem app_O : (c:?; t:?) (app c (0) t) = t.
76 Hints Resolve app_csort app_O : ltlc.