Thms det automata Sections AutomataTheory Doc

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* T:Type, a:T, bs:T*. mem_f(T;a;bs) Prop

About:
recursive_def_notice!abstractionlist_indfalseorequal
alluniverselistmemberprop