Proof of proveit.logic.sets.unification.membership_folding theorem

see dependencies

import proveit
%proving membership_folding

With these allowed/disallowed theorem/theory presumptions (e.g., to avoid circular dependencies), we begin our proof of
membership_folding:
(see dependencies)

membership_folding may now be readily provable (assuming required theorems are usable).  Simply execute "%qed".