logo
In [1]:
import proveit
from proveit import A
from proveit.logic import Not
from proveit.logic.booleans import false_is_bool
theory = proveit.Theory() # the theorem's theory
In [2]:
%proving in_bool_if_false
With these allowed/disallowed theorem/theory presumptions (e.g., to avoid circular dependencies), we begin our proof of
in_bool_if_false:
(see dependencies)
in_bool_if_false may now be readily provable (assuming required theorems are usable).  Simply execute "%qed".
In [3]:
%qed # proven via automation
proveit.logic.booleans.in_bool_if_false has been proven.
Out[3]:
 step typerequirementsstatement
0generalization1  ⊢  
1instantiation2, 3  ⊢  
  :
2axiom  ⊢  
 proveit.logic.booleans.negation.operand_is_bool
3instantiation4, 5  ⊢  
  :
4conjecture  ⊢  
 proveit.logic.booleans.in_bool_if_true
5assumption  ⊢