Proof of proveit.numbers.ordering.less_than_successor theorem

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

%proving less_than_successor

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

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