Proof of proveit.numbers.number_sets.natural_numbers.natural_pos_lower_bound theorem

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

%proving natural_pos_lower_bound

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

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