importproveittheory=proveit.Theory()# the theorem's theory
In [2]:
%proving unary_mult_reduction
With these allowed/disallowed theorem/theory presumptions (e.g., to avoid circular dependencies), we begin our proof of unary_mult_reduction: (see dependencies)
unary_mult_reduction may now be readily provable (assuming required theorems are usable). Simply execute "%qed".