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

see dependencies

import proveit
from proveit import defaults
from proveit import x
from proveit.logic.sets.enumeration  import enum_set_def

%proving unfold

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

defaults.assumptions = unfold.all_conditions()

defaults.assumptions:

enum_set_def

 ⊢  

#enum_set_def.instantiate({x:x, yy:yy})

#%qed