Proof of proveit.numbers.numerals.decimals.mult_2_5 theorem

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

%proving mult_2_5

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

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