Proof of proveit.logic.booleans.implication.to_contraposition theorem

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

%proving to_contraposition

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

defaults.assumptions = list(to_contraposition.all_conditions()) + [Not(B)]

defaults.assumptions:

A_implies_B = defaults.assumptions[0]

A_implies_B:

A_implies_B.deny_antecedent().as_implication(Not(B))

,  ⊢  

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

%qed

proveit.logic.booleans.implication.to_contraposition has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	deduction	2	,  ⊢
2	instantiation	3, 4, 5, 6	, ,  ⊢
	:
3	theorem		⊢
	proveit.logic.booleans.implication.modus_tollens_denial
4	assumption		⊢
5	assumption		⊢
6	assumption		⊢