Proof of proveit.logic.sets.equivalence.set_equiv_reflexivity theorem

import proveit
from proveit import A, B
from proveit.logic import Equals, SubsetEq
from proveit.logic.sets.equivalence  import set_equiv_def
theory = proveit.Theory() # the theorem's theory

%proving set_equiv_reflexivity

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

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

%qed

proveit.logic.sets.equivalence.set_equiv_reflexivity has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3	⊢
	: , :
2	theorem		⊢
	proveit.logic.sets.equivalence.set_equiv_fold
3	generalization	4	⊢
4	instantiation	5	⊢
	:
5	axiom		⊢
	proveit.logic.equality.equals_reflexivity