Def every(p;l) == if null(l) then true else (p(head(l)))every(p;tl(l)) fi 
Def (recursive)

is mentioned by

Thm* 'a:S, Q,P:('a), l:'a List. Thm* every(x:'a. (P(x))(Q(x));l)  every(P;l) & every(Q;l)	[every_conj]
Thm* 'a:S, Q,P:('a), l:'a List. Thm* every(x:'a. (P(x))(Q(x));l) = (every(P;l)every(Q;l))	[every_conj_2]
Thm* 'a:S, l:'a List, P:('a). every(P;l)  (n:. n<||l||  P(l[n]))	[every_el]

In prior sections: hol list 1

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html