How to formalize forall and exists in PLT Redex?

Question

We all know forall and exists have been used widely in Coq formalisation.
Suppose I want to define a silly toplike (types act li