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

# import sys
# sys.path.append('..') # allows access to modules in parent theory
import proveit
from proveit.logic.sets.inclusion  import not_subset_eq_def

%proving fold_not_subset_eq

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

# Pull in the definition of NotSubsetEq
not_subset_eq_def

 ⊢  

not_subset_eq_def_inst = not_subset_eq_def.instantiate()

not_subset_eq_def_inst:  ⊢  

not_subset_eq_def_inst.derive_left_via_equality(assumptions=[not_subset_eq_def_inst.rhs])

 ⊢  

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

%qed

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

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3, 4	⊢
	: , :
2	theorem		⊢
	proveit.logic.equality.lhs_via_equality
3	assumption		⊢
4	instantiation	5	⊢
	: , :
5	axiom		⊢
	proveit.logic.sets.inclusion.not_subset_eq_def