Proof of proveit.logic.booleans.negation.falsified_negation_intro theorem

import proveit
from proveit import A
from proveit.logic.booleans.negation  import not_t
theory = proveit.Theory() # the theorem's theory

%proving falsified_negation_intro

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

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

not_t

 ⊢  

not_t.inner_expr().lhs.operand.substitute(A, assumptions=[A])

 ⊢  

%qed

proveit.logic.booleans.negation.falsified_negation_intro has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3, 4	⊢
	: , :
2	theorem		⊢
	proveit.logic.equality.substitute_truth
3	axiom		⊢
	proveit.logic.booleans.negation.not_t
4	assumption		⊢