bs ; a.as' a.(as' @ bs) (recursive)
Thm* 
T:Type, as,bs:T*. (as @ bs) 
T*
Thm* i,j:
. i > j Prop
0 ; a.as' ||as'||+1 (recursive)
Thm* A:Type, l:A*. ||l||
Thm* ||nil||
nil ; h.t t
Thm* A:Type, l:A*. tl(l) A*
| append |
Def as @ bs == Case of as; nil bs ; a.as' a.(as' @ bs) (recursive)
Thm* |
| gt |
Def i > j == j < i
Thm* |
| length |
Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)
Thm*
Thm* ||nil|| |
| tl |
Def tl(l) == Case of l; nil nil ; h.t t
Thm* |
About:
 |  |  |  |  |  |  |
 |  |  |  |  |  |  |