Proof of proveit.numbers.negation.neg_as_mult_one theorem

import proveit
theory = proveit.Theory() # the theorem's theory

%proving neg_as_mult_one

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

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