Proof of proveit.logic.booleans.unfold_is_bool_explicit theorem

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

%proving unfold_is_bool_explicit

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

Ain_bool = unfold_is_bool_explicit.conditions[0]

Ain_bool:

defaults.assumptions = [Ain_bool]

defaults.assumptions:

bools_def

 ⊢  

AinTFset = bools_def.sub_right_side_into(Ain_bool)

AinTFset:  ⊢  

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

AinTFset.unfold()

 ⊢  

%qed # unfolding the enumerated set via automation

proveit.logic.booleans.unfold_is_bool_explicit has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3, 4, 5	⊢
	: , : , :
2	conjecture		⊢
	proveit.logic.sets.enumeration.unfold
3	conjecture		⊢
	proveit.numbers.numerals.decimals.nat2
4	instantiation	6	⊢
	: , :
5	instantiation	7, 8, 9	⊢
	: , : , :
6	conjecture		⊢
	proveit.numbers.numerals.decimals.tuple_len_2_typical_eq
7	theorem		⊢
	proveit.logic.equality.sub_right_side_into
8	assumption		⊢
9	axiom		⊢
	proveit.logic.booleans.bools_def