Proof of proveit.logic.booleans.conjunction.unary_and_reduction theorem¶
In [1]:
import proveit
from proveit.logic import TRUE, FALSE
from proveit import A
from proveit.logic.booleans.conjunction import unary_and_reduction_lemma
theory = proveit.Theory() # the theorem's theory
In [2]:
%proving unary_and_reduction
With these allowed/disallowed theorem/theory presumptions (e.g., to avoid circular dependencies), we begin our proof of
unary_and_reduction:
(see dependencies)
unary_and_reduction:
(see dependencies)
In [3]:
unary_and_reduction_lemma
In [4]:
and_true = unary_and_reduction_lemma.instantiate({A:TRUE})
and_true: ⊢ 
In [5]:
and_false = unary_and_reduction_lemma.instantiate({A:FALSE})
and_false: ⊢ 
In [6]:
%qed
Out[6]:
| step type | requirements | statement | ||
|---|---|---|---|---|
| 0 | instantiation | 1, 2, 3 | ⊢ | |
 :  ,  : | ||||
| 1 | conjecture | ⊢  | ||
| proveit.logic.booleans.forall_over_bool_by_cases | ||||
| 2 | instantiation | 6, 4, 5* | ⊢ | |
:  | ||||
| 3 | instantiation | 6, 7, 8* | ⊢ | |
:  | ||||
| 4 | conjecture | ⊢  | ||
| proveit.logic.booleans.true_is_bool | ||||
| 5 | axiom | ⊢  | ||
| proveit.logic.booleans.conjunction.and_t_t | ||||
| 6 | conjecture | ⊢  | ||
| proveit.logic.booleans.conjunction.unary_and_reduction_lemma | ||||
| 7 | conjecture | ⊢  | ||
| proveit.logic.booleans.false_is_bool | ||||
| 8 | axiom | ⊢  | ||
| proveit.logic.booleans.conjunction.and_t_f | ||||
| *equality replacement requirements | ||||