Proof of proveit.logic.equality.unfold_not_equals theorem

import proveit
from proveit import defaults
from proveit import x, y
from proveit.logic.equality  import not_equals_def
theory = proveit.Theory() # the theorem's theory

%proving unfold_not_equals

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

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

defaults.assumptions = unfold_not_equals.all_conditions()

defaults.assumptions:

not_equals_def

 ⊢  

not_equals_def.instantiate({x:x, y:y}).derive_right_via_equality()

 ⊢  

%qed

proveit.logic.equality.unfold_not_equals has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3, 4	⊢
	: , :
2	conjecture		⊢
	proveit.logic.equality.rhs_via_equality
3	assumption		⊢
4	instantiation	5	⊢
	: , :
5	axiom		⊢
	proveit.logic.equality.not_equals_def