nil ; h.l' if eq(a,h) l' \ a else h.(l' \ a) fi
(recursive)
Thm* 
St:Type, l:St*, s:St, eq:(St
St
). (l \ s) 
St*
False ; b.bs' b = a T 
mem_f(T;a;bs')
(recursive)
Thm* T:Type, a:T, bs:T*. mem_f(T;a;bs) Prop
| lremove |
Def l \ a == Case of l; nil nil ; h.l' if eq(a,h) l' \ a else h.(l' \ a) fi
(recursive)
Thm* |
| mem_f |
Def mem_f(T;a;bs) == Case of bs; nil False ; b.bs' b = a T mem_f(T;a;bs')
(recursive)
Thm* |
About:
 |  |  |  |  |  |
 |  |  |  |  |  |
 |  |  |  |  |