Proof of proveit.numbers.addition.weak_bound_via_right_term_bound theorem

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

%proving weak_bound_via_right_term_bound

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

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