Def pq == if p q else false fi

is mentioned by

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

[every]

In prior sections: bool 1 hol hol bool hol num hol pair

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