Proof of proveit.logic.booleans.conjunction.empty_conjunction_eval theorem

import proveit
from proveit.logic.booleans.conjunction  import empty_conjunction
theory = proveit.Theory() # the theorem's theory

%proving empty_conjunction_eval

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

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

empty_conjunction.evaluation()

 ⊢  

%qed

proveit.logic.booleans.conjunction.empty_conjunction_eval has been proven.

	step type	requirements	statement
0	instantiation	1, 2	⊢
	:
1	axiom		⊢
	proveit.logic.booleans.eq_true_intro
2	axiom		⊢
	proveit.logic.booleans.conjunction.empty_conjunction