Proof of proveit.logic.sets.enumeration.fold_singleton theorem

see dependencies

import proveit
%proving fold_singleton

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

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