Proof of proveit.logic.sets.inclusion.superset_membership_from_proper_subset theorem

import proveit
theory = proveit.Theory() # the theorem's theory

%proving superset_membership_from_proper_subset

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

A_propersub_B = superset_membership_from_proper_subset.condition

A_propersub_B:

A_propersub_B__unfolded = A_propersub_B.unfold(assumptions=[A_propersub_B])

A_propersub_B__unfolded:  ⊢  

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

A_sub_B = A_propersub_B__unfolded.derive_left()

A_sub_B:  ⊢  

%qed

proveit.logic.sets.inclusion.superset_membership_from_proper_subset has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3, 4	,  ⊢
	: , : , :
2	theorem		⊢
	proveit.logic.sets.inclusion.unfold_subset_eq
3	instantiation	5, 6	⊢
	: , :
4	assumption		⊢
5	theorem		⊢
	proveit.logic.booleans.conjunction.left_from_and
6	instantiation	7, 8	⊢
	: , :
7	conjecture		⊢
	proveit.logic.sets.inclusion.unfold_proper_subset
8	assumption		⊢