- Inductive drop : nat -> nat -> C -> C -> Prop :=
- | drop_sort : (h,d,n:?) (drop h d (CSort n) (CSort n))
- | drop_tail : (c,e:?) (drop (0) (0) c e) ->
- (k:?; u:?) (drop (0) (0) (CTail c k u) (CTail e k u))
- | drop_drop : (k:?; h:?; c,e:?) (drop (r k h) (0) c e) ->
- (u:?) (drop (S h) (0) (CTail c k u) e)
- | drop_skip : (k:?; h,d:?; c,e:?) (drop h (r k d) c e) -> (u:?)
- (drop h (S d) (CTail c k (lift h (r k d) u)) (CTail e k u)).
+(*#* #caption "current axioms for dropping",
+ "base case", "untouched tail item",
+ "dropped tail item", "updated tail item"
+*)
+(*#* #cap #alpha c in C1, e in C2, u in V, k in z, n in k, d in i, r in q *)
+
+ Inductive drop: nat -> nat -> C -> C -> Prop :=
+ | drop_sort: (h,d,n:?) (drop h d (CSort n) (CSort n))
+ | drop_comp: (c,e:?) (drop (0) (0) c e) ->
+ (k:?; u:?) (drop (0) (0) (CTail c k u) (CTail e k u))
+ | drop_drop: (k:?; h:?; c,e:?) (drop (r k h) (0) c e) ->
+ (u:?) (drop (S h) (0) (CTail c k u) e)
+ | drop_skip: (k:?; h,d:?; c,e:?) (drop h (r k d) c e) -> (u:?)
+ (drop h (S d) (CTail c k (lift h (r k d) u)) (CTail e k u)).
+
+(*#* #stop file *)