proposition: Lemma lt_le : forall a b, a < b -> a <= b.
proof: Proof. intros. destruct b. - destruct (not_lt_0 a). trivial. - constructor. apply le_S_S. trivial. Qed.
imports: HoTT.Classes.interfaces.abstract_algebra HoTT.Classes.interfaces.naturals HoTT.Classes.interfaces.orders HoTT.Classes.theory.rings HoTT.Classes.orders.semirings HoTT.Classes.theory.apartness